Sciweavers

2303 search results - page 47 / 461
» The Cryptographic Abstract Machine
Sort
View
125
Voted
ICML
2004
IEEE
16 years 3 months ago
Using relative novelty to identify useful temporal abstractions in reinforcement learning
lative Novelty to Identify Useful Temporal Abstractions in Reinforcement Learning ?Ozg?ur S?im?sek ozgur@cs.umass.edu Andrew G. Barto barto@cs.umass.edu Department of Computer Scie...
Özgür Simsek, Andrew G. Barto
CRYPTO
1999
Springer
159views Cryptology» more  CRYPTO 1999»
15 years 6 months ago
UMAC: Fast and Secure Message Authentication
We describe a message authentication algorithm, UMAC, which can authenticate messages (in software, on contemporary machines) roughly an order of magnitude faster than current prac...
John Black, Shai Halevi, Hugo Krawczyk, Ted Krovet...
114
Voted
ESORICS
2007
Springer
15 years 8 months ago
Synthesizing Secure Protocols
Abstract. We propose a general transformation that maps a cryptographic protocol that is secure in an extremely weak sense (essentially in a model where no adversary is present) in...
Véronique Cortier, Bogdan Warinschi, Eugen ...
96
Voted
ACNS
2006
Springer
86views Cryptology» more  ACNS 2006»
15 years 8 months ago
W3Bcrypt: Encryption as a Stylesheet
Abstract. While web-based communications (e.g., webmail or web chatrooms) are increasingly protected by transport-layer cryptographic mechanisms, such as the SSL/TLS protocol, ther...
Angelos Stavrou, Michael E. Locasto, Angelos D. Ke...
125
Voted
TCC
2005
Springer
163views Cryptology» more  TCC 2005»
15 years 8 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