370 search results - page 53 / 74 » Limits of Constructive Security Proofs |
CORR
2008
Springer
13 years 8 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 ...
STOC
2009
ACM
14 years 8 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...
ASIACRYPT
2005
Springer
14 years 1 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...
ACNS
2003
Springer
14 years 1 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...
PKC
2010
Springer
14 years 21 hour 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...