Pages that link to "Item:Q4279587"
From MaRDI portal
The following pages link to Publicly Verifiable Non-Interactive Zero-Knowledge Proofs (Q4279587):
Displaying 34 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Non-interactive zero-knowledge proofs for composite statements (Q776004) (← links)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- Fiat-Shamir for highly sound protocols is instantiable (Q1637340) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Delayed-input cryptographic protocols (Q2011641) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Publicly verifiable zero knowledge from (collapsing) blockchains (Q2061968) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation (Q2691603) (← links)
- Non-Interactive Zero-Knowledge Proofs of Non-Membership (Q2790035) (← links)
- Improved OR-Composition of Sigma-Protocols (Q2799092) (← links)
- Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits (Q2817870) (← links)
- Fiat–Shamir for Highly Sound Protocols Is Instantiable (Q2827720) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption (Q2829226) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) (← links)
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge (Q3454578) (← links)
- Noninteractive Zero-Knowledge (Q3985810) (← links)
- (Q4035737) (← links)
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
- On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages (Q6125215) (← links)
- Doubly adaptive zero-knowledge proofs (Q6132969) (← links)
- Steganography-free zero-knowledge (Q6169351) (← links)
- Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions (Q6535136) (← links)
