Results 231 to 240 of about 959,083 (268)
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs [PDF]
Journal of Cryptology, 2010 Universal composability and concurrent general composition consider a setting where secure protocols are run concurrently with each other and with arbitrary other possibly insecure protocols.
Yehuda Lindell
exaly +2 more sources
iUC: Flexible Universal Composability Made Simple [PDF]
Lecture Notes in Computer Science, 2019 Proving the security of complex protocols is a crucial and very challenging task. A widely used approach for reasoning about such protocols in a modular way is universal composability.
Ralf Kusters +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Universally Composable Accumulators
2020Accumulators, first introduced by Benaloh and de Mare (Eurocrypt 1993), are compact representations of arbitrarily large sets and can be used to prove claims of membership or non-membership about the underlying set. They are almost exclusively used as building blocks in real-world complex systems, including anonymous credentials, group signatures and ...
Foteini Baldimtsi +2 more
openaire +5 more sources
Universally Composable Security
Journal of the ACM, 2020This work presents a general framework for describing cryptographic protocols and analyzing their security. The framework allows specifying the security requirements of practically any cryptographic task in a unified and systematic way. Furthermore, in this framework the security of protocols is preserved under a general composition operation, called ...
openaire +2 more sources
Agile Cryptography: A Universally Composable Approach
2023Being capable of updating cryptographic algorithms is an inevitable and essential practice in cryptographic engineering. This cryptographic agility, as it has been called, is a fundamental desideratum for long term cryptographic system security that still poses significant challenges from a modeling perspective.
Christian Badertscher +2 more
openaire +2 more sources
Universally Composable Symmetric Encryption
2009 22nd IEEE Computer Security Foundations Symposium, 2009For most basic cryptographic tasks, such as public-key encryption, digital signatures, authentication, key exchange, and many other more sophisticated tasks, ideal functionalities have been formulated in the simulation-based security approach, along with their realizations.
Ralf Küsters, Max Tuengerthal
openaire +2 more sources
Universally Composable Signcryption
2007One of the challenges within public-key based cryptosystems is providing the user with a convenient interface, while retaining security. In the universal composability framework, we propose an ideal functionality for secure messaging, with a user-friendly interface.
Kristian Gjøsteen, Lillian Kråkmo
openaire +2 more sources
OmniSCOPE: Composing Universal Therapies
Methods of Information in Medicine, 2010Summary Objectives: This paper presents Omni SCOPE, an environment for the development of mobile pervasive therapy artifacts. OmniSCOPE builds on SCOPE, a tool for the support of mobile psychotherapy. It aims at providing therapists with means to adjust and compose new therapeutic artifacts to suit their patients’ needs and new therapeutic ...
M, de Sá, L, Carriço
openaire +2 more sources
On the Universally Composable Security of OpenStack
2019 IEEE Cybersecurity Development (SecDev), 2019OpenStack is the prevalent open-source, non-proprietary package for managing cloud services and data centers. It is highly complex and consists of multiple inter-related components which are developed by separate, loosely coordinated groups. We initiate an effort to provide a rigorous and holistic security analysis of OpenStack.
Kyle Hogan +7 more
openaire +2 more sources
Long-Term Security and Universal Composability [PDF]
Journal of Cryptology, 2010 Algorithmic progress and future technological advances threaten today\u27s cryptographic protocols. This may allow adversaries to break a protocol retrospectively by breaking the underlying complexity assumptions long after the execution of the protocol.
Dominique Unruh, Jorn Müller-Quade
exaly +2 more sources