Pages that link to "Item:Q1126890"
From MaRDI portal
The following pages link to Perfect zero-knowledge arguments for NP using any one-way permutation (Q1126890):
Displaying 29 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- On the impossibility of non-static quantum bit commitment between two parties (Q424242) (← links)
- Long-term security and universal composability (Q604632) (← links)
- Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) (← links)
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP (Q893613) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- On the ring-LWE and polynomial-LWE problems (Q1648786) (← links)
- Optimal forgeries against polynomial-based MACs and GCM (Q1648808) (← links)
- Quantum bit-commitment for small storage based on quantum one-way permutations (Q1880339) (← links)
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation (Q1924194) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- A new interactive hashing theorem (Q2442643) (← links)
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge (Q2516524) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction (Q3104689) (← links)
- Optimal Reductions Between Oblivious Transfers Using Interactive Hashing (Q3593097) (← links)
- Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption (Q4975186) (← links)
- Super-Perfect Zero-Knowledge Proofs (Q5098773) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way (Q5445518) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- Interactive Hashing: An Information Theoretic Tool (Invited Talk) (Q5502788) (← links)
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) (Q6111540) (← links)
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) (Q6114266) (← links)
- Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP (Q6157505) (← links)
- More efficient verifiable functional encryption (Q6173113) (← links)
