100 search results - page 12 / 20 » Alice and Bob |
IACR
2011
12 years 7 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the disho...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
PAIRING
2007
Springer
14 years 1 months ago
2007
Springer
A proxy re-encryption system allows the proxy to transform ciphertexts encrypted under Alice’s public key into the different ciphertexts that can be decrypted by Bob’s secret ...
IFIPTM
2009
13 years 5 months ago
2009
In many distributed applications, a party who wishes to make a transaction requires that it has a certain level of trust in the other party. It is frequently the case that the part...