default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakeshi Nakai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Takeshi Nakai, Kazumasa Shinagawa:
Secure multi-party computation with legally-enforceable fairness. Int. J. Inf. Sec. 23(6): 3609-3623 (2024)- [j8]Takeshi Nakai
, Keita Iwanari, Tomoki Ono, Yoshiki Abe, Yohei Watanabe, Mitsugu Iwamoto:
Card-based Cryptography with a Standard Deck of Cards, Revisited: Efficient Protocols in the Private Model. New Gener. Comput. 42(3): 345-358 (2024) - [j7]Anastasiia Doi, Tomoki Ono, Yoshiki Abe, Takeshi Nakai, Kazumasa Shinagawa, Yohei Watanabe, Koji Nuida, Mitsugu Iwamoto:
Card-Based Protocols for Private Set Intersection and Union. New Gener. Comput. 42(3): 359-380 (2024) - 2023
- [j6]Yoshiki Abe, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto, Kazuo Ohta:
A Computationally Efficient Card-Based Majority Voting Protocol with Fewer Cards in the Private Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(3): 315-324 (2023) - [j5]Takeshi Nakai, Kazumasa Shinagawa:
Constant-round linear-broadcast secure computation with penalties. Theor. Comput. Sci. 959: 113874 (2023) - [c9]Kota Sugimoto, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto:
The Two Sheriffs Problem: Cryptographic Formalization and Generalization. COCOA (1) 2023: 512-523 - [c8]Takeshi Nakai, Kazumasa Shinagawa:
Secure Multi-party Computation with Legally-Enforceable Fairness. ICICS 2023: 161-178 - [c7]Shun Uchizono, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto:
Constant-Deposit Multiparty Lotteries on Bitcoin for Arbitrary Number of Players and Winners. ICISC (2) 2023: 133-156 - [c6]Tomoki Ono, Kazumasa Shinagawa, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto:
Single-Shuffle Card-Based Protocols with Six Cards per Gate. ICISC (2) 2023: 157-169 - 2022
- [j4]Yohei Watanabe, Takeshi Nakai, Kazuma Ohara, Takuya Nojima, Yexuan Liu, Mitsugu Iwamoto, Kazuo Ohta:
How to Make a Secure Index for Searchable Symmetric Encryption, Revisited. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(12): 1559-1577 (2022) - [j3]Takeshi Nakai, Satoshi Shirouchi, Yuuki Tokushige, Mitsugu Iwamoto, Kazuo Ohta:
Secure Computation for Threshold Functions with Physical Cards: Power of Private Permutations. New Gener. Comput. 40(1): 95-113 (2022) - [j2]Yoshiki Abe, Takeshi Nakai, Yoshihisa Kuroki, Shinnosuke Suzuki, Yuta Koga, Yohei Watanabe, Mitsugu Iwamoto, Kazuo Ohta:
Efficient Card-Based Majority Voting Protocols. New Gener. Comput. 40(1): 173-198 (2022) - [c5]Seiya Shimizu, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto:
An Improvement of Multi-Party Private Set Intersection Based on Oblivious Programmable PRFs. ISITA 2022: 234-238 - [c4]Anastasiia Doi, Tomoki Ono, Takeshi Nakai, Kazumasa Shinagawa, Yohei Watanabe, Koji Nuida, Mitsugu Iwamoto:
Card-based Cryptographic Protocols for Private Set Intersection. ISITA 2022: 239-243 - [i2]Takeshi Nakai, Kazumasa Shinagawa:
Constant-Round Linear-Broadcast Secure Computation with Penalties. CoRR abs/2206.06010 (2022) - 2021
- [j1]Takeshi Nakai, Yuto Misawa, Yuuki Tokushige, Mitsugu Iwamoto, Kazuo Ohta:
How to Solve Millionaires' Problem with Two Kinds of Cards. New Gener. Comput. 39(1): 73-96 (2021) - [c3]Takeshi Nakai, Kazumasa Shinagawa:
Secure Computation with Non-Equivalent Penalties in Constant Rounds. Tokenomics 2021: 5:1-5:16 - [i1]Yohei Watanabe, Takeshi Nakai, Kazuma Ohara, Takuya Nojima, Yexuan Liu, Mitsugu Iwamoto, Kazuo Ohta:
How to Make a Secure Index for Searchable Symmetric Encryption, Revisited. IACR Cryptol. ePrint Arch. 2021: 948 (2021)
2010 – 2019
- 2017
- [c2]Takeshi Nakai, Satoshi Shirouchi, Mitsugu Iwamoto, Kazuo Ohta:
Four Cards Are Sufficient for a Card-Based Three-Input Voting Protocol Utilizing Private Permutations. ICITS 2017: 153-165 - 2016
- [c1]Takeshi Nakai, Yuuki Tokushige, Yuto Misawa, Mitsugu Iwamoto, Kazuo Ohta:
Efficient Card-Based Cryptographic Protocols for Millionaires' Problem Utilizing Private Permutations. CANS 2016: 500-517
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
