A randomized protocol for signing contracts
Communications of the ACM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Security-control methods for statistical databases: a comparative study
ACM Computing Surveys (CSUR)
Journal of Cryptology
Hiding instances in multioracle queries
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
A minimal model for secure computation (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computationally private information retrieval (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Protecting data privacy in private information retrieval schemes
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Improved upper bounds on information-theoretic private information retrieval (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Communication preserving protocols for secure function evaluation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Cryptography and data security
Cryptography and data security
Upper Bound on Communication Complexity of Private Information Retrieval
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Private Simultaneous Messages Protocols with Applications
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Verifiable secret-ballot elections
Verifiable secret-ballot elections
ACM SIGACT News - A special issue on cryptography
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A practical approach to solve Secure Multi-party Computation problems
Proceedings of the 2002 workshop on New security paradigms
Batch codes and their applications
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Privacy-preserving Bayesian network structure computation on distributed heterogeneous data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Cardinality-based inference control in OLAP systems: an information theoretic approach
Proceedings of the 7th ACM international workshop on Data warehousing and OLAP
Distributed oblivious function evaluation and its applications
Journal of Computer Science and Technology
Policy-hiding access control in open environment
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Privacy-Preserving Computation of Bayesian Networks on Vertically Partitioned Data
IEEE Transactions on Knowledge and Data Engineering
Secure multiparty computation of approximations
ACM Transactions on Algorithms (TALG)
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Privacy-preserving remote diagnostics
Proceedings of the 14th ACM conference on Computer and communications security
Guided perturbation: towards private and accurate mining
The VLDB Journal — The International Journal on Very Large Data Bases
Constructions of truly practical secure protocols using standardsmartcards
Proceedings of the 15th ACM conference on Computer and communications security
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Another Look at Extended Private Information Retrieval Protocols
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Practical Private DNA String Searching and Matching through Efficient Oblivious Automata Evaluation
Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
Securely outsourcing linear algebra computations
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Bureaucratic protocols for secure two-party sorting, selection, and permuting
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Some applications of polynomials for the design of cryptographic protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Extended private information retrieval and its application in biometrics authentications
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Towards privacy-preserving model selection
PinKDD'07 Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD
Private predictions on hidden Markov models
Artificial Intelligence Review
First CPIR protocol with data-dependent computation
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part I
Distributed data mining protocols for privacy: a review of some recent results
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Constant-Round private function evaluation with linear complexity
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 0.00 |
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 or more servers holding copies of a database x = x1, … , xn in order to compute f(xi1, … , xim), for some function f and indices i = i1, … , im chosen by the client. Ideally, the client must learn nothing more about the database than f(xi, … , xim), and the servers should learn nothing.Generic solutions for this problem, based on standard techniques for secure function evaluation, incur communication complexity that is at least linear in n, making them prohibitive for large databases even when f in relatively simple and m is small. We present various approaches for constructing sublinear-communication SPFE protocols, both for the general problem and for special cases of interest. Our solutions not only offer sublinear communication complexity, but are also practical in many scenarios.