Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,336,721 papers from all fields of science
Search
Sign In
Create Free Account
Universal composability
The framework of universal composability (UC) is a general-purpose model for the analysis of cryptographic protocols. It guarantees very strong…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Authentication
Commitment scheme
Common reference string model
Composability
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
On the Universally Composable Security of OpenStack
Kyle Hogan
,
Hoda Maleki
,
+5 authors
Haibin Zhang
IEEE Cybersecurity Development
2019
Corpus ID: 51604216
We initiate an effort to provide a rigorous, holistic and modular security analysis of OpenStack. OpenStack is the prevalent open…
Expand
2014
2014
Transferable Multiparty Computation With Applications to the Smart Grid
Michael R. Clark
,
K. Hopkinson
IEEE Transactions on Information Forensics and…
2014
Corpus ID: 10214379
The smart grid offers an exciting way to better manage various aspects of a given utility. This comes with an increased threat of…
Expand
2014
2014
Universally Composable Secure Group Communication
Youliang Tian
,
Changgen Peng
IACR Cryptology ePrint Archive
2014
Corpus ID: 14547613
This paper analyzes group communication within the universally composable framework. We first propose the group communication…
Expand
2010
2010
Universally Composable NIZK Protocol in an Internet Voting Scheme
Md. Abdul Based
,
S. F. Mjølsnes
International Workshop on Security and Trust…
2010
Corpus ID: 33488175
We use the Universally Composable (UC) framework to evaluate our Non-Interactive Zero-Knowledge (NIZK) protocol for verifying the…
Expand
2009
2009
New Constructions for Reusable, Non-erasure and Universally Composable Commitments
Huafei Zhu
Information Security Practice and Experience
2009
Corpus ID: 11087033
This paper proposes a novel construction of reusable and non-erasure commitment schemes in the common reference string model. We…
Expand
2008
2008
An optimistic fair exchange protocol and its security in the universal composability framework
Yusuke Okada
,
Yoshifumi Manabe
,
T. Okamoto
International Journal of Applied Cryptography
2008
Corpus ID: 17578934
Fair exchange protocols allow both or neither of two parties to obtain the other's items, and this property is essential in e…
Expand
2007
2007
Universally Composable Security Concurrent Deniable Authentication Based on Witness Indistinguishable
Feng Tao
,
Ma Jian-feng
2007
Corpus ID: 465941
A new approach and an idea for exploration are presented to the concurrent deniable authentication based on witness…
Expand
2006
2006
Universally Composable Oblivious Transfer in the Multi-party Setting
M. Fischlin
The Cryptographer's Track at RSA Conference
2006
Corpus ID: 2096712
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities…
Expand
2004
2004
Universally Composable Committed Oblivious Transfer and Multi-Party Computation Assuming Only Basic Black-Box Primitives
Gregory Estren
2004
Corpus ID: 16989179
A transmission cable (30, 50, 70, 80) for an ignition system of a fuel burning engine has a body of electrical insulation (31, 51…
Expand
2001
2001
Universally Composable Commitments (Extended Abstract)
R. Canetti
,
M. Fischlin
Annual International Cryptology Conference
2001
Corpus ID: 59724862
We propose a new security measure for commitment pro- tocols, called Universally Composable (UC) Commitment. The measure…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE