84 search results - page 3 / 17 » On the Security Loss in Cryptographic Reductions |
IEEEARES
2008
IEEE
14 years 5 days ago
2008
IEEE
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
COCO
2009
Springer
14 years 10 days ago
2009
Springer
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
ICQNM
2008
IEEE
14 years 5 days ago
2008
IEEE
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
ICML
2010
IEEE
13 years 3 months ago
2010
IEEE
In this paper, we consider online prediction from expert advice in a situation where each expert observes its own loss at each time while the loss cannot be disclosed to others fo...