Results 1  10
of
5,765
Calibrating noise to sensitivity in private data analysis
 In Proceedings of the 3rd Theory of Cryptography Conference
, 2006
"... Abstract. We continue a line of research initiated in [10, 11] on privacypreserving statistical databases. Consider a trusted server that holds a database of sensitive information. Given a query function f mapping databases to reals, the socalled true answer is the result of applying f to the datab ..."
Abstract

Cited by 649 (60 self)
 Add to MetaCart
obtain separation results showing the increased value of interactive sanitization mechanisms over noninteractive. 1 Introduction We continue a line of research initiated in [10, 11] on privacy in statistical databases. A statistic is a quantity computed from a sample. Intuitively, if the database is a
On private computation in incomplete networks
 Distributed Computing
"... Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious – after the protocol terminates each party tries to learn information from the communication it heard. We say that a fun ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
function can be computed privately in a network if there is a protocol in which each processor learns only the information implied by its input and the output of the function (in the information theoretic sense). The question we address in this paper is what functions can be privately computed in a given
Reducibility and Completeness In Private Computations
 SIAM J. Comput
"... We define the notions of reducibility and completeness in (two party and multiparty) private computations. Let g be an nargument function. We say that a function f is reducible to a function g if n honestbutcurious players can compute the function f nprivately, given a blackbox for g (for whi ..."
Abstract

Cited by 27 (7 self)
 Add to MetaCart
We define the notions of reducibility and completeness in (two party and multiparty) private computations. Let g be an nargument function. We say that a function f is reducible to a function g if n honestbutcurious players can compute the function f nprivately, given a blackbox for g (for
Private Computations Over the Integers
, 1995
"... The subject of this work is the possibility of private distributed computations of n argument functions defined over the integers. A function f is tprivate if there exists a protocol for computing f , so that no coalition of at most t participants can infer any additional information from the exe ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
The subject of this work is the possibility of private distributed computations of n argument functions defined over the integers. A function f is tprivate if there exists a protocol for computing f , so that no coalition of at most t participants can infer any additional information from
On Private Computation in Incomplete
"... 1 Introduction The question of private computation of functions on communication networks isa fundamental question. For example, we would like to compute the output of an electronic election without revealing the votes of individuals. The general scenario we consider is that some parties are connec ..."
Abstract
 Add to MetaCart
1 Introduction The question of private computation of functions on communication networks isa fundamental question. For example, we would like to compute the output of an electronic election without revealing the votes of individuals. The general scenario we consider is that some parties
Fast and private computation of cardinality of . . .
"... With massive amounts of electronic information stored, transferred, and shared every day, legitimate needs for sensitive information must be reconciled with natural privacy concerns. This motivates various cryptographic techniques for privacypreserving information sharing, such as Private Set Int ..."
Abstract
 Add to MetaCart
Intersection (PSI) and Private Set Union (PSU). Such techniques involve two parties – client and server – each with a private input set. At the end, client learns the intersection (or union) of the two respective sets, while server learns nothing. However, if desired functionality is private computation
Randomness in Private Computations
 Proc. of 15th PODC
, 1996
"... We consider the amount of randomness used in private computations. Specifically, we show how to compute the exclusiveor (xor) of n boolean inputs tprivately, using only O(t 2 log(n=t)) random bits (the best known upper bound is O(tn)). We accompany this result by a lower bound on the number of ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We consider the amount of randomness used in private computations. Specifically, we show how to compute the exclusiveor (xor) of n boolean inputs tprivately, using only O(t 2 log(n=t)) random bits (the best known upper bound is O(tn)). We accompany this result by a lower bound on the number
Virtual Private Computing
, 1999
"... There is still no widely accepted system to exploit the capabilities offered by the tremendously grown number of computers connected to the Internet or to large intranets. Missing abstractions as well as deficiencies of software development prevent the effective use of more than two computers by sta ..."
Abstract
 Add to MetaCart
by standard applications. The architecture that is presented in this report overcomes these problems by creating a vision of a Virtual Private Computer, which combines all participating machines and presents them as a large, omnipresent computer. Beside several services that are essential to realize
Virtual Private Computing
"... There is still no widely accepted system to exploit the capabilities offered by the tremendously grown number of computers connected to the Internet or to large intranets. Missing abstractions as well as deficiencies of software development prevent the effective use of more than two computers by sta ..."
Abstract
 Add to MetaCart
by standard applications. The architecture that is presented in this report overcomes these problems by creating a vision of a Virtual Private Computer, which combines all participating machines and presents them as a large, omnipresent computer. Beside several services that are essential to realize
Timing Attacks on Implementations of DiffieHellman, RSA, DSS, and Other Systems
, 1996
"... By carefully measuring the amount of time required to perform private key operations, attackers may be able to find fixed DiffieHellman exponents, factor RSA keys, and break other cryptosystems. Against a vulnerable system, the attack is computationally inexpensive and often requires only known cip ..."
Abstract

Cited by 651 (3 self)
 Add to MetaCart
By carefully measuring the amount of time required to perform private key operations, attackers may be able to find fixed DiffieHellman exponents, factor RSA keys, and break other cryptosystems. Against a vulnerable system, the attack is computationally inexpensive and often requires only known
Results 1  10
of
5,765