Publication:4434869
From MaRDI portal
zbMath1038.94523MaRDI QIDQ4434869
Yehuda Lindell, Ran Canetti, Eyal Kushilevitz
Publication date: 26 November 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2656/26560068.htm
94A60: Cryptography
Related Items
Isolated Proofs of Knowledge and Isolated Zero Knowledge, Concurrently Composable Security with Shielded Super-Polynomial Simulators, On the Exact Round Complexity of Self-composable Two-Party Computation, Long-term security and universal composability, Secure computation without authentication, A note on universal composable zero-knowledge in the common reference string model, On the relationships between notions of simulation-based security, Lower bounds and impossibility results for concurrent self composition, The reactive simulatability (RSIM) framework for asynchronous systems, Lower bounds for non-black-box zero knowledge, Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions, Local Sequentiality Does Not Help for Concurrent Composition