Bit commitment using pseudorandomness
From MaRDI portal
Publication:808241
DOI10.1007/BF00196774zbMath0731.68033MaRDI QIDQ808241
Publication date: 1991
Published in: Journal of Cryptology (Search for Journal in Brave)
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Random number generation in numerical analysis (65C10)
Related Items
Cryptography from pseudorandom quantum states, Quantum commitments and signatures without one-way functions, Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round, Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious, NIZK from SNARGs, Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract), Statistical security in two-party computation revisited, Doubly adaptive zero-knowledge proofs, General properties of quantum bit commitments (extended abstract), From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments, One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions, Succinct interactive oracle proofs: applications and limitations, Two-round adaptively secure MPC from isogenies, LPN, or CDH, Universal reductions: reductions relative to stateful oracles, Reusable secure computation in the plain model, Efficient non-malleable commitment schemes, On the complexity of compressing obfuscation, Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model, Efficient non-malleable commitment schemes, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, From fairness to full security in multiparty computation, Verifiable random functions from non-interactive witness-indistinguishable proofs, Non-malleable vector commitments via local equivocability, On the exact round complexity of secure three-party computation, Round-optimal secure multi-party computation, Constant-Round Nonmalleable Commitments from Any One-Way Function, On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \), A black-box approach to post-quantum zero-knowledge in constant rounds, On the concurrent composition of quantum zero-knowledge, One-way functions imply secure computation in a quantum world, Concurrent knowledge extraction in public-key models, A New Pseudorandom Generator from Collision-Resistant Hash Functions, Computational hardness of optimal fair computation: beyond Minicrypt, Cutting-edge cryptography through the lens of secret sharing, Round-optimal fully black-box zero-knowledge arguments from one-way permutations, Constant-round leakage-resilient zero-knowledge from collision resistance, Probabilistic proof systems — A survey, On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation, Pattern matching on encrypted streams, The Journey from NP to TFNP Hardness, Mercurial commitments with applications to zero-knowledge sets, An optimally fair coin toss, Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious, Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity, Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions, More efficient DDH pseudorandom generators, Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions, A note on perfect correctness by derandomization, Unbounded ABE via bilinear entropy expansion, revisited, A counterexample to the chain rule for conditional HILL entropy, Secret-sharing for NP, Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model, Non-malleable commitments against quantum attacks, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, A note on constant-round zero-knowledge proofs of knowledge, Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem, Precise zero-knowledge arguments with poly-logarithmic efficiency, Statistical concurrent non-malleable zero-knowledge from one-way functions, Non-black-box simulation in the fully concurrent setting, revisited, (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens, On the impossibility of non-static quantum bit commitment between two parties, Constant-round adaptive zero-knowledge proofs for NP, Public-coin parallel zero-knowledge for NP, An Almost-Optimally Fair Three-Party Coin-Flipping Protocol, Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks, Classical binding for quantum commitments, Simple and efficient batch verification techniques for verifiable delay functions, Non-malleable vector commitments via local equivocability, Non-interactive secure computation from one-way functions, Possibility and impossibility results for selective decommitments, Concurrent zero knowledge, revisited, Round-efficient black-box construction of composable multi-party computation, A light-weight bit commitment protocol based on unpredictable channel noise, Adaptive zero-knowledge proofs and adaptively secure oblivious transfer, Cryptography and cryptographic protocols, Mafia: A theoretical study of players and coalitions in a partial information environment, A characterization of chameleon hash functions and new, efficient designs, Concealment and Its Applications to Authenticated Encryption, A framework for non-interactive instance-dependent commitment schemes (NIC), Quantum Commitments from Complexity Assumptions, An Algebraic Approach to Nonmalleability, A commitment folk theorem, Logics for reasoning about cryptographic constructions, Lower bounds for non-black-box zero knowledge, Efficient hybrid encryption from ID-based encryption, Bounds on the efficiency of black-box commitment schemes, Unclonable Group Identification, Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles, Hash Functions from Sigma Protocols and Improvements to VSH, Multi-property Preserving Combiners for Hash Functions, Semi-honest to Malicious Oblivious Transfer—The Black-Box Way, An Equivalence Between Zero Knowledge and Commitments, Lower Bounds on Assumptions Behind Indistinguishability Obfuscation, Indistinguishability Obfuscation: From Approximate to Exact, Perfect Structure on the Edge of Chaos, Cutting-Edge Cryptography Through the Lens of Secret Sharing, Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security, A note on the feasibility of generalised universal composability, Robust random number generation for peer-to-peer systems, The Complexity of Zero Knowledge, An Efficient Protocol for Fair Secure Two-Party Computation, A note on universal composable zero-knowledge in the common reference string model, Cryptography in the multi-string model, Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening, On the Security Loss in Cryptographic Reductions, Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits, On the power of secure two-party computation, How to extract useful randomness from unreliable sources, Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?, Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions, Hybrid commitments and their applications to zero-knowledge proof systems, Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model, Security of blind signatures under aborts and applications to adaptive oblivious transfer, Reducing complexity assumptions for statistically-hiding commitment, On the Power of Secure Two-Party Computation, Rate-1, Linear Time and Additively Homomorphic UC Commitments, Linicrypt: A Model for Practical Cryptography, Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction, Constant-Round Interactive Proofs for Delegating Computation, Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments, Black-box use of one-way functions is useless for optimal fair coin-tossing, An efficient protocol for secure two-party computation in the presence of malicious adversaries, The Complexity of Public-Key Cryptography, A Note on Perfect Correctness by Derandomization, Weak Zero-Knowledge beyond the Black-Box Barrier, Quantum commitments from complexity assumptions
Cites Work
