Pages that link to "Item:Q808241"
From MaRDI portal
The following pages link to Bit commitment using pseudorandomness (Q808241):
Displayed 15 items.
- Mafia: A theoretical study of players and coalitions in a partial information environment (Q930667) (← links)
- Robust random number generation for peer-to-peer systems (Q1004308) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- Logics for reasoning about cryptographic constructions (Q2490263) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks (Q3519535) (← links)
- Unclonable Group Identification (Q3593118) (← links)
- Hash Functions from Sigma Protocols and Improvements to VSH (Q3600369) (← links)
- A note on the feasibility of generalised universal composability (Q3616225) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- Multi-property Preserving Combiners for Hash Functions (Q5445516) (← links)
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way (Q5445518) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- An Efficient Protocol for Fair Secure Two-Party Computation (Q5458934) (← links)