Download:
|
by Wenliang Du, Mikhail J. Atallah
In New Security Paradigms Workshop
http://www.cis.syr.edu/~wedu/Research/paper/nspw2001.ps
Add To MetaCart
Abstract:
The growth of the Internet has triggered tremendous opportunities for cooperative computation, where people are jointly conducting computation tasks based on the private inputs they each supplies. These computations could occur between mutually untrusted parties, or even between competitors. For example, customers might send to a remote database queries that contain private information; two competing financial organizations might jointly invest in a project that must satisfy both organizations ' private and valuable constraints, and so on. Today, to conduct such computations, one entity must usually know the inputs from all the participants; however if nobody can be trusted enough to know all the inputs, privacy will become a primary concern. This problem is referred to as Secure Multi-party Computation Problem (SMC) in the literature. Research in the SMC area has been focusing on only a limited set of specific SMC problems, while privacy concerned cooperative computations call for SMC studies in a variety of computation domains. Before we can study the problems, we need to identify and define the specific SMC problems for those computation domains. We have developed a frame-
Citations
|
1025
|
How to Share a Secret
– Shamir
- 1979
|
|
517
|
Applied Cryptography: Protocols, Algorithms and Source Code in C
– Schneier
- 1996
|
|
353
|
A.: “A randomized protocol for signing contracts
– Even, Goldreich, et al.
- 1985
|
|
341
|
Privacy-Preserving Data Mining
– Agrawal, Srikant
- 2000
|
|
311
|
Text Algorithms
– Crochemore, Rytter
- 1994
|
|
272
|
Protocols for secure computations
– Yao
- 1982
|
|
270
|
How to play ANY mental game
– Goldreich, Micali, et al.
- 1987
|
|
233
|
Computationally Private Information Retrieval
– Chor
|
|
220
|
Fundamentals of digital image processing
– JAIN
- 1989
|
|
217
|
O.: “How to exchange secrets by oblivious transfer
– Rabin
- 1981
|
|
189
|
Privacy Preserving Data Mining
– Lindell, Pinkas
|
|
149
|
Computationally private information retrieval with polylogarithmic communication
– Cachin, Micali, et al.
- 1999
|
|
119
|
Replication is not needed: Single database, computationally private information retrieval
– Kushilevitz, Ostrovsky
|
|
86
|
Secure multi-party computation (working draft). Available from http:Hwww.wisdom.weizmann.ac.il/home/oded/public html/foc.html
– Goldreich
- 1998
|
|
84
|
Protecting data privacy in private information retrieval schemes
– Gertner, Ishai, et al.
|
|
71
|
J.-M.: “All-or-nothing disclosure of secrets
– Brassard, Crépeau, et al.
- 1986
|
|
68
|
Collective data mining: a new perspective toward distributed data mining
– Kargupta, Park, et al.
- 1999
|
|
65
|
Efficient private bidding and auctions with an oblivious third party
– Cachin
|
|
47
|
Multi-party computations: past and present
– Goldwasser
- 1997
|
|
47
|
A random server model for private information retrieval
– Gertner, Goldwasser, et al.
- 1998
|
|
35
|
Pattern Matching Algorithms
– Apostolico, Galil
- 1997
|
|
33
|
Universal service-providers for database private information retrieval
– Crescenzo, Ishai, et al.
- 1998
|
|
29
|
Some recent research aspects of threshold cryptography
– Desmedt
- 1997
|
|
25
|
An Introduction to Threshold Cryptography
– Gemmell
- 1997
|
|
25
|
Improved upper bounds on information-theoretic private information retrieval (extended abstract
– Ishai, Kushilevitz
|
|
22
|
Protocols for secure remote database access with approximate matching
– Du, Atallah
|
|
19
|
Privacy-Preserving Cooperative Scientific Computations
– Du, Atallah
|
|
18
|
Privacy-preserving statistical analysis
– Du, Atallah
|
|
11
|
Transaction-based pseudonyms in audit data for privacy respecting intrusion detection
– Biskup, Flegel
- 2000
|
|
9
|
On pseudonymization of audit data for intrusion detection
– Biskup, Flegel
- 2000
|
|
7
|
Oblivious transfer and polynomial evaluation (extended abstract
– Naor, Pinkas
- 1999
|
|
6
|
and Wenliang Du. Secure multi-party computational geometry
– Atallah
- 1992
|
|
1
|
Goodstadt and V.Gruson. The randomized response technique: A test on drug use
– S
- 1975
|
|
1
|
A comparison of three randomized response models for quantitative data
– Pollock, Bek
- 1976
|
|
1
|
Randomized response: A surey technique for eliminating evasive answer bias
– Warner
- 1971
|
