Sciweavers

1717 search results - page 20 / 344
» A Computable Spectral Theorem
Sort
View
TCC
2005
Springer
163views Cryptology» more  TCC 2005»
15 years 9 months ago
Adaptive Security of Symbolic Encryption
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
Daniele Micciancio, Saurabh Panjwani
TARK
2009
Springer
15 years 11 months ago
Program equilibria and discounted computation time
Tennenholtz (GEB 2004) developed Program Equilibrium to model play in a finite twoplayer game where each player can base their strategy on the other player’s strategies. Tennen...
Lance Fortnow