A Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing

DOI10.1007/978-3-030-59013-0_17MaRDI QIDQ6485987zbMATH OpenFDO

Authors Xavier Boyen, Thomas J. Haines, Johannes C. Müller

Publication date 22 December 2022

Published in 1511.94061 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-59013-0_17

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Mix-nets from re-randomizable and replayable CCA-secure public-key encryption
• Securing Abe's mix-net against malicious verifiers via witness indistinguishability
• Auditable Privacy: On Tamper-Evident Mix Networks
• An Efficient Publicly Verifiable Mix-Net for Long Inputs
• Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
• A mix-net from any CCA2 secure cryptosystem
• scientific article; zbMATH DE number 1303140

Cited in

(4)

• Post-quantum online voting scheme
• Lattice-based zero-knowledge proofs in action: applications to electronic voting
• Efficient verifiable mixnets from lattices, revisited
• More efficient lattice-based electronic voting from NTRU

This page was built for publication: A Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing

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