Pages that link to "Item:Q808241"
From MaRDI portal
The following pages link to Bit commitment using pseudorandomness (Q808241):
Displaying 50 items.
- Quantum commitments from complexity assumptions (Q260394) (← links)
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- An optimally fair coin toss (Q315542) (← links)
- A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
- A note on constant-round zero-knowledge proofs of knowledge (Q380963) (← links)
- On the impossibility of non-static quantum bit commitment between two parties (Q424242) (← links)
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- A characterization of chameleon hash functions and new, efficient designs (Q484332) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- Precise zero-knowledge arguments with poly-logarithmic efficiency (Q615245) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Constant-round adaptive zero-knowledge proofs for NP (Q903613) (← links)
- Mafia: A theoretical study of players and coalitions in a partial information environment (Q930667) (← links)
- A commitment folk theorem (Q972132) (← 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)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- Pattern matching on encrypted streams (Q1633445) (← links)
- Unbounded ABE via bilinear entropy expansion, revisited (Q1648812) (← links)
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- A light-weight bit commitment protocol based on unpredictable channel noise (Q1725688) (← links)
- Public-coin parallel zero-knowledge for NP (Q1946592) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? (Q2055669) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) (Q2120065) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- On the concurrent composition of quantum zero-knowledge (Q2120082) (← links)
- One-way functions imply secure computation in a quantum world (Q2120090) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- Constant-round leakage-resilient zero-knowledge from collision resistance (Q2135523) (← links)
- A note on perfect correctness by derandomization (Q2146431) (← links)
- Non-malleable commitments against quantum attacks (Q2170101) (← links)
- Statistical concurrent non-malleable zero-knowledge from one-way functions (Q2188970) (← links)
- Efficient hybrid encryption from ID-based encryption (Q2267789) (← links)
- Bounds on the efficiency of black-box commitment schemes (Q2268099) (← links)
- Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles (Q2272198) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- Mercurial commitments with applications to zero-knowledge sets (Q2377062) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- Secret-sharing for NP (Q2397445) (← links)
- Non-black-box simulation in the fully concurrent setting, revisited (Q2423842) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Concurrent zero knowledge, revisited (Q2442650) (← links)
