Some applications of polynomials for the design of cryptographic protocols

Authors:
Eyal Kushilevitz
Affiliations:
Computer Science Department, Technion, Israel
Venue:
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Year:
2002

Citing 30
Cited 0

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
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
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Verifiable secret sharing and multiparty protocols with honest majority

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The round complexity of secure protocols

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A minimal model for secure computation (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Private information storage (extended abstract)

STOC '97 Proceedings of the twenty-ninth 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
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Private information retrieval

Journal of the ACM (JACM)
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
On the efficiency of local decoding procedures for error-correcting codes

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Protecting data privacy in private information retrieval schemes

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
How to share a secret

Communications of the ACM
A high security log-in procedure

Communications of the ACM
Communication preserving protocols for secure function evaluation

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Selective private function evaluation with applications to private statistics

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Upper Bound on Communication Complexity of Private Information Retrieval

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On 2-Round Secure Multiparty Computation

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Perfectly-Secure Key Distribution for Dynamic Conferences

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Replication is not needed: single database, computationally-private information retrieval

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Randomizing polynomials: A new representation with applications to round-efficient secure computation

FOCS '00 Proceedings of the 41st 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)
How to generate and exchange secrets

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper surveys some recent work on applications of polynomials (over finite fields) to the design of various cryptographic protocols. It is based on a talk given at the 3rd Conference on Security in Communication Networks, 2002.