Searching for "Non-Interactive Zero-Knowledge Proof Systems." – sorted by Relevance.
-
Increasing the Power of the Dealer in Non-interactive ZeroKnowledge Proof Systems
- Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems Danny Gutfreund
- Cited by 3 (0 self) – Add To MetaCart
-
An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions
- An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions Joe
- Cited by 21 (1 self) – Add To MetaCart
-
An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products
- An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime
- Cited by 22 (5 self) – Add To MetaCart
-
Efficient Non-Interactive Zero-Knowledge Proofs of Circuit Satisfiability
- "proofs" than those previously known. 1 Introduction A non-interactive zero-knowledge proof system is a
- Cited by 2 (1 self) – Add To MetaCart
-
Simulatable VRFs with applications to multitheorem NIZK
- zero-knowledge proof system for a language L to a multi-theorem non-interactive proof system
- Cited by 2 (0 self) – Add To MetaCart
-
Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks
- -key cryptosystem secure against passive eavesdropping and a non-interactive zero-knowledge proof system
- Cited by 169 (9 self) – Add To MetaCart
-
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
- universal hash proof system. Essentially, this is a special kind of non-interactive zero-knowledge proof
- Cited by 75 (5 self) – Add To MetaCart
-
Non-Interactive Quantum Statistical and Perfect Zero-Knowledge Abstract
- . Classical version of non-interactive zero-knowledge proof systems was introduced by Blum, Feldman
- Add To MetaCart
-
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
- ; S 2 )) is an efficient adaptive single-theorem non-interactive zero-knowledge proof system
- Cited by 95 (10 self) – Add To MetaCart
-
Lower Bounds For Non-interactive Zero-knowledge
- , then non-interactive zero-knowledge proof systems with a random string of length ℓ(n) only exist
- Add To MetaCart

