Sciweavers

13 search results - page 1 / 3
» Alice and Bob: Reconciling Formal Models and Implementation
Sort
View
ICML
2006
IEEE
16 years 1 months ago
Learning to impersonate
Consider Alice, who is interacting with Bob. Alice and Bob have some shared secret which helps Alice identify Bob-impersonators. Now consider Eve, who knows Alice and Bob, but doe...
Moni Naor, Guy N. Rothblum
CCS
2009
ACM
16 years 26 days ago
Conditional proxy re-encryption secure against chosen-ciphertext attack
In a proxy re-encryption (PRE) scheme [4], a proxy, authorized by Alice, transforms messages encrypted under Alice's public key into encryptions under Bob's public key w...
Jian Weng, Robert H. Deng, Xuhua Ding, Cheng-Kang ...
APLAS
2010
ACM
15 years 14 days ago
Typechecking Higher-Order Security Libraries
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
Karthikeyan Bhargavan, Cédric Fournet, Nata...
79
Voted
NGITS
1999
Springer
15 years 4 months ago
Multiplex: A Formal Model for Multidatabases and Its Implementation
The integration of information from multiple databases has been an enduring subject of research for over 20 years, and many different solutions have been attempted or proposed. Mis...
Amihai Motro
124
Voted
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 26 days ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs