Sciweavers

164 search results - page 23 / 33
» Covert two-party computation
Sort
View
EUROCRYPT
2009
Springer
14 years 10 months ago
Key Agreement from Close Secrets over Unsecured Channels
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
Bhavana Kanukurthi, Leonid Reyzin
COMSWARE
2008
IEEE
14 years 4 months ago
Quantifying presence using calling patterns
—Presence technology is going to be an integral part of the next generation of communication technology. It can eliminate telephone tag between two parties (caller and callee), w...
Husain Husna, Santi Phithakkitnukoon, Enkh-Amgalan...
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
14 years 4 months ago
Privacy-Preserving k-NN for Small and Large Data Sets
It is not surprising that there is strong interest in kNN queries to enable clustering, classification and outlierdetection tasks. However, previous approaches to privacypreservi...
Artak Amirbekyan, Vladimir Estivill-Castro
EUROCRYPT
2004
Springer
14 years 3 months ago
Public-Key Steganography
Informally, a public-key steganography protocol allows two parties, who have never met or exchanged a secret, to send hidden messages over a public channel so that an adversary can...
Luis von Ahn, Nicholas J. Hopper
CONCUR
2003
Springer
14 years 3 months ago
Contract Signing, Optimism, and Advantage
Abstract. A contract signing protocol lets two parties exchange digital signatures on a pre-agreed text. Optimistic contract signing protocols enable the signers to do so without i...
Rohit Chadha, John C. Mitchell, Andre Scedrov, Vit...