How to Shuffle in Public
From MaRDI portal
Publication:3596398
DOI10.1007/978-3-540-70936-7_30zbMath1156.94329OpenAlexW1504707014MaRDI QIDQ3596398
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
Related Items (11)
Secure Multi-party Shuffling ⋮ Cooperative private searching in clouds ⋮ Efficient VSS free of computational assumption ⋮ Obfuscating conjunctions ⋮ Obfuscation for cryptographic purposes ⋮ On strong simulation and composable point obfuscation ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ A Commitment-Consistent Proof of a Shuffle ⋮ Non-interactive anonymous router ⋮ Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy ⋮ Obfuscation of Hyperplane Membership
This page was built for publication: How to Shuffle in Public
