Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PRIVATE KEY CRYPTOGRAPHY:
Reports tagged with Private key Cryptography:
TR09-108 | 31st October 2009
Chongwon Cho, Chen-Kuei Lee, Rafail Ostrovsky

Equivalence of Uniform Key Agreement and Composition Insecurity

Revisions: 2

It is well known that proving the security of a key agreement protocol (even in a special case where the protocol transcript looks random to an outside observer) is at least as difficult as proving $P \not = NP$. Another (seemingly unrelated) statement in cryptography is the existence of two ... more >>>




ISSN 1433-8092 | Imprint