Impossibility results for universal composability in public-key models and with fixed inputs
From MaRDI portal
Publication:451115
DOI10.1007/s00145-010-9069-7zbMath1258.94039OpenAlexW2154567403MaRDI QIDQ451115
Publication date: 21 September 2012
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.7711
Related Items
Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party, Concurrently Composable Security with Shielded Super-Polynomial Simulators, On the Necessary and Sufficient Assumptions for UC Computation, Universally Composable Security Analysis of TLS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Composition of secure multi-party protocols. A comprehensive study.
- Security and composition of multiparty cryptographic protocols
- On the limitations of universally composable two-party computation without set-up assumptions
- Secure computation with honest-looking parties (extended abstract)
- Information-theoretically secure protocols and security under composition
- Resettable zero-knowledge (extended abstract)
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
- On the Necessary and Sufficient Assumptions for UC Computation
- Universally composable two-party and multi-party secure computation
- New notions of security
- Concurrent general composition of secure protocols in the timing model
- Foundations of Cryptography
- A unified framework for concurrent security
- Secure Computation Without Authentication
- Theory of Cryptography
- Theory of Cryptography