An Efficient Aggregate Shuffle Argument Scheme

DOI10.1007/978-3-540-77366-5_25MaRDI QIDQ5448632zbMATH OpenOpenAlexFDO

Authors Jun Furukawa, Hideki Imai

Publication date 7 March 2008

Published in Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77366-5_25

zbMATH Keywords

AggregateEfficientMix-netShuffleVoting

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1842502
• Simple and Efficient Shuffling with Provable Correctness and ZK Privacy
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Verifiable Shuffle of Large Size Ciphertexts
• A verifiable secret shuffle of homomorphic encryptions

Cited in

(6)

• A shuffle-based alternative to the ADM interconnection architecture
• An efficient pairing-based shuffle argument
• New Techniques for Non-interactive Shuffle and Range Arguments
• Verifiable elections that scale for free
• Formal and precise analysis of soundness of several shuffling schemes
• More efficient shuffle argument from unique factorization

This page was built for publication: An Efficient Aggregate Shuffle Argument Scheme

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