How to implement a non-uniform or non-closed shuffle

DOI10.1007/978-3-030-63000-3_9MaRDI QIDQ2038355zbMATH OpenOpenAlexFDO

Authors Takahiro Saito, Daiki Miyahara, Yuta Abe, Takaaki Mizuki, Hiroki Shuzuya

Publication date 6 July 2021

Full work available at URL https://doi.org/10.1007/978-3-030-63000-3_9

zbMATH Keywords

card-based protocolscryptographyimplementation of shuffleunconventional computation

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09) Communication complexity, information complexity (68Q11) Cryptography (94A60)

Recommendations

• Foundations for actively secure card-based cryptography
• Card-based protocols using unequal division shuffles
• A single shuffle is enough for secure card-based computation of any Boolean circuit
• Card-based cryptographic protocols using a minimal number of cards
• The minimum number of cards in practical card-based protocols

Cited in

(6)

• A card-minimal three-input and protocol using two shuffles
• New Techniques for Non-interactive Shuffle and Range Arguments
• scientific article; zbMATH DE number 1941259 (Why is no real title available?)
• Card-minimal protocols for three-input functions with standard playing cards
• Foundations for actively secure card-based cryptography
• Single-shuffle card-based protocols with six cards per gate

This page was built for publication: How to implement a non-uniform or non-closed shuffle

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