Sciweavers

33 search results - page 3 / 7
» Oracles Are Subtle But Not Malicious
Sort
View
ASIACRYPT
2000
Springer
14 years 5 days ago
Round-Efficient Conference Key Agreement Protocols with Provable Security
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
Wen-Guey Tzeng, Zhi-Jia Tzeng
EUROCRYPT
2003
Springer
14 years 1 months ago
Why Provable Security Matters?
Abstract. Recently, methods from provable security, that had been developped for the last twenty years within the research community, have been extensively used to support emerging...
Jacques Stern
EUROCRYPT
2004
Springer
14 years 8 days ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
ESORICS
2009
Springer
14 years 9 months ago
Secure Evaluation of Private Linear Branching Programs with Medical Applications
Abstract. Diagnostic and classification algorithms play an important role in data analysis, with applications in areas such as health care, fault diagnostics, or benchmarking. Bran...
Mauro Barni, Pierluigi Failla, Vladimir Kolesnikov...
CTRSA
2008
Springer
134views Cryptology» more  CTRSA 2008»
13 years 10 months ago
An Efficient Protocol for Fair Secure Two-Party Computation
In the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits...
Mehmet S. Kiraz, Berry Schoenmakers