Results 241 to 250 of about 959,083 (268)
Some of the next articles are maybe not open access.

A note on the feasibility of generalised universal composability

Mathematical Structures in Computer Science, 2009
In this paper we study (interpret) the precise composability guarantee of the generalised universal composability (GUC) feasibility with global setups that was proposed in the recent paper Canetti et al. (2007) from the point of view of full universal composability (FUC), that is, composability with arbitrary protocols, which was the original security ...
Andrew Chi-Chih Yao   +2 more
openaire   +2 more sources

Universally Composable Subversion-Resilient Cryptography

2022
Subversion attacks undermine security of cryptographic protocols by replacing a legitimate honest party’s implementation with one that leaks information in an undetectable manner. An important limitation of all currently known techniques for designing cryptographic protocols with security against subversion attacks is that they do not automatically ...
Chakraborty S.   +3 more
openaire   +5 more sources

Universally composable zero-knowledge sets

International Journal of Grid and Utility Computing, 2012
We define and construct universally composable (UC) Zero-Knowledge Set (ZKS) protocols. A ZKS protocol allows a prover to commit to a secret set S and prove statements of the form x ∈ S or x ∉ S without revealing any other information about S. The universal composability framework initiated by Canetti is very useful as it ensures stronger security such
Haixia Xu 0002   +2 more
openaire   +2 more sources

Simplified Universal Composability Framework

2015
We introduce a simplified universally composable UC security framework in our thesis 2005. In this paper we present an updated more comprehensive and illustrated version. The introduction of our simplified model is motivated by the difficulty to describe and analyze concrete protocols in the full UC framework due to its generality and complexity ...
openaire   +2 more sources

Universally Composable Security with Local Adversaries

2012
The traditional approach to formalizing ideal-model based definitions of security for multi-party protocols models adversaries (both real and ideal) as centralized entities that control all parties that deviate from the protocol. While this centralized-adversary modeling suffices for capturing basic security properties such as secrecy of local inputs ...
Ran Canetti, Margarita Vald
openaire   +2 more sources

A Universally Composable Treatment of Network Time

2017 IEEE 30th Computer Security Foundations Symposium (CSF), 2017
The security of almost any real-world distributed system today depends on the participants having some "reasonably accurate" sense of current real time. Indeed, to name one example, the very authenticity of practically any communication on the Internet today hinges on the ability of the parties to accurately detect revocation of certificates, or ...
Ran Canetti   +3 more
openaire   +2 more sources

Universally Composable Simultaneous Broadcast

2006
Simultaneous Broadcast protocols allow different parties to broadcast values in parallel while guaranteeing mutual independence of the broadcast values. The problem of simultaneous broadcast was suggested by Chor et al. (FOCS 1985) who proposed a linear-round solution, and later improved by Chor and Rabin (PODC 1987) and Gennaro (IEEE Trans.
openaire   +2 more sources

UNIVERSALLY COMPOSABLE BLIND SIGNATURE FUNCTIONALITY

International Journal of Information Technology & Decision Making, 2004
Blind signatures play a critical role in digital cash systems. In this paper, we investigate the blind signature functionality in the framework of universally composable (UC) security — the strongest security guarantees up to now for cryptographic protocols over the Internet.
Shirley H. C. Cheung   +2 more
openaire   +1 more source

Universally Composable Identity-Based Encryption

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006
Identity-based encryption (IBE) is one of the most important primitives in cryptography, and various security notions of IBE (e.g., IND-ID-CCA2, NM-ID-CCA2, IND-sID-CPA etc.) have been introduced. The relations among them have been clarified recently.
Ryo Nishimaki   +2 more
openaire   +3 more sources

Universally Composable Security Analysis of TLS

2008
We present a security analysis of the complete TLS protocol in the Universal Composable security framework. This analysis evaluates the composition of key exchange functionalities realized by the TLS handshake with the message transmission of the TLS record layer to emulate secure communication sessions and is based on the adaption of the secure ...
Sebastian Gajek   +4 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy