Black-Box Constructions of Composable Protocols without Set-Up
From MaRDI portal
Publication:2914276
DOI10.1007/978-3-642-32009-5_27zbMath1296.94129OpenAlexW2184813257MaRDI QIDQ2914276
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_27
Related Items (19)
Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions ⋮ Round-Optimal Black-Box Two-Party Computation ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ Non-malleable commitments against quantum attacks ⋮ 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 ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ 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 ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Round-optimal black-box commit-and-prove with succinct communication
This page was built for publication: Black-Box Constructions of Composable Protocols without Set-Up
