Black-Box Constructions of Two-Party Protocols from One-Way Functions
From MaRDI portal
Publication:3611779
DOI10.1007/978-3-642-00457-5_24zbMath1213.94126OpenAlexW1497093656MaRDI QIDQ3611779
Publication date: 3 March 2009
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_24
non-malleable commitmentssecure two-party computationtrapdoor commitmentsblack-box constructionszero-knowledge argumentsparallel coin-tossing
Related Items (31)
A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ Round-optimal fully black-box zero-knowledge arguments from one-way permutations ⋮ Round optimal black-box ``commit-and-prove ⋮ Constant-round leakage-resilient zero-knowledge from collision resistance ⋮ Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Secure Multiparty RAM Computation in Constant Rounds ⋮ Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions ⋮ Round-Optimal Black-Box Two-Party Computation ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Black-box anonymous commit-and-prove ⋮ Succinct arguments for RAM programs via projection codes ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ On constant-round concurrent non-malleable proof systems ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ Best of both worlds. Revisiting the spymasters double agent problem ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ Computing boundary cycle of a pseudo-triangle polygon from its visibility graph ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ What security can we achieve within 4 rounds? ⋮ On the power of secure two-party computation ⋮ Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? ⋮ On the Existence of Extractable One-Way Functions ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Private Coins versus Public Coins in Zero-Knowledge Proof Systems ⋮ Round-optimal black-box commit-and-prove with succinct communication
This page was built for publication: Black-Box Constructions of Two-Party Protocols from One-Way Functions
