Towards a Unified Approach to (In)Decision: Routing, Games, Circuits, Consensus, and Beyond (2009)
Jaggard, Aaron D., Schapira, Michael, Wright, Rebecca N.
In this paper, we explore a unified treatment of the difficulty of reaching a decision in constrained distributed computing environments in which there is a lack of global coordination or knowledge....
Secure Multiparty Computation of Approximations (Extended Abstract) (2009)
Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J, Rebecca N. Wright
1 Introduction There are an increasing number and variety of real-world applications that collect a massive amount of data and wish to make use of it. For example, massive data sets arise in physical...
Abstract A New Privacy-Preserving Distributed k-Clustering Algorithm (2009)
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Rebecca N. Wright
We present a simple I/O-efficient k-clustering algorithm that was designed with the goal of enabling a privacy-preserving version of the algorithm. Our experiments show that this algorithm produces...
SubScribe: Secure and E cient Data Delivery/Access Services in a Push-Based Environment (2008)
Anindya Datta, Aslihan Celik, Rebecca N. Wright, Alexandros Biliris
\Push " technology (also referred to as broadcast or multicast technology) is gaining rapid acceptance as one of the most important enabling technologies for large scale information...
Abstract The Q Key Management (2008)
Michael K. Reiter, Matthew K. Franklin, John B. Lacy, Rebecca N. Wright
In this paper we i.ntroduce R, a distributed public key management service for open networks. f’l offers interfaces by which clients can register, retrieve, and revoke public keys, and escrow, use...
Secure Multiparty Computation of Approximations (Extended Abstract) (2008)
Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J, Rebecca N. Wright
1 Introduction There are an increasing number and variety of real-world applications that collect a massive amount of data and wish to make use of it. For example, massive data sets arise in physical...
Abstract A New Privacy-Preserving Distributed k-Clustering Algorithm (2008)
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Rebecca N. Wright
We present a simple I/O-efficient k-clustering algorithm that was designed with the goal of enabling a privacy-preserving version of the algorithm. Our experiments show that this algorithm produces...
Privacy-preserving computation of Bayesian networks on vertically partitioned data (2008)
Zhiqiang Yang, Rebecca N. Wright
Abstract—Traditionally, many data mining techniques have been designed in the centralized model in which all data is collected and available in one central site. However, as more and more...
Joan Feigenbaum, Martin J. Strauss, Rebecca N. Wright
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct...
ÔÖ�Ú � Ý ÔÖ�×�ÖÚ�Ò � ��Ø � Ñ�Ò�Ò � Ñ�Ø�Ó� × ÔÖÓÚ�� � �ÓÓ � ÔÖ� (2008)
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright
ÈÖÓØ � Ø�ÓÒ Ó � ÔÖ�Ú � Ý �� × � � ÓÑ � �Ò �ÑÔÓÖØ�ÒØ ÔÖÓ�Ð�Ñ �Ò ��Ø � Ñ�Ò�Ò � ÁÒ Ô�ÖØ � ÙÐ�Ö...
Distributed Data Mining Protocols for Privacy: A Review of Some Recent Results ⋆ (2008)
Rebecca N. Wright, Zhiqiang Yang, Sheng Zhong
Abstract. With the rapid advance of the Internet, a large amount of sensitive data is collected, stored, and processed by different parties. Data mining is a powerful tool that can extract knowledge...
Privacy-Preserving Queries on Encrypted Data ⋆ (2008)
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright
Abstract. Data confidentiality is a major concern in database systems. Encryption is a useful tool for protecting the confidentiality of sensitive data. However, when data is encrypted, performing...
Towards Privacy-Preserving Model Selection ⋆ (2008)
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright
Abstract. Model selection is an important problem in statistics, machine learning, and data mining. In this paper, we investigate the problem of enabling multiple parties to perform model selection...
Privacy-preserving computation of Bayesian networks on vertically partitioned data (2008)
Zhiqiang Yang, Rebecca N. Wright
Traditionally, many data mining techniques have been designed in the centralized model, in which all data is collected and available in one central site. However, as more and more activities are...
Abstract FINITE-STATE APPROXIMATION OF PHRASE STRUCTURE GRAMMARS (2008)
Phrase-structure grammars are an effective rep-resentation for important syntactic and semantic aspects of natural languages, but are computa-tionally too demanding for use as language mod-els in...
Abstract A New Privacy-Preserving Distributed k-Clustering Algorithm (2008)
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Rebecca N. Wright
We present a simple I/O-efficient k-clustering algorithm that was designed with the goal of enabling a privacy-preserving version of the algorithm. Our experiments show that this algorithm produces...
Secure Set Membership Using 3Sat ∗ (Extended Abstract) (2008)
Michael Mare, Rebecca N. Wright
A wide variety of powerful cryptographic tools have been built using RSA, Diffie-Hellman, and other similar assumptions as their basis. Computational security has been achieved relative to complexity...
O#-line generation of limited-use credit card numbers (Extended Abstract) (2007)
Aviel D. Rubin, Rebecca N. Wright
Abstract. Recently, some credit card companies have started to o#er limited-use credit card numbers---for example, American Express's single-use card numbers and Visa's gift cards. Such...
Lorenzo Alvisi, Dahlia Malkhi, Evelyn Pierce, Michael K. Reiter, Rebecca N. Wright
Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation of Byzantine quorum...
Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Rebecca N. Wright
Abstract. Approximation algorithms can sometimes provide e#cient solutions when no e#cient exact computation is known. In particular, approximations are often useful in a distributed setting where...
Ran Canetti, Yuval Ishai, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright
Motivated by the application of private statistical analysis of large databases, we consider the problem of selective private function evaluation (SPFE). In this problem, a client interacts with one...
Abstract FINITE-STATE APPROXIMATION OF PHRASE STRUCTURE GRAMMARS (2007)
Phrase-structure grammars are an effective rep-resentation for important syntactic and semantic aspects of natural languages, but are computa-tionally too demanding for use as language mod-els in...
Secure Multiparty Computation of Approximations (Extended Abstract) (2007)
Joan Feigenbaum, Tal Malkin, Kobbi Nissim, Martin J, Rebecca N. Wright
Abstract. Approximation algorithms can sometimes provide efficient solutions when no efficient exact computation is known. In particular, approximations are often useful in a distributed setting...
Dahlia Malkhi, Michael K. Reiter, Rebecca N. Wright
reiter@research.bell-labs.com. Work done while at AT&T Labs|Research.
Ran Canetti, Yuval Ishai, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright
Motivated by the application of private statistical analysis of large databases, we consider the problem of selective private function evaluation (SPFE). In this problem, a client interacts with one...
Obstacles to Freedom and Privacy by Design (2007)
Abstract: In this note, we describe some obstacles to designing technology that inherently protects civil liberties. We also suggest ways to overcome these obstacles. Technology that inherently...
Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J, Rebecca N. Wright
Abstract. Approximation algorithms can sometimes provide e#cient solutions when no e#cient exact computation is known. In particular, approximations are often useful in a distributed setting where...
Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J, Rebecca N. Wright
Abstract. Approximation algorithms can sometimes provide efficient solutions when no efficient exact computation is known. In particular, approximations are often useful in a distributed setting...
Private multiparty sampling and approximation of vector combinations (2007)
Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright
Abstract. We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties want to...
Zhiqiang Yang, Rebecca N. Wright
1 Introduction Data mining provides the power to discover valuable patterns and trends from vast amount of data, and is playing an important role in knowledge discovery. Traditional data mining...
Tight bounds for shared memory systems accessed by Byzantine processes (2005)
Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright
Summary. We provide efficient constructions and tight bounds for shared memory systems accessed by n processes, up to t of which may exhibit Byzantine failures, in a model previously explored by...
Privacy-Preserving Classification of Customer Data without Loss of Accuracy (2005)
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright
Privacy has become an increasingly important issue in data mining. In this paper, we consider a scenario in which a data miner surveys a large number of customers to learn classification rules on...
Anonymity-preserving data collection (2005)
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright
Protection of privacy has become an important problem in data mining. In particular, individuals have become increasingly unwilling to share their data, frequently resulting in individuals either...
Anonymity-preserving data collection (2005)
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright
Protection of privacy has become an important problem in data mining. In particular, individuals have become increasingly unwilling to share their data, frequently resulting in individuals either...
Tight bounds for shared memory systems accessed by Byzantine processes (2005)
Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright
We provide efficient constructions and tight bounds for shared memory systems accessed by n processes, up to t of which may exhibit Byzantine failures, in a model previously explored by Malkhi et al....
Experimental Analysis of Privacy-Preserving Statistics Computation (2004)
Zhiqiang Yang, Rebecca N. Wright, Hiranmayee Subramaniam
The recent investigation of privacy-preserving data mining has been motivated by the growing concern about the privacy of individuals when their data is stored, aggregated, and mined for information....
Experimental analysis of privacy-preserving statistics computation (2004)
Hiranmayee Subramaniam, Rebecca N. Wright, Zhiqiang Yang
Abstract. The recent investigation of privacy-preserving data mining and other kinds of privacy-preserving distributed computation has been motivated by the growing concern about the privacy of...
Privacy-enabled Management, Customer Data, Günter Karjoth, Matthias Schunter, Michael Waidner, Dan Boneh, ...
is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and application of database systems and their technology. Letters,...
Secure multiparty computation of approximations (2001)
Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright
Abstract. Approximation algorithms can sometimes be used to obtain efficient solutions where no efficient exact computation is known. In particular, approximations are often useful in a distributed...
Rebecca N., “Off-line generation of limited-use credit card numbers (2001)
Aviel D. Rubin, Rebecca N. Wright
numbers
Depender Graphs: A Method of Fault-Tolerant Certificate Distribution (2001)
Rebecca N. Wright, Patrick D. Lincoln, Jonathan Millen
We consider scalable certi cate revocation in a public-key infrastructure (PKI).
Dynamic Byzantine Quorum Systems (2000)
Lorenzo Alvisi, Dahlia Malkhi, Evelyn Pierce, Michael K. Reiter, Rebecca N. Wright
Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation of Byzantine quorum...
Reasoning about Trust and Insurance in a Public Key Infrastructure (2000)
Jonathan K. Millen, Rebecca N. Wright
In the real world, insurance is used to mitigate financial risk to individuals in many settings. Similarly, it has been suggested that insurance can be used in distributed systems, and in particular,...
Dynamic Byzantine Quorum Systems (2000)
Lorenzo Alvisi, Dahlia Malkhi, Evelyn Pierce, Michael K. Reiter, Rebecca N. Wright
Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation, however, is their...
Efficient Fault-Tolerant Certificate Revocation (2000)
Rebecca N. Wright, Patrick D. Lincoln, Jonathan K. Millen, Andrea I. Lincoln
We consider scalable certicate revocation in a public-key infrastructure. We introduce depender graphs, a new class of graphs which support ecient and fault-tolerant revocation. Nodes of a depender...
Reasoning about Trust and Insurance in a Public Key Infrastructure (2000)
Jonathan K. Millen, Rebecca N. Wright
In the real world, insurance is used to mitigate financial risk to individuals in many settings. Similarly, it has been suggested that insurance can be used in distributed systems, and in particular,...
Certificate Revocation the Responsible Way (1999)
Jonathan K. Millen, Rebecca N. Wright
Public-key certificates are managed by a combination of the informal web of trust and the use of servers maintained by organizations. Prompt and reliable distribution of revocation notices is an...
Secure Communication in Minimal Connectivity Models (1999)
Matthew Franklin, Rebecca N. Wright
Problems of secure communication and computation have been studied extensively in network models. In this work, we ask what is possible in the information-theoretic setting when the adversary is very...
Influencing Software Usage (1998)
Cranor, Lorrie Faith, Wright, Rebecca N.
Technology designers often strive to design systems that are flexible enough to be used in a wide range of situations. Software engineers, in particular, are trained to seek general solutions to...
Secure communication in minimal connectivity models (1998)
Matthew Franklin, Rebecca N. Wright
Abstract. Problems of secure communication and computation have been studied extensively in network models. In this work, we ask what is possible in the information-theoretic setting when the...
Secure communication in minimal connectivity models (1998)
Matthew Franklin, Rebecca N. Wright
Abstract. Problems of secure communication and computation have been studied extensively in network models. In this work, we ask what is possible in the information-theoretic setting when the...
SubScribe: Secure and Efficient Data Delivery/Access Services in a Push-Based Environment (1998)
Anindya Datta, Aslihan Celik, Rebecca N. Wright, Alexandros Biliris
"Push" technology (also referred to as broadcast or multicast technology) is gaining rapid acceptance as one of the most important enabling technologies for large scale information...
Probabilistic Byzantine Quorum Systems (1998)
Dahlia Malkhi, Michael Reiter, Avishai Wool, Rebecca N. Wright
In this paper we present probabilistic masking quorum systems, a technique for replicating data that can mask, with high probability, the arbitrary (Byzantine) failure of data servers from clients....
Probabilistic Byzantine Quorum Systems (1998)
Dahlia Malkhi Michael, Michael Reiter, Rebecca N. Wright
In this paper we present probabilistic masking quorum systems, a technique for replicating data that can mask, with high probability, the arbitrary (Byzantine) failure of data servers from clients....
Secure Communication in Minimal Connectivity Models (1998)
Matthew Franklin, Rebecca N. Wright
Problems of secure communication and computation have been studied extensively in network models. In this work, we ask what is possible in the information-theoretic setting when the adversary is very...
Experimental Performance of Shared RSA Modulus Generation (Preliminary Report) (1998)
Sara Spalding, Rebecca N. Wright
Many distributed protocols require the participants to have secret shares of an RSA modulus in order to perform distributed cryptographic computations. Until recently, a trusted party was required to...
Finite-State Approximation of Phrase-Structure Grammars (1996)
Pereira, Fernando C. N., Wright, Rebecca N.
Phrase-structure grammars are effective models for important syntactic and semantic aspects of natural languages, but can be computationally too demanding for use as language models in real-time...
An Authentication Logic Supporting Synchronization, Revocation, and Recency (1996)
Stuart Stubblebine, Rebecca N. Wright
Distributed systems inherently involve dynamic changes to the value of security attributes such as the goodness of encryption keys. Since concurrent knowledge is usually infeasible or impractical, it...
The\Omega Key Management Service (1996)
Michael K. Reiter, Matthew K. Franklin, John B. Lacy, Rebecca N. Wright
In this paper we introduce \Omega\Gamma a distributed public key management service for open networks.\Omega offers interfaces by which clients can register, retrieve, and revoke public keys, and...
Bounds on Secret Key Exchange Using a Random Deal of Cards (1996)
Michael J. Fischer, Rebecca N. Wright
We present a general model for communication among a "team" of players overheard by a passive eavesdropper, Eve, in which all players including Eve are given private inputs that may be...
An Authentication Logic Supporting Synchronization, Revocation, and Recency (1996)
Stuart G. Stubblebine, Rebecca N. Wright
Distributed systems inherently involve dynamic changes to the value of security attributes such as the goodness of encryption keys. Since concurrent knowledge is usually infeasible or impractical, it...
An Application of Game-Theoretic Techniques to Cryptography (1993)
Michael J. Fischer, Rebecca N. Wright
This paper provides an application of game theoretic techniques to the analysis of a class of multiparty cryptographic protocols for secret bit exchange. 1
An Application of Game-Theoretic Techniques to Cryptography (1993)
Michael J. Fischer, Rebecca N. Wright
This paper provides an application of game theoretic techniques to the analysis of a class of multiparty cryptographic protocols for secret bit exchange. 1
An Efficient Protocol for Unconditionally Secure Secret Key Exchange (1993)
Michael J. Fischer, Rebecca N. Wright
The multiparty secret key exchange problem is to find a k-player protocol for generating an n-bit random key. At the end of the protocol, the key should be known to each player but remain completely...
Cryptographic protection of databases and software (1991)
Joan Feigenbaum, Mark Y. Liberman, Rebecca N. Wright
We describe experimental work on cryptographic protection of databases and software. The database in our experiment is a natural language dictionary of over 4000 Spanish verbs. Our tentative...
Multiparty Secret Key Exchange Using a Random Deal of Cards (1991)
Michael J. Fischer, Rebecca N. Wright
We consider the problem of multiparty secret key exchange. A "team " of players P1 through Pk wishes to determine an n-bit secret key in the presence of a computationally unlimited...