Pages that link to "Item:Q1364901"
From MaRDI portal
The following pages link to On the existence of statistically hiding bit commitment schemes and fail-stop signatures (Q1364901):
Displaying 11 items.
- 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)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Collapse-Binding Quantum Commitments Without Random Oracles (Q2953776) (← links)
- Security of blind signatures under aborts and applications to adaptive oblivious transfer (Q3096954) (← links)
- Parallel Hashing via List Recoverability (Q3457065) (← links)
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (Q3600386) (← links)
- (Q4638056) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
