Bit commitment using pseudorandomness

DOI10.1007/BF00196774zbMATH Open0731.68033MaRDI QIDQ808241FDOQ808241

Publication date: 1991

Published in: Journal of Cryptology (Search for Journal in Brave)

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

pseudorandomness cryptographic protocols zero-knowledge proof systems

Random number generation in numerical analysis (65C10) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites Work

How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Minimum disclosure proofs of knowledge
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Title not available (Why is that?)
Title not available (Why is that?)
Class of constructive asymptotically good algebraic codes

Cited In (only showing first 100 items - show all)

Efficient hybrid encryption from ID-based encryption
Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
Constant-Round Nonmalleable Commitments from Any One-Way Function
Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
Title not available (Why is that?)
Quantum commitments from complexity assumptions
Security of blind signatures under aborts and applications to adaptive oblivious transfer
Computational hardness of optimal fair computation: beyond Minicrypt
Concurrent knowledge extraction in public-key models
Candidate indistinguishability obfuscation and functional encryption for all circuits
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
A note on constant-round zero-knowledge proofs of knowledge
An Equivalence Between Zero Knowledge and Commitments
A commitment folk theorem
On the impossibility of non-static quantum bit commitment between two parties
Round-optimal secure multi-party computation
Efficient non-malleable commitment schemes
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
Linicrypt: a model for practical cryptography
Robust random number generation for peer-to-peer systems
Lower bounds on assumptions behind indistinguishability obfuscation
Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
Hash Functions from Sigma Protocols and Improvements to VSH
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
Logics for reasoning about cryptographic constructions
Cryptography and cryptographic protocols
A note on universal composable zero-knowledge in the common reference string model
Cryptography from pseudorandom quantum states
Possibility and impossibility results for selective decommitments
Multi-property Preserving Combiners for Hash Functions
Unbounded ABE via bilinear entropy expansion, revisited
Hybrid commitments and their applications to zero-knowledge proof systems
An optimally fair coin toss
On the complexity of compressing obfuscation
Secret-sharing for NP
An Efficient Protocol for Fair Secure Two-Party Computation
Precise zero-knowledge arguments with poly-logarithmic efficiency
Cryptography in the multi-string model
Adaptive hardness and composable security in the plain model from standard assumptions
Reducing complexity assumptions for statistically-hiding commitment
On the Power of Secure Two-Party Computation
A counterexample to the chain rule for conditional HILL entropy
Unclonable Group Identification
Non-black-box simulation from one-way functions and applications to resettable security
Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
Concurrent zero knowledge, revisited
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
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
On non-black-box simulation and the impossibility of approximate obfuscation
Statistical concurrent non-malleable zero-knowledge from one-way functions
Statistical concurrent non-malleable zero-knowledge from one-way functions
On the power of secure two-party computation
A framework for non-interactive instance-dependent commitment schemes (NIC)
The Complexity of Public-Key Cryptography
Mafia: A theoretical study of players and coalitions in a partial information environment
More efficient DDH pseudorandom generators
Mercurial commitments with applications to zero-knowledge sets
Concealment and its applications to authenticated encryption
Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
Pattern matching on encrypted streams
Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
Indistinguishability obfuscation: from approximate to exact
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
Non-interactive secure computation from one-way functions
Doubly adaptive zero-knowledge proofs
Efficient non-malleable commitment schemes
Round-efficient black-box construction of composable multi-party computation
A light-weight bit commitment protocol based on unpredictable channel noise
From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments
On the Security Loss in Cryptographic Reductions
One-way functions imply secure computation in a quantum world
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
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
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
On the exact round complexity of secure three-party computation
An Algebraic Approach to Nonmalleability
Rate-1, linear time and additively homomorphic UC commitments
Non-interactive commitment from non-transitive group actions
The Complexity of Zero Knowledge
Constant-round leakage-resilient zero-knowledge from collision resistance
Universal reductions: reductions relative to stateful oracles
Bit commitment in the bounded storage model: tight bound and simple optimal construction
Verifiable random functions from non-interactive witness-indistinguishable proofs
Two-round adaptively secure MPC from isogenies, LPN, or CDH
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
A note on perfect correctness by derandomization
Reusable secure computation in the plain model

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)