Back to Results
First PageMeta Content
Needham–Schroeder protocol / Ciphertext indistinguishability / Kerberos / Advantage / XTR / Ticket Granting Ticket / Cryptography / Cryptographic protocols / Computer network security


Inductive Proofs of Computational Secrecy ? Arnab Roy1 , Anupam Datta2 , Ante Derek1 , John C. Mitchell1 1
Add to Reading List

Document Date: 2007-12-18 00:17:14

Open Document

File Size: 254,04 KB

Share Result on Facebook

Company

Siebel / U.S. Army Research / Needham / A0 / Technology Center TRUST / SG2 / Computational PCL / Secure Information Systems / /

/

Event

FDA Phase / Business Partnership / /

Facility

Carnegie Mellon University / Stanford University / /

IndustryTerm

secure key exchange protocol / given protocol / Internet users / actual protocol / secretive protocols / secretive protocol / /

Organization

G8 / U.S. Army Research Office / National Science Foundation / Stanford University / G7 / Carnegie Mellon University / Pittsburgh / IND-CCA / /

Position

first author / /

Product

CCA2 / X / V5 / /

SportsLeague

Stanford University / /

Technology

encryption / actual protocol / 5 3 Secretive Protocols / 4.1 Establishing Secretive Protocols / secretive protocol / key distribution protocols / given protocol / simulation / application protocol / 4.2 Relating Secretive Protocols / SSL / Modeling Protocols / secure key exchange protocol / network protocols / /

SocialTag