On black-box extension of a non-interactive zero-knowledge proof system for secret equality
From MaRDI portal
Publication:2152072
DOI10.1007/978-3-030-65277-7_39zbMath1492.94172OpenAlexW3112488736MaRDI QIDQ2152072
Masayuki Abe, Mehdi Tibouchi, Kyosuke Yamashita
Publication date: 6 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-65277-7_39
Network design and communication in computer systems (68M10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Cites Work
- Unnamed Item
- Unnamed Item
- Non-interactive zero-knowledge proofs for composite statements
- Round optimal black-box ``commit-and-prove
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Non-Interactive Plaintext (In-)Equality Proofs and Group Signatures with Verifiable Controllable Linkability
- Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs
- Tightly Secure Signatures and Public-Key Encryption
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- Round-Optimal Black-Box Two-Party Computation
- Universally composable two-party and multi-party secure computation
- Perfect Non-interactive Zero Knowledge for NP
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Nonmalleable Cryptography
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness
- Two-Party Computing with Encrypted Data
- Efficient Round Optimal Blind Signatures
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Theory of Cryptography
This page was built for publication: On black-box extension of a non-interactive zero-knowledge proof system for secret equality