Non-interactive zero knowledge from sub-exponential DDH
type: Item
instance of: scholarly article
title: Non-interactive zero knowledge from sub-exponential DDH
zbMATH Open document ID: 1479.94194
DOI: 10.1007/978-3-030-77870-5_1
author: Abhishek Jain
author: Zhengzhong Jin
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7440573
zbMATH Keywords: decisional Diffie-Hellman
zbMATH Keywords: interactive trapdoor hashing protocols
MaRDI profile type: Publication
full work available at URL: 978-3-030-77870-5 1
OpenAlex ID: W3164947441
cites work: Statistical ZAP arguments
cites work: Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
cites work: Q4434902
cites work: Q4318714
cites work: Theory of Cryptography
cites work: On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
cites work: Q4783728
cites work: Functional Encryption: Definitions and Challenges
cites work: Breaking the Circuit Size Barrier for Secure Computation Under DDH
cites work: NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
cites work: Fiat-Shamir: from practice to theory
cites work: On the Correlation Intractability of Obfuscated Pseudorandom Functions
cites work: Fiat-Shamir and correlation intractability from strong KDM-secure encryption
cites work: The random oracle methodology, revisited
cites work: Q4434880
cites work: Certifying trapdoor permutations, revisited
cites work: Discrete logarithms in \(\mathrm{GF}(p)\)
cites work: Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
cites work: Q3789104
cites work: Identity-based encryption from the Diffie-Hellman assumption
cites work: Trapdoor hash functions and their applications
cites work: Zaps and Their Applications
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Enhancements of trapdoor permutations
cites work: The knowledge complexity of interactive proof-systems
cites work: Statistical Zaps and new oblivious transfer protocols
cites work: Non-interactive Zaps and New Techniques for NIZK
cites work: Perfect Non-interactive Zero Knowledge for NP
cites work: Statistical witness indistinguishability (and more) in two messages
cites work: From obfuscation to the security of Fiat-Shamir for proofs
cites work: Cryptography and Game Theory: Designing Protocols for Exchanging Information
cites work: Statistical ZAPR arguments from bilinear maps
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Efficient oblivious transfer protocols
cites work: Parity helps to compute majority
cites work: Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
cites work: Noninteractive zero knowledge for NP from (Plain) Learning With Errors
cites work: A Framework for Efficient and Composable Oblivious Transfer
cites work: On Threshold Circuits and Polynomial Computation
cites work: How to use indistinguishability obfuscation
cites work: Fuzzy Identity-Based Encryption
description: scientific article; zbMATH DE number 7440573