Formal and Precise Analysis of Soundness of Several Shuffling Schemes

DOI10.1007/978-3-642-16280-0_9zbMath1286.94082OpenAlexW1511249877MaRDI QIDQ4933216

Kun Peng, Feng Bao

Publication date: 12 October 2010

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16280-0_9

zbMATH Keywords

soundnessformal proofshufflingprecise guarantee

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• Simple and Efficient Shuffling with Provable Correctness and ZK Privacy
• A Sender Verifiable Mix-Net and a New Proof of a Shuffle
• Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
• Verifiable Shuffle of Large Size Ciphertexts
• Public Key Cryptography – PKC 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Formal and Precise Analysis of Soundness of Several Shuffling Schemes