A randomized protocol for signing contracts
Communications of the ACM
Asymptotic theory of finite dimensional normed spaces
Asymptotic theory of finite dimensional normed spaces
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth 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
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A technique for measuring the relative size and overlap of public Web search engines
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Private approximation of NP-hard functions
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Communication preserving protocols for secure function evaluation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Universally composable two-party and multi-party secure computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
One-Round Secure Computation and Secure Autonomous Mobile Agents
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Secure Multiparty Computation of Approximations
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Privacy Preserving Data Mining
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Verifiable secret-ballot elections
Verifiable secret-ballot elections
High-dimensional computational geometry
High-dimensional computational geometry
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
One-way functions are essential for complexity based cryptography
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
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
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
On private scalar product computation for privacy-preserving data mining
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Private approximation of search problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Secure multiparty computation of approximations
ACM Transactions on Algorithms (TALG)
Sketching in adversarial environments
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Private queries in location based services: anonymizers are not necessary
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Private multiparty sampling and approximation of vector combinations
Theoretical Computer Science
Secure Hamming Distance Based Computation and Its Applications
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
PAD: privacy-area aware, dummy-based location privacy in mobile services
Proceedings of the Seventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Private approximation of clustering and vertex cover
TCC'07 Proceedings of the 4th conference on Theory of cryptography
How should we solve search problems privately?
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Location privacy in geospatial decision-making
DNIS'07 Proceedings of the 5th international conference on Databases in networked information systems
Blind evaluation of nearest neighbor queries using space transformation to preserve location privacy
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
PinKDD'07 Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD
Towards privacy-preserving model selection
PinKDD'07 Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD
Fast private norm estimation and heavy hitters
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Fast Manhattan sketches in data streams
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Differentially private combinatorial optimization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A taxonomy of approaches to preserve location privacy in location-based services
International Journal of Computational Science and Engineering
Efficient fuzzy matching and intersection on private datasets
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
Design and analysis of a ranking approach to private location-based services
ACM Transactions on Database Systems (TODS)
Near-optimal private approximation protocols via a black box transformation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Location privacy protection in the presence of users' preferences
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Efficient protocols for privacy preserving matching against distributed datasets
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Private multiparty sampling and approximation of vector combinations
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
International Journal of Applied Cryptography
Secure outsourced computation of iris matching
Journal of Computer Security
| Hi-index | 0.00 |
In [12] a private approximation of a function f is defined to be another function F that approximates f in the usual sense, but does not reveal any information about x other than what can be deduced from f(x). We give the first two-party private approximation of the l2 distance with polylogarithmic communication. This, in particular, resolves the main open question of [12]. We then look at the private near neighbor problem in which Alice has a query point in {0,1}d and Bob a set of n points in {0,1}d, and Alice should privately learn the point closest to her query. We improve upon existing protocols, resolving open questions of [13,10]. Then, we relax the problem by defining the private approximate near neighbor problem, which requires introducing a notion of secure computation of approximations for functions that return sets of points rather than values. For this problem we give several protocols with sublinear communication.