| Document Date: 2007-12-18 01:05:08
Open Document File Size: 231,95 KBShare Result on Facebook
City Austin / / Company IBM / / Country France / / Currency pence / / Event FDA Phase / / Facility Stanford University / University of Texas / / IndustryTerm test algorithms / information in protocol / generation algorithm / public-key encryption algorithm / fixed algorithm / probabilistic polynomial-time algorithm / polynomial time algorithm / modal operator / polynomial-time algorithm / probabilistic polynomial-time protocols / symbolic algorithm / security protocols / / Organization office of Naval Research / National Science Foundation / Stanford University / Department of Defense / University of Texas / / Position MP / RT / ponens MP / Private / / Product CCA2 / X / Y˜ / G3 / / ProvinceOrState Texas / / SportsLeague Stanford University / / Technology encryption / test algorithms / 6 Protocol / cryptography / public key / polynomial time algorithm / protocol Q. The key generation algorithm / public-key encryption algorithm / fixed algorithm / polynomial-time algorithm / security protocols / private key / probabilistic polynomial-time algorithm / probabilistic polynomial-time protocols / 2 Protocol / network protocols / /
SocialTag |
Probabilistic polynomial-time semantics for a protocol security logic? Anupam Datta1 , Ante Derek1 , John C. Mitchell1 , Vitaly Shmatikov2 , and Mathieu Turuani3 1 2