370 search results - page 53 / 74 » Limits of Constructive Security Proofs |
142
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We consider the problem of securing a multicast network against a wiretapper that can intercept the packets on a limited number of arbitrary network links of his choice. We assume ...
149
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
134
click to vote
ASIACRYPT
2005
Springer
15 years 10 months ago
2005
Springer
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
184
click to vote
ACNS
2003
Springer
15 years 9 months ago
2003
Springer
Distributed key generation is one of the most challenging tasks for threshold cryptosystems. Designing such a protocol and proving its security against a malicious, adaptive adver...
162
click to vote
PKC
2010
Springer
15 years 8 months ago
2010
Springer
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...