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

DOI10.1007/978-981-97-1238-0_9MaRDI QIDQ6547900

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

Publication date: 31 May 2024

zbMATH Keywords

secure computationcard-based cryptographygarbled circuit

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Secure multiparty computations without computers
• The minimum number of cards in practical card-based protocols
• Card-based protocols using unequal division shuffles
• How to implement a non-uniform or non-closed shuffle
• 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
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Six-Card Secure AND and Four-Card Secure XOR
• Computations with a deck of cards
• Single-shuffle card-based protocol with eight cards per gate
• Foundations for actively secure card-based cryptography

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)