Bit commitment using pseudorandomness
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4187086
- scientific article; zbMATH DE number 861531
- Bit-Wise Behavior of Random Number Generators
- Pseudorandom bits for constant depth circuits
- On pseudorandom encodings
- Discrete asymptotic deterministic randomness for the generation of pseudorandom bits
- scientific article; zbMATH DE number 503348
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 4101088 (Why is no real title available?)
- Class of constructive asymptotically good algebraic codes
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Minimum disclosure proofs of knowledge
Cited in
(only showing first 100 items - show all)- A duality between one-way functions and average-case symmetry of information
- Capturing one-way functions via NP-hardness of meta-complexity
- Constant-round arguments from one-way functions
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- A framework for non-interactive instance-dependent commitment schemes (NIC)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- Mafia: A theoretical study of players and coalitions in a partial information environment
- On the power of secure two-party computation
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- More efficient DDH pseudorandom generators
- A new pseudorandom generator from collision-resistant hash functions
- The Complexity of Public-Key Cryptography
- Mercurial commitments with applications to zero-knowledge sets
- Quantum commitments and signatures without one-way functions
- Concealment and its applications to authenticated encryption
- Classical binding for quantum commitments
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- NIZK from SNARGs
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
- Pattern matching on encrypted streams
- Zero-knowledge proof systems for QMA
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
- Indistinguishability obfuscation: from approximate to exact
- Non-malleable vector commitments via local equivocability
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Constant-round adaptive zero-knowledge proofs for NP
- Watermarking PRFs and PKE against quantum adversaries
- Non-malleable vector commitments via local equivocability
- Non-black-box simulation in the fully concurrent setting, revisited
- Non-interactive secure computation from one-way functions
- Statistical security in two-party computation revisited
- General properties of quantum bit commitments (extended abstract)
- Succinct interactive oracle proofs: applications and limitations
- Doubly adaptive zero-knowledge proofs
- A note on the feasibility of generalised universal composability
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- Round-efficient black-box construction of composable multi-party computation
- Efficient non-malleable commitment schemes
- Efficient hybrid encryption from ID-based encryption
- A light-weight bit commitment protocol based on unpredictable channel noise
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Quantum commitments from complexity assumptions
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
- One-way functions imply secure computation in a quantum world
- On the Security Loss in Cryptographic Reductions
- From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- Security of blind signatures under aborts and applications to adaptive oblivious transfer
- Concurrent knowledge extraction in public-key models
- Computational hardness of optimal fair computation: beyond Minicrypt
- One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions
- Oblivious transfer from weakly random self-reducible public-key cryptosystem
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- A note on constant-round zero-knowledge proofs of knowledge
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- A black-box approach to post-quantum zero-knowledge in constant rounds
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \)
- On the concurrent composition of quantum zero-knowledge
- Quantum commitments from complexity assumptions
- An Equivalence Between Zero Knowledge and Commitments
- A commitment folk theorem
- On the impossibility of non-static quantum bit commitment between two parties
- On the exact round complexity of secure three-party computation
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Counting unpredictable bits: a simple PRG from one-way functions
- On one-way functions and sparse languages
- An Algebraic Approach to Nonmalleability
- Rate-1, linear time and additively homomorphic UC commitments
- Cutting-edge cryptography through the lens of secret sharing
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Cutting-edge cryptography through the lens of secret sharing
- Round-optimal secure multi-party computation
- Efficient non-malleable commitment schemes
- Robust random number generation for peer-to-peer systems
- Linicrypt: a model for practical cryptography
- Lower bounds on assumptions behind indistinguishability obfuscation
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- Constant-round leakage-resilient zero-knowledge from collision resistance
- Non-interactive commitment from non-transitive group actions
- Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- Hash Functions from Sigma Protocols and Improvements to VSH
- The Complexity of Zero Knowledge
- Logics for reasoning about cryptographic constructions
- Bit commitment in the bounded storage model: tight bound and simple optimal construction
- Universal reductions: reductions relative to stateful oracles
- A note on universal composable zero-knowledge in the common reference string model
- Cryptography and cryptographic protocols
- Possibility and impossibility results for selective decommitments
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- An optimally fair coin toss
- Cryptography from pseudorandom quantum states
- Hybrid commitments and their applications to zero-knowledge proof systems
- Unbounded ABE via bilinear entropy expansion, revisited
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
This page was built for publication: Bit commitment using pseudorandomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808241)
