Generic plaintext equality and inequality proofs

DOI10.1007/978-3-662-64322-8_20zbMath1491.94040OpenAlexW3208833243MaRDI QIDQ2145406

Octavio Perez Kempner, Xavier Bultel, Pascal Lafourcade, Olivier Blazy

Publication date: 17 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-662-64322-8_20

zbMATH Keywords

zero-knowledge proofspublic-key encryptiongeneric plaintext equalitygeneric plaintext inequality

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient secure two-party protocols. Techniques and constructions
• Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
• Prêt à voter with Paillier encryption
• Non-Interactive Zero-Knowledge Proofs of Non-Membership
• Non-Interactive Plaintext (In-)Equality Proofs and Group Signatures with Verifiable Controllable Linkability
• Plaintext-Checkable Encryption
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Rerandomizable RCCA Encryption
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
• Super-Perfect Zero-Knowledge Proofs
• Probabilistic Public Key Encryption with Equality Test
• Two-Party Computing with Encrypted Data
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - CRYPTO 2003
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• Topics in Cryptology – CT-RSA 2004

This page was built for publication: Generic plaintext equality and inequality proofs