Long-term security and universal composability
Algorithmic progress and future technological advances threaten today's cryptographic protocols. This may allow adversaries to break a protocol retrospectively by breaking the underlying complexity assumptions long after the execution of the protocol. Long-term secure protocols, protocols that after the end of the execution do not reveal any information to a then possibly unlimited adversary, could meet this threat. On the other hand, in many applications, it is necessary that a protocol is secure not only when executed alone, but within arbitrary contexts. The established notion of universal composability (UC) captures this requirement. This paper studies protocols which are simultaneously long-term secure and universally composable. It is shown that the usual set-up assumptions used for UC protocols (e.g. a common reference string) are not sufficient to achieve long-term secure and composable protocols for commitments or zero-knowledge protocols. The paper moreover provides practical alternatives (e.g. signature cards) to these usual setupassumptions and shows that these enable the implementation of the important primitives commitment and zero-knowledge protocols.
- Long-Term Security and Universal Composability
- Universally composable security
- Universal composability from essentially any trusted setup
- Universally Composable Security with Global Setup
- New notions of security: achieving universal composability without trusted setup
- A unified framework for concurrent security
- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
- On the cryptographic long term security
- scientific article; zbMATH DE number 1842484
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Composable Security in the Bounded-Quantum-Storage Model
- Composition of secure multi-party protocols. A comprehensive study.
- Cryptography in the Bounded-Quantum-Storage Model
- Foundations of Cryptography
- scientific article; zbMATH DE number 1722690 (Why is no real title available?)
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1258344 (Why is no real title available?)
- scientific article; zbMATH DE number 1088242 (Why is no real title available?)
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- scientific article; zbMATH DE number 1952906 (Why is no real title available?)
- scientific article; zbMATH DE number 2009949 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- Indistinguishability Amplification
- Long-Term Security and Universal Composability
- Minimum disclosure proofs of knowledge
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- On IND-CCA security modeling in cryptographic protocols
- On the (Im-)Possibility of Extending Coin Toss
- On the Composition of Zero-Knowledge Proof Systems
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Security and composition of multiparty cryptographic protocols
- Statistically-hiding commitment from any one-way function
- The reactive simulatability (RSIM) framework for asynchronous systems
- Theory of Cryptography
- Universally Composable Security with Global Setup
- Universally composable two-party and multi-party secure computation
- Universally composable zero-knowledge arguments and commitments from signature cards
- Everlasting multi-party computation
- Everlasting UC commitments from fully malicious PUFs
- Embedding the UC model into the IITM model
- Polynomial runtime and composability
- Long-term secure commitments via extractable-binding commitments
- Long term confidentiality: a survey
- Everlasting multi-party computation
- Perpetuality for Full and Safe Composition (in a Constructive Setting)
- Modeling Computational Security in Long-Lived Systems
- Universally Composable Security with Global Setup
- Long-Term Security and Universal Composability
- On the cryptographic long term security
- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
- Universally composable zero-knowledge arguments and commitments from signature cards
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- Universal reductions: reductions relative to stateful oracles
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
- Publicly verifiable deletion from minimal assumptions
- Agile cryptography: a universally composable approach
- Composable long-term security with rewinding
- Practically efficient private set intersection from trusted hardware with side-channels
- Robust quantum public-key encryption with applications to quantum key distribution
- Resettable statistical zero-knowledge for NP
- Four-round statistical non-malleable zero-knowledge
- Publicly verifiable deletion: general compilers from minimal assumptions
- HELP: everlasting privacy through server-aided randomness
This page was built for publication: Long-term security and universal composability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604632)
