Sciweavers

1005 search results - page 96 / 201
» Practical Secure Function Evaluation
Sort
View
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
CCS
2007
ACM
14 years 4 months ago
Privacy-preserving remote diagnostics
We present an efficient protocol for privacy-preserving evaluation of diagnostic programs, represented as binary decision trees or branching programs. The protocol applies a bran...
Justin Brickell, Donald E. Porter, Vitaly Shmatiko...
USITS
2003
13 years 11 months ago
Mayday: Distributed Filtering for Internet Services
Mayday is an architecture that combines overlay networks with lightweight packet filtering to defend against denial of service attacks. The overlay nodes perform client authentic...
David G. Andersen
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
13 years 11 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
CAV
2010
Springer
198views Hardware» more  CAV 2010»
14 years 2 months ago
Automatically Proving Linearizability
Abstract. This paper presents a practical automatic verification procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure im...
Viktor Vafeiadis