Sciweavers

100 search results - page 8 / 20
» Alice and Bob
Sort
View
APLAS
2010
ACM
13 years 7 months 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...
CRYPTO
2003
Springer
132views Cryptology» more  CRYPTO 2003»
14 years 26 days ago
On Cryptographic Assumptions and Challenges
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
Moni Naor
FC
2005
Springer
120views Cryptology» more  FC 2005»
14 years 1 months ago
Achieving Fairness in Private Contract Negotiation
Abstract. Suppose Alice and Bob are two entities (e.g. agents, organizations, etc.) that wish to negotiate a contract. A contract consists of several clauses, and each party has ce...
Keith B. Frikken, Mikhail J. Atallah
CRYPTO
1995
Springer
135views Cryptology» more  CRYPTO 1995»
13 years 11 months ago
Committed Oblivious Transfer and Private Multi-Party Computation
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
Claude Crépeau, Jeroen van de Graaf, Alain ...
NDSS
2007
IEEE
14 years 1 months ago
Attribute-Based Publishing with Hidden Credentials and Hidden Policies
With Hidden Credentials Alice can send policyencrypted data to Bob in such a way that he can decrypt the data only with the right combination of credentials. Alice gains no knowle...
Apu Kapadia, Patrick P. Tsang, Sean W. Smith