Sciweavers

264 search results - page 29 / 53
» Minimal-Latency Secure Function Evaluation
Sort
View
ESORICS
2008
Springer
13 years 11 months ago
Sharemind: A Framework for Fast Privacy-Preserving Computations
Gathering and processing sensitive data is a difficult task. In fact, there is no common recipe for building the necessary information systems. In this paper, we present a provably...
Dan Bogdanov, Sven Laur, Jan Willemson
CARDIS
1998
Springer
110views Hardware» more  CARDIS 1998»
14 years 2 months ago
Reducing the Collision Probability of Alleged Comp128
Wagner, Goldberg and Briceno have recently published an attack [2] on what they believe to be Comp128, the GSM A3A8 authentication hash function [1]. Provided that the attacker has...
Helena Handschuh, Pascal Paillier
EDBT
2010
ACM
181views Database» more  EDBT 2010»
13 years 8 months ago
Private record matching using differential privacy
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...
Ali Inan, Murat Kantarcioglu, Gabriel Ghinita, Eli...
CANS
2009
Springer
120views Cryptology» more  CANS 2009»
14 years 4 months ago
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
Abstract. We consider generic Garbled Circuit (GC)-based techniques for Secure Function Evaluation (SFE) in the semi-honest model. We describe efficient GC constructions for additi...
Vladimir Kolesnikov, Ahmad-Reza Sadeghi, Thomas Sc...
FC
2005
Springer
120views Cryptology» more  FC 2005»
14 years 3 months ago
Achieving Fairness in Private Contract Negotiation
Abstract. Suppose Alice and Bob are two entities (e.g. agents, organizations, etc.) that wish to negotiate a contract. A contract consists of several clauses, and each party has ce...
Keith B. Frikken, Mikhail J. Atallah