Pages that link to "Item:Q3575163"
From MaRDI portal
The following pages link to Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function (Q3575163):
Displaying 27 items.
- Quantum commitments from complexity assumptions (Q260394) (← links)
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- Concurrent non-malleable statistically hiding commitment (Q436560) (← links)
- Constant-round adaptive zero-knowledge proofs for NP (Q903613) (← links)
- Constant-round leakage-resilient zero-knowledge from collision resistance (Q2135523) (← links)
- PKP-based signature scheme (Q2179377) (← links)
- Statistical concurrent non-malleable zero-knowledge from one-way functions (Q2188970) (← links)
- A new interactive hashing theorem (Q2442643) (← links)
- Concurrent zero knowledge, revisited (Q2442650) (← links)
- Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem (Q2946396) (← links)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
- Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial (Q2980866) (← links)
- Quantum Commitments from Complexity Assumptions (Q3012793) (← links)
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious (Q3179362) (← links)
- Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions (Q3457061) (← links)
- (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond (Q3457067) (← links)
- Grid-Obstacle Representations with Connections to Staircase Guarding (Q4625102) (← links)
- The Many Entropies in One-Way Functions (Q5021132) (← links)
- Message-Restriction-Free Commitment Scheme Based on Lattice Assumption (Q5095924) (← links)
- (Q5121911) (← links)
- (Q5140842) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5915597) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
- Doubly adaptive zero-knowledge proofs (Q6132969) (← links)
