Secure two-party k-means clustering
Proceedings of the 14th ACM conference on Computer and communications security
Error-Tolerant Combiners for Oblivious Primitives
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Zero-Knowledge Proofs with Witness Elimination
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Another Look at Extended Private Information Retrieval Protocols
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
A Highly Scalable RFID Authentication Protocol
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Client-Server Password Recovery
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part II
Extended private information retrieval and its application in biometrics authentications
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Secure function evaluation based on secret sharing and homomorphic encryption
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Anonymous biometric access control
EURASIP Journal on Information Security - Special issue on enhancing privacy protection in multimedia systems
(If) size matters: size-hiding private set intersection
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Near-optimal private approximation protocols via a black box transformation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Secure efficient multiparty computing of multivariate polynomials and applications
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
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
On constructing homomorphic encryption schemes from coding theory
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Fast computation on encrypted polynomials and applications
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Shift-type homomorphic encryption and its application to fully homomorphic encryption
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Accelerating the secure distributed computation of the mean by a chebyshev expansion
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Experimenting with fast private set intersection
TRUST'12 Proceedings of the 5th international conference on Trust and Trustworthy Computing
Enhancing the efficiency in privacy preserving learning of decision trees in partitioned databases
PSD'12 Proceedings of the 2012 international conference on Privacy in Statistical Databases
Group homomorphic encryption: characterizations, impossibility results, and applications
Designs, Codes and Cryptography
| Hi-index | 0.00 |
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value $\alpha$. At the end of the protocol the receiver learns $P(\alpha)$ and the sender learns nothing. We describe efficient constructions for this protocol, which are based on new intractability assumptions that are closely related to noisy polynomial reconstruction. Oblivious polynomial evaluation can be used as a primitive in many applications. We describe several such applications, including protocols for private comparison of data, for mutually authenticated key exchange based on (possibly weak) passwords, and for anonymous coupons.