Single-shuffle card-based protocols with six cards per gate

DOI10.1007/978-981-97-1238-0_9MaRDI QIDQ6547900zbMATH OpenFDO

Authors Tomoki Ono, Kazumasa Shinagawa, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto

Publication date 31 May 2024

Full work available at URL https://doi.org/10.1007/978-981-97-1238-0_9

zbMATH Keywords

card-based cryptographygarbled circuitsecure computation

Mathematics Subject Classification ID

Computer security (68M25) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• A single shuffle is enough for secure card-based computation of any Boolean circuit
• AND protocols using only uniform shuffles
• Card-based cryptographic protocols using a minimal number of cards
• Card-based protocols for any Boolean function
• Card-based protocols using unequal division shuffles
• Computations with a deck of cards
• Foundations for actively secure card-based cryptography
• How to implement a non-uniform or non-closed shuffle
• scientific article; zbMATH DE number 1024066 (Why is no real title available?)
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Secure multiparty computations without computers
• Securely computing XOR with 10 cards
• Single-shuffle card-based protocol with eight cards per gate
• Six-Card Secure AND and Four-Card Secure XOR
• The minimum number of cards in practical card-based protocols

Cited in

(3)

• Efficient AND protocols resistant to maliciously revealing a single card
• Visualizing differentially private mechanisms with physical cards
• Card-based protocols with single-card encoding

This page was built for publication: Single-shuffle card-based protocols with six cards per gate

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547900)