Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security

DOI10.1007/s10207-006-0004-8zbMath1209.94046OpenAlexW2063635907MaRDI QIDQ5492131

No author found.

Publication date: 13 October 2006

Published in: International Journal of Information Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10207-006-0004-8

zbMATH Keywords

privacyformal security modelmix-netsverifiable shufflesPaillier public-key system

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

A verifiable secret shuffle of homomorphic encryptions ⋮ Two Generic Constructions of Probabilistic Cryptosystems and Their Applications

Cites Work

• PRIMES is in P
• An optimally robust hybrid mix network
• Flash mixing
• An Implementation of a Universally Verifiable Electronic Voting Scheme Based on Shuffling
• How to share a secret
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Foundations of Cryptography
• Optimistic Mixing for Exit-Polls
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• Applied Cryptography and Network Security
• Foundations of Cryptography
• Combining Encryption and Proof of Knowledge in the Random Oracle Model
• Cryptanalysis of the Hash Functions MD4 and RIPEMD
• How to Break MD5 and Other Hash Functions
• Efficient Collision Search Attacks on SHA-0
• Finding Collisions in the Full SHA-1
• Public Key Cryptography – PKC 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security