Generic plaintext equality and inequality proofs

DOI10.1007/978-3-662-64322-8_20zbMATH Open1491.94040OpenAlexW3208833243MaRDI QIDQ2145406FDOQ2145406

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

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

zbMATH Keywords

public-key encryptionzero-knowledge proofsgeneric plaintext equalitygeneric plaintext inequality

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Title not available (Why is that?)
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient secure two-party protocols. Techniques and constructions
• Title not available (Why is that?)
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - CRYPTO 2003
• Efficent receipt-free voting based on homomorphic encryption
• Super-Perfect Zero-Knowledge Proofs
• Title not available (Why is that?)
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• Topics in Cryptology – CT-RSA 2004
• Non-Interactive Zero-Knowledge Proofs of Non-Membership
• Probabilistic public key encryption with equality test
• Plaintext-checkable encryption
• Title not available (Why is that?)
• How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios
• Rerandomizable RCCA Encryption
• Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
• Prêt à voter with Paillier encryption
• Non-Interactive Plaintext (In-)Equality Proofs and Group Signatures with Verifiable Controllable Linkability
• Two-Party Computing with Encrypted Data

Cited In (1)

• Set (non-)membership NIZKs from determinantal accumulators

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)