搜索结果: 1-9 共查到“军事学 impossibility results”相关记录9条 . 查询时间(0.078 秒)
Overcoming Cryptographic Impossibility Results using Blockchains
Blockchain Bitcoin Ethereum
2017/9/26
Blockchain technology has the potential to disrupt how cryptography is done. In this work, we propose to view blockchains as an "enabler", much like indistinguishability obfuscation (Barak et al., CRY...
The pseudorandom-function oracle-Diffie–Hellman (PRF-ODH) assumption has been introduced recently to analyze a variety of DH-based key exchange protocols, including TLS 1.2 and the TLS 1.3 candidates,...
Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results
Backdoor Surveillance PRNG with input
2016/6/6
Inspired by the Dual EC DBRG incident, Dodis et al. (Eurocrypt
2015) initiated the formal study of backdoored PRGs, showing
that backdoored PRGs are equivalent to public key encryption schemes,
giv...
Statistical Impossibility Results for Oblivious Transfer Reductions
Unconditional Security Oblivious Transfer Lower Bounds
2009/11/18
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure
multi-party computation. OT is impossible to implement from scratch in an unconditionally secure
way, but...
Possibility and impossibility results for selective decommitments
cryptography commitments zero-knowledge
2009/6/3
The selective decommitment problem can be described as follows: assume an adversary re-
ceives a number of commitments and then may request openings of, say, half of them. Do the
unopened commitment...
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...
Indifferentiability, Impossibility Results on Reductions,and Applications to the Random Oracle Methodology
Indistinguishability reductions indifferentiability
2009/4/9
The goals of this paper are three-fold. First we introduce and motivate a generalization
of the fundamental concept of the indistinguishability of two systems, called indifferentiability. This
immed...
Lower Bounds and Impossibility Results for Concurrent Self Composition
secure computation protocol composition self and general composition
2009/3/23
In the setting of concurrent self composition, a single protocol is executed many times concurrently
by a single set of parties. In this paper, we prove lower bounds and impossibility results
for se...
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs
universal composability, impossibility results, concurrent general composition, public-key models
2008/5/20
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...