Pages that link to "Item:Q1924196"
From MaRDI portal
The following pages link to How to construct constant-round zero-knowledge proof systems for NP (Q1924196):
Displaying 50 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Round-optimal zero-knowledge proofs of knowledge for NP (Q362163) (← links)
- A note on constant-round zero-knowledge proofs of knowledge (Q380963) (← links)
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop'' condition (Q820565) (← links)
- A note on the Dwork-Naor timed deniable authentication (Q845814) (← links)
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP (Q893613) (← links)
- Constant-round adaptive zero-knowledge proofs for NP (Q903613) (← links)
- Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- New approaches for deniable authentication (Q1037236) (← links)
- New efficient and secure protocols for verifiable signature sharing and other applications (Q1582011) (← links)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Public-coin parallel zero-knowledge for NP (Q1946592) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- On publicly-accountable zero-knowledge and small shuffle arguments (Q2061977) (← links)
- Black-box transformations from passive to covert security with public verifiability (Q2096543) (← links)
- Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori (Q2117799) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- On the concurrent composition of quantum zero-knowledge (Q2120082) (← links)
- Constant-round leakage-resilient zero-knowledge from collision resistance (Q2135523) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- Statistical concurrent non-malleable zero-knowledge from one-way functions (Q2188970) (← links)
- Cryptographic reverse firewalls for interactive proof systems (Q2220883) (← links)
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits (Q2267359) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- Polynomial runtime and composability (Q2392095) (← links)
- On the power of rewinding simulators in functional encryption (Q2407055) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
- Concurrent zero knowledge, revisited (Q2442650) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- The round complexity of quantum zero-knowledge (Q2695629) (← links)
- On expected polynomial runtime in cryptography (Q2695649) (← links)
- Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security (Q2802147) (← links)
- Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits (Q2817870) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
- Signatures and Efficient Proofs on Committed Graphs and NP-Statements (Q2948189) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model (Q3392944) (← links)
- Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model (Q3408213) (← links)
