Applied Cryptography and Network Security

DOI10.1007/B98360zbMATH Open1103.68533OpenAlexW4301861138MaRDI QIDQ4680971FDOQ4680971

Authors:

Publication date: 13 June 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98360

Recommendations

• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• A verifiable secret shuffle of homomorphic encryptions
• Public Key Cryptography – PKC 2004
• A Non-interactive Shuffle with Pairing Based Verifiability

zbMATH Keywords

formal security modelPrivacymix-netsverifiable shufflesPaillier public-key system

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cited In (10)

• VERIFICATION OF A PAILLIER BASED SHUFFLE USING REPRESENTATIONS OF THE SYMMETRIC GROUP
• Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
• How to Shuffle in Public
• Formal and precise analysis of soundness of several shuffling schemes
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• Public Key Cryptography – PKC 2004
• Efficient succinct zero-knowledge arguments in the CL framework
• Efficiently shuffling in public
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Verifiable Rotation of Homomorphic Encryptions

This page was built for publication: Applied Cryptography and Network Security

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