Generic plaintext equality and inequality proofs

DOI10.1007/978-3-662-64322-8_20MaRDI QIDQ2145406zbMATHOpenAlexFDO

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

Publication date 17 June 2022

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

zbMATH Keywords

public-key encryptionzero-knowledge proofsgeneric plaintext equalitygeneric plaintext inequality

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Public key encryption with equality test via hash proof system
• Public key encryption with equality test in the standard model
• On black-box extension of a non-interactive zero-knowledge proof system for secret equality
• Theory of Cryptography
• Probabilistic public key encryption with equality test

Cites work

• scientific article; zbMATH DE number 1583777 (Why is no real title available?)
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 176566 (Why is no real title available?)
• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 1842491 (Why is no real title available?)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - CRYPTO 2003
• Efficent receipt-free voting based on homomorphic encryption
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient secure two-party protocols. Techniques and constructions
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios
• Non-Interactive Zero-Knowledge Proofs of Non-Membership
• Non-interactive plaintext (in-)equality proofs and group signatures with verifiable controllable linkability
• Plaintext-checkable encryption
• Probabilistic public key encryption with equality test
• Prêt à voter with Paillier encryption
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Rerandomizable RCCA Encryption
• Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
• Super-Perfect Zero-Knowledge Proofs
• Topics in Cryptology – CT-RSA 2004
• Two-Party Computing with Encrypted Data

Cited in

(1)

• Set (non-)membership NIZKs from determinantal accumulators

Describes a project that uses

Uses Software

• GitHub

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

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