Post-quantum privacy for traceable receipt-free encryption

DOI10.1007/978-3-032-26740-5_3MaRDI QIDQ7390929zbMATH OpenFDO

Authors Paola de Perthuis, Tom Peters

Publication date 2026

Full work available at URL https://doi.org/10.1007/978-3-032-26740-5_3

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Covercrypt: an efficient early-abort KEM for hidden access policies with traceability from the DDH and LWE
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Encryption mechanisms for receipt-free and perfectly private verifiable elections
• How to use indistinguishability obfuscation
• Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
• Leveled fully homomorphic signatures from standard lattices
• Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
• Malleable proof systems and applications
• Non-malleability from malleability: simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures
• On the concrete hardness of learning with errors
• Practical traceable receipt-free encryption
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Stretching Groth-Sahai: NIZK proofs of partial satisfiability
• Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
• Structure-preserving signatures and commitments to group elements
• Theory of Cryptography
• Traceable receipt-free encryption

This page was built for publication: Post-quantum privacy for traceable receipt-free encryption

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