搜索结果: 1-15 共查到“Universal Composability”相关记录17条 . 查询时间(0.064 秒)
Fortified Universal Composability: Taking Advantage of Simple Secure Hardware Modules
universal composability secure hardware modules
2018/5/30
We initiate the study of incorporating remotely unhackable hardware modules, such as air-gap switches and data diodes, into the field of multi-party computation. As a result, we are able to construct ...
Symbolic Universal Composability
universal composability symbolic cryptography virtual primitives
2013/2/21
We introduce a variant of the Universal Composability framework (UC; Canetti, FOCS 2001) that uses symbolic cryptography. Two salient properties of the UC framework are secure composition and the poss...
The IITM Model: a Simple and Expressive Model for Universal Composability
foundations cryptographic protocols universal composability modular security analysis
2013/2/21
The universal composability paradigm allows for the modular design and analysis of cryptographic protocols. It has been widely and successfully used in cryptography. However, devising a coherent yet s...
Careful with Composition: Limitations of Indifferentiability and Universal Composability
Limitations of Indifferentiability Universal Composability
2011/7/25
We exhibit a hash-based storage auditing scheme which is provably secure in the random-oracle model (ROM), but easily broken when one instead uses typical indifferentiable hash constructions.
We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called ``GNUC'' (with the recursive meaning ``GNUC's Not UC''), already alluding to the simila...
Careful with Composition: Limitations of Indifferentiability and Universal Composability
Universal Composability Limitations of Indifferentiability
2012/3/27
We exhibit a hash-based storage auditing scheme which is provably secure in the random-oracle model (ROM), but easily broken when one instead uses typical indifferentiable hash constructions. This con...
We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called ``GNUC'' (with the recursive meaning ``GNUC's Not UC''), already alluding to the simila...
Universal Composability from Essentially Any Trusted Setup
foundations / universal composition multi-party computation
2012/3/28
It is impossible to securely carry out general multi-party computation in arbitrary network contexts like the Internet, unless protocols have access to some trusted setup. In this work we classify the...
Universal Composability from Essentially Any Trusted Setup
foundations / universal composition multi-party computation
2011/6/9
It is impossible to securely carry out general multi-party computation in arbitrary network contexts like the Internet, unless protocols have access to some trusted setup. In this work we classify the...
A note on the feasibility of generalised universal composability
A note feasibility composability
2012/11/30
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 ...
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs
universal composability impossibility results concurrent general composition
2009/6/2
Universal composability and concurrent general composition consider a setting where secure
protocols are run concurrently with each other and with arbitrary other possibly insecure pro-
tocols. Prot...
Evaluating Security of Voting Schemes in the Universal Composability Framework
Voting homomorphic threshold encryption universal composability
2009/4/13
In the literature, voting protocols are considered secure if they satisfy requirements
such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting
protocol with respect...
General Composition and Universal Composability in Secure Multiparty Computation
Universal Composability Secure Multiparty Computation
2009/4/9
Concurrent general composition relates to a setting where a secure protocol is run in a
network concurrently with other, arbitrary protocols. Clearly, security in such a setting is what is desired, o...
New Notions of Security:Achieving Universal Composability without Trusted Setup
Security Universal Composability Trusted Setup
2009/3/27
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new
notion, involves comparing the protocol executions with an ideal execution involving ideal functionalit...
Long-term Security and Universal Composability
Universal Composability long-term security zero-knowledge
2008/12/31
Algorithmic progress and future technology threaten today’s cryptographic
protocols. Long-term secure protocols should not even in future reveal more information
to a—then possibly unlimited—adversa...