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)- 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
- A note on perfect correctness by derandomization
- Multi-property Preserving Combiners for Hash Functions
- Two-round adaptively secure MPC from isogenies, LPN, or CDH
- On the complexity of compressing obfuscation
- Secret-sharing for NP
- The journey from NP to TFNP hardness
- Reusable secure computation in the plain model
- Precise zero-knowledge arguments with poly-logarithmic efficiency
- Cryptography in the multi-string model
- Bounds on the efficiency of black-box commitment schemes
- An Efficient Protocol for Fair Secure Two-Party Computation
- Reducing complexity assumptions for statistically-hiding commitment
- Constant round adaptively secure protocols in the tamper-proof hardware model
- A counterexample to the chain rule for conditional HILL entropy
- Adaptive hardness and composable security in the plain model from standard assumptions
- On the Power of Secure Two-Party Computation
- Unclonable Group Identification
- Non-malleable commitments against quantum attacks
- Non-black-box simulation from one-way functions and applications to resettable security
- How to extract useful randomness from unreliable sources
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Concurrent zero knowledge, revisited
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Lower bounds for non-black-box zero knowledge
- Simple and efficient batch verification techniques for verifiable delay functions
- A characterization of chameleon hash functions and new, efficient designs
- Probabilistic proof systems -- a survey
- A note on perfect correctness by derandomization
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Constant-round interactive proofs for delegating computation
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme
- Public-coin parallel zero-knowledge for NP
- Weak Zero-Knowledge beyond the Black-Box Barrier
- On non-black-box simulation and the impossibility of approximate obfuscation
- On central primitives for quantum cryptography with classical communication
- Resettable statistical zero-knowledge for NP
- Unconditionally secure quantum commitments with preprocessing
- Unconditionally secure commitments with quantum auxiliary inputs
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)
