How to Shuffle in Public

DOI10.1007/978-3-540-70936-7_30MaRDI QIDQ3596398zbMATH OpenOpenAlexFDO

Authors Ben Adida, Douglas Wikström

Publication date 30 August 2007

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70936-7_30

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficiently shuffling in public
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• Applied Cryptography and Network Security
• A Non-interactive Shuffle with Pairing Based Verifiability
• A verifiable secret shuffle of homomorphic encryptions

Cited in

(17)

• New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
• Non-interactive anonymous router
• Obfuscation for cryptographic purposes
• Efficiently shuffling in public
• Simulatable adaptive oblivious transfer with statistical receiver's privacy
• Anonymous card shuffling and its applications to parallel mixnets
• Obfuscation of hyperplane membership
• Secure Multi-party Shuffling
• A Commitment-Consistent Proof of a Shuffle
• Cooperative private searching in clouds
• Obfuscating conjunctions
• The Melbourne shuffle: improving oblivious storage in the cloud
• A Sender Verifiable Mix-Net and a New Proof of a Shuffle
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• Efficient VSS free of computational assumption
• Distributed shuffling in adversarial environments
• On strong simulation and composable point obfuscation

This page was built for publication: How to Shuffle in Public

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