搜索结果: 1-15 共查到“军事学 composability”相关记录21条 . 查询时间(0.094 秒)
Fortified Universal Composability: Taking Advantage of Simple Secure Hardware Modules
universal composability secure hardware modules
font style='font-size:12px;'>
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 ...
Probabilistic Termination and Composability of Cryptographic Protocols
probabilistic termination Universal Composition cryptographic protocol
font style='font-size:12px;'>
2016/4/6
When analyzing the round complexity of multi-party cryptographic protocols, one often overlooks the fact that underlying resources, such as a broadcast channel, can be by themselves expensive to imple...
Symbolic Universal Composability
universal composability symbolic cryptography virtual primitives
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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.
GNUC: A New Universal Composability Framework
foundations protocols composability
font style='font-size:12px;'>
2011/7/25
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
font style='font-size:12px;'>
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...
GNUC: A New Universal Composability Framework
foundations / protocols composability
font style='font-size:12px;'>
2012/3/28
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Polynomial Runtime and Composability
Universal composability polynomial runtime multi-party protocols
font style='font-size:12px;'>
2009/6/11
To prove security of a multi-party cryptographic protocol, one often reduces
attacks on the protocol to attacks on a suitable computational problem. Thus, if the computational problem is hard, then t...
On the Composability of Statistically Secure Bit Commitments
Composability Statistically Secure Bit Commitments
font style='font-size:12px;'>
2009/6/9
We show that stand-alone statistically secure commitments based on two-party stateless
primitives are statistically universally composable. I.e. they are simulatable secure with an
unlimited adversa...
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs
universal composability impossibility results concurrent general composition
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...