scientific article; zbMATH DE number 2009949

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cryptographic protocolsuniversally composable security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Long-term security and universal composability ⋮ A universally composable PAKE with zero communication cost. (And why it shouldn't be considered UC-secure) ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Lower bounds and impossibility results for concurrent self composition ⋮ Concurrently composable non-interactive secure computation ⋮ On concurrent multi-party quantum computation ⋮ Secure computation without authentication ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Lower bounds for non-black-box zero knowledge ⋮ Isolated Proofs of Knowledge and Isolated Zero Knowledge ⋮ A note on universal composable zero-knowledge in the common reference string model ⋮ Local Sequentiality Does Not Help for Concurrent Composition ⋮ Compact, efficient and UC-secure isogeny-based oblivious transfer ⋮ Towards accountability in CRS generation ⋮ On the relationships between notions of simulation-based security ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ Initiator-Resilient Universally Composable Key Exchange