default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazumasa Shinagawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Yuta Minamikawa, Kazumasa Shinagawa:
Coin-Based Cryptographic Protocols without Hand Operations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(8): 1178-1185 (2024)- [j15]Takeshi Nakai, Kazumasa Shinagawa:
Secure multi-party computation with legally-enforceable fairness. Int. J. Inf. Sec. 23(6): 3609-3623 (2024) - [j14]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) - [j13]Shun Sasaki, Kazumasa Shinagawa:
Physical Zero-Knowledge Proof for Sukoro. New Gener. Comput. 42(3): 381-398 (2024) - [j12]Yoshihiro Takahashi, Kazumasa Shinagawa:
Extended Addition Protocol and Efficient Voting Protocols Using Regular Polygon Cards. New Gener. Comput. 42(3): 479-496 (2024) - [c29]Kazumasa Shinagawa:
Size-Hiding Computation in the Honest-But-Curious Model. ACISP (2) 2024: 311-329 - [c28]Yoshihiro Takahashi, Kazumasa Shinagawa, Hayato Shikata, Takaaki Mizuki:
Efficient Card-Based Protocols for Symmetric Functions Using Four-Colored Decks. APKC@AsiaCCS 2024 - [c27]Reo Eriguchi, Kazumasa Shinagawa, Takao Murakami:
Card-Based Cryptography Meets Differential Privacy. FUN 2024: 12:1-12:20 - [c26]Kazumasa Shinagawa, Kazuki Kanai, Kengo Miyamoto, Koji Nuida:
How to Covertly and Uniformly Scramble the 15 Puzzle and Rubik's Cube. FUN 2024: 30:1-30:15 - [c25]Yoshiaki Honda, Kazumasa Shinagawa:
Efficient Card-Based Protocols with a Standard Deck of Playing Cards Using Partial Opening. IWSEC 2024: 85-100 - 2023
- [j11]Kazumasa Shinagawa, Reo Eriguchi, Shohei Satake, Koji Nuida:
Private simultaneous messages based on quadratic residues. Des. Codes Cryptogr. 91(12): 3915-3932 (2023) - [j10]Kazumasa Shinagawa, Kengo Miyamoto:
Automorphism Shuffles for Graphs and Hypergraphs and Its Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(3): 306-314 (2023) - [j9]Takeshi Nakai, Kazumasa Shinagawa:
Constant-round linear-broadcast secure computation with penalties. Theor. Comput. Sci. 959: 113874 (2023) - [c24]Yoshifumi Manabe, Kazumasa Shinagawa:
Free-XOR in Card-Based Garbled Circuits. CANS 2023: 232-248 - [c23]Takeshi Nakai, Kazumasa Shinagawa:
Secure Multi-party Computation with Legally-Enforceable Fairness. ICICS 2023: 161-178 - [c22]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 - [c21]Kazumasa Shinagawa, Koji Nuida:
Explicit Lower Bounds for Communication Complexity of PSM for Concrete Functions. INDOCRYPT (2) 2023: 45-61 - [c20]Tomoya Morooka, Yoshifumi Manabe, Kazumasa Shinagawa:
Malicious Player Card-Based Cryptographic Protocols with a Standard Deck of Cards Using Private Operations. ISPEC 2023: 332-346 - [i9]Kazuki Kanai, Kengo Miyamoto, Koji Nuida, Kazumasa Shinagawa:
Uniform Cyclic Group Factorizations of Finite Groups. CoRR abs/2302.02831 (2023) - [i8]Kazumasa Shinagawa, Koji Nuida:
Explicit Lower Bounds for Communication Complexity of PSM for Concrete Functions. IACR Cryptol. ePrint Arch. 2023: 1743 (2023) - 2022
- [j8]Kengo Miyamoto, Kazumasa Shinagawa:
Graph Automorphism Shuffles from Pile-Scramble Shuffles. New Gener. Comput. 40(1): 199-223 (2022) - [c19]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 - [c18]Rikuo Haga, Kodai Toyoda, Yuto Shinoda, Daiki Miyahara, Kazumasa Shinagawa, Yu-ichi Hayashi, Takaaki Mizuki:
Card-Based Secure Sorting Protocol. IWSEC 2022: 224-240 - [i7]Kazumasa Shinagawa, Kengo Miyamoto:
Automorphism Shuffles for Graphs and Hypergraphs and Its Applications. CoRR abs/2205.04774 (2022) - [i6]Takeshi Nakai, Kazumasa Shinagawa:
Constant-Round Linear-Broadcast Secure Computation with Penalties. CoRR abs/2206.06010 (2022) - [i5]Kazumasa Shinagawa, Reo Eriguchi, Shohei Satake, Koji Nuida:
Private Simultaneous Messages Based on Quadratic Residues. CoRR abs/2209.01859 (2022) - [i4]Kazumasa Shinagawa, Koji Nuida:
Single-shuffle Full-open Card-based Protocols Imply Private Simultaneous Messages Protocols. IACR Cryptol. ePrint Arch. 2022: 1306 (2022) - 2021
- [j7]Kazumasa Shinagawa, Koji Nuida:
A single shuffle is enough for secure card-based computation of any Boolean circuit. Discret. Appl. Math. 289: 248-261 (2021) - [j6]Kazumasa Shinagawa:
Card-based Cryptography with Dihedral Symmetry. New Gener. Comput. 39(1): 41-71 (2021) - [c17]Daiki Miyahara, Léo Robert, Pascal Lafourcade, So Takeshige, Takaaki Mizuki, Kazumasa Shinagawa, Atsuki Nagao, Hideaki Sone:
Card-Based ZKP Protocols for Takuzu and Juosan. FUN 2021: 20:1-20:21 - [c16]Takeshi Nakai, Kazumasa Shinagawa:
Secure Computation with Non-Equivalent Penalties in Constant Rounds. Tokenomics 2021: 5:1-5:16 - [i3]Kengo Miyamoto, Kazumasa Shinagawa:
Graph Automorphism Shuffles from Pile-Scramble Shuffles. CoRR abs/2109.00397 (2021) - 2020
- [j5]Ken Takashima, Yuta Abe, Tatsuya Sasaki, Daiki Miyahara, Kazumasa Shinagawa, Takaaki Mizuki, Hideaki Sone:
Card-based protocols for secure ranking computations. Theor. Comput. Sci. 845: 122-135 (2020) - [c15]Yuto Shinoda, Daiki Miyahara, Kazumasa Shinagawa, Takaaki Mizuki, Hideaki Sone:
Card-Based Covert Lottery. SECITC 2020: 257-270
2010 – 2019
- 2019
- [c14]Ken Takashima, Yuta Abe, Tatsuya Sasaki, Daiki Miyahara, Kazumasa Shinagawa, Takaaki Mizuki, Hideaki Sone:
Card-Based Secure Ranking Computations. COCOA 2019: 461-472 - [c13]Kazumasa Shinagawa, Takaaki Mizuki:
Secure Computation of Any Boolean Function Based on Any Deck of Cards. FAW 2019: 63-75 - [c12]Pascal Lafourcade, Takaaki Mizuki, Atsuki Nagao, Kazumasa Shinagawa:
Light Cryptography. World Conference on Information Security Education 2019: 89-101 - [c11]Kazumasa Shinagawa:
Card-Based Cryptography with Invisible Ink. TAMC 2019: 566-577 - [i2]Kazumasa Shinagawa, Koji Nuida:
A Single Shuffle Is Enough for Secure Card-Based Computation of Any Circuit. IACR Cryptol. ePrint Arch. 2019: 380 (2019) - 2018
- [j4]Yuji Hashimoto, Koji Nuida, Kazumasa Shinagawa, Masaki Inamura, Goichiro Hanaoka:
Toward Finite-Runtime Card-Based Protocol for Generating a Hidden Random Permutation without Fixed Points. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1503-1511 (2018) - [j3]Yuji Hashimoto, Kazumasa Shinagawa, Koji Nuida, Masaki Inamura, Goichiro Hanaoka:
Secure Grouping Protocol Using a Deck of Cards. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1512-1524 (2018) - [c10]Kazumasa Shinagawa, Takaaki Mizuki:
Card-based Protocols Using Triangle Cards. FUN 2018: 31:1-31:13 - [c9]Kazumasa Shinagawa, Takaaki Mizuki:
The Six-Card Trick: Secure Computation of Three-Input Equality. ICISC 2018: 123-131 - [c8]Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Atsuki Nagao, Tatsuya Sasaki, Kazumasa Shinagawa, Hideaki Sone:
Physical Zero-Knowledge Proof for Makaro. SSS 2018: 111-125 - 2017
- [j2]Kazumasa Shinagawa, Takaaki Mizuki, Jacob C. N. Schuldt, Koji Nuida, Naoki Kanayama, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto:
Card-Based Protocols Using Regular Polygon Cards. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9): 1900-1909 (2017) - [c7]Takuya Kitamura, Kazumasa Shinagawa, Takashi Nishide, Eiji Okamoto:
One-time Programs with Cloud Storage and Its Application to Electronic Money. APKC@AsiaCCS 2017: 25-30 - [c6]Jacob C. N. Schuldt, Kazumasa Shinagawa:
On the Robustness of RSA-OAEP Encryption and RSA-PSS Signatures Against (Malicious) Randomness Failures. AsiaCCS 2017: 241-252 - [c5]Yuji Hashimoto, Kazumasa Shinagawa, Koji Nuida, Masaki Inamura, Goichiro Hanaoka:
Secure Grouping Protocol Using a Deck of Cards. ICITS 2017: 135-152 - [i1]Yuji Hashimoto, Kazumasa Shinagawa, Koji Nuida, Masaki Inamura, Goichiro Hanaoka:
Secure Grouping Protocol Using a Deck of Cards. CoRR abs/1709.07785 (2017) - 2016
- [j1]Kazumasa Shinagawa, Takaaki Mizuki, Jacob C. N. Schuldt, Koji Nuida, Naoki Kanayama, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto:
Secure Computation Protocols Using Polarizing Cards. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1122-1131 (2016) - [c4]Kazumasa Shinagawa, Koji Nuida, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto:
Size-Hiding Computation for Multiple Parties. ASIACRYPT (2) 2016: 937-966 - [c3]Kazumasa Shinagawa, Koji Nuida, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto:
Committed AND protocol using three cards with more handy shuffle. ISITA 2016: 700-702 - 2015
- [c2]Kazumasa Shinagawa, Takaaki Mizuki, Jacob C. N. Schuldt, Koji Nuida, Naoki Kanayama, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto:
Secure Multi-Party Computation Using Polarizing Cards. IWSEC 2015: 281-297 - [c1]Kazumasa Shinagawa, Takaaki Mizuki, Jacob C. N. Schuldt, Koji Nuida, Naoki Kanayama, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto:
Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards. ProvSec 2015: 127-146
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-10-25 21:18 CEST 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:
