Pages that link to "Item:Q1110348"
From MaRDI portal
The following pages link to Minimum disclosure proofs of knowledge (Q1110348):
Displaying 50 items.
- Mercurial commitments with applications to zero-knowledge sets (Q2377062) (← links)
- Non-black-box simulation in the fully concurrent setting, revisited (Q2423842) (← links)
- A new interactive hashing theorem (Q2442643) (← links)
- Cheat sensitive quantum bit commitment via pre- and post-selected quantum states (Q2443962) (← links)
- Signcryption with non-interactive non-repudiation (Q2572979) (← links)
- Efficient chameleon hash functions in the enhanced collision resistant model (Q2658065) (← links)
- Full revelation of expertise before disclosure (Q2681792) (← links)
- Individual simulations (Q2691606) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness (Q2695641) (← links)
- Secret handshakes: full dynamicity, deniability and lattice-based design (Q2699945) (← links)
- Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits (Q2817870) (← links)
- Adaptive hardness and composable security in the plain model from standard assumptions (Q2821797) (← links)
- On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs (Q2827722) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
- Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) (Q2953816) (← links)
- Fully Simulatable Quantum-Secure Coin-Flipping and Applications (Q3011901) (← links)
- One-Time Signatures and Chameleon Hash Functions (Q3084263) (← links)
- Precise Time and Space Simulatable Zero-Knowledge (Q3092346) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement (Q3179358) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- An Efficient Parallel Repetition Theorem (Q3408184) (← links)
- Robust and Efficient Sharing of RSA Functions (Q3452349) (← links)
- Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge (Q3454578) (← links)
- Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting (Q3457062) (← links)
- Succinct NP Proofs from an Extractability Assumption (Q3507432) (← links)
- Perfect Non-interactive Zero Knowledge for NP (Q3593105) (← links)
- Polylogarithmic two-round argument systems (Q3612244) (← links)
- Minimum-Knowledge Interactive Proofs for Decision Problems (Q3835409) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- How to Verify a Quantum Computation (Q4568113) (← links)
- Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes (Q5041167) (← links)
- Probabilistic proof systems — A survey (Q5048957) (← links)
- Secure commitment against a powerful adversary (Q5096801) (← links)
- Super-Perfect Zero-Knowledge Proofs (Q5098773) (← links)
- (Q5146117) (← links)
- S-money: virtual tokens for a relativistic economy (Q5160674) (← links)
- Verifying quantum computations at scale: A cryptographic leash on quantum devices (Q5204995) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Hashing Garbled Circuits for Free (Q5270371) (← links)
- Oblivious transfer based on single-qubit rotations (Q5272497) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- Constant-Round Nonmalleable Commitments from Any One-Way Function (Q5501951) (← links)
- Chameleon-Hashes with Ephemeral Trapdoors (Q5738755) (← links)
- How to Challenge and Cast Your e-Vote (Q5857773) (← links)
- Efficient non-malleable commitment schemes (Q5902225) (← links)
