39 search results - page 2 / 8 » Tightness of the Security Bound of CENC |
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quant...
INFOCOM
2012
IEEE
12 years 6 months ago
2012
IEEE
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy
conditions and communication costs. This is motivated by a
numbe...
TIT
2010
13 years 2 months ago
2010
In this paper, we first show that many independent pseudorandom permutations over {0, 1}n can be obtained from a single public random permutation and secret n bits. We next prove ...
EUROCRYPT
1999
Springer
14 years 6 hour ago
1999
Springer
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an inform...
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...