Sciweavers

100 search results - page 6 / 20
» Alice and Bob
Sort
View
ICALP
2010
Springer
13 years 9 months ago
Choosing, Agreeing, and Eliminating in Communication Complexity
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...
Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevit...
EUROCRYPT
2004
Springer
14 years 1 months ago
Public Key Encryption with Keyword Search
We study the problem of searching on data that is encrypted using a public key system. Consider user Bob who sends email to user Alice encrypted under Alice’s public key. An ema...
Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky...
COMCOM
2002
105views more  COMCOM 2002»
13 years 7 months ago
An intensive survey of fair non-repudiation protocols
With the phenomenal growth of the Internet and open networks in general, security services, such as non-repudiation, become crucial to many applications. Nonrepudiation services m...
Steve Kremer, Olivier Markowitch, Jianying Zhou
ITNG
2006
IEEE
14 years 1 months ago
Two-Party Private Vector Dominance: The All-Or-Nothing Deal
Alice holds a secret integer a while Bob holds a secret integer b, they want to decide on the predicate a > b with no information revealed other than the result. This is the we...
Maged Hamada Ibrahim
FCS
2006
13 years 9 months ago
Quantum Oblivious Transfer Based on POVM Measurements
- Oblivious transfer OT is an important primitive in cryptography. In chosen one-out-of-two OT, Alice offers two bits, one of which Bob can choose to read, not learning any informa...
Wei Yang, Liusheng Huang, Yonglong Luo, Mingjun Xi...