Revisiting Lower and Upper Bounds for Selective Decommitments
From MaRDI portal
Publication:4910298
DOI10.1007/978-3-642-36594-2_31zbMath1315.94097OpenAlexW126141990MaRDI QIDQ4910298
Rafail Ostrovsky, Vanishree Rao, Alessandra Scafuro, Ivan Visconti
Publication date: 18 March 2013
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_31
Related Items (6)
Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Round-Optimal Black-Box Two-Party Computation ⋮ Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts ⋮ Succinct arguments for RAM programs via projection codes ⋮ Individual simulations ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds
This page was built for publication: Revisiting Lower and Upper Bounds for Selective Decommitments
