Items related to Uses of Randomness in Algorithms and Protocols (Acm...
Synopsis
Uses of Randomness in Algorithms and Protocols makes fundamental contributions to two different fields of complexity theory: computational number theory and cryptography. The most famous result is Goldwasser and Kilian's invention of a new approach to distinguish prime numbers from composites, using methods from the theory of elliptic curves over finite fields.
The Goldwasser-Kilian algorithm is the first to yield a polynomial size proof of its assertions, ensuring correctness while still provably running fast on most inputs. This new primality test implies for the first time and without any assumptions that large certified primes can be generated in expected polynomial time under a distribution that is close to uniform. It provides a provocative new link between algebraic geometry and primality testing, one of the most ancient algorithmic problems in number theory. Heuristic implementations of the algorithm are currently considered to be the fastest existing methods to certify primes.
Kilian also provides two elegant and original contributions to theoretical cryptography. He shows how to base general two-party protocols on a simple protocol, known as "oblivious transfer," proving the first completeness result of this kind. He also introduces a generalization of interactive proof systems, known as "multi-prover interactive proof systems," and shows that anything provable in this model is provable in zero knowledge.
Joe Kilian is a National Science Foundation Postdoctoral Fellow at MIT and Harvard.
Contents: Introduction. New Techniques in Primality Testing. Committing Bits Using Oblivious Transfer. Circuit Evaluation Using Oblivious Transfer: The NC1 Circuit Base. Oblivious
Evaluation of Arbitrary Circuits. Interactive Proof Systems with Multiple Provers.
"synopsis" may belong to another edition of this title.
- PublisherMit Pr
- Publication date1990
- ISBN 10 0262111535
- ISBN 13 9780262111539
- BindingHardcover
- LanguageEnglish
- Number of pages260
Search results for Uses of Randomness in Algorithms and Protocols (Acm...
Stock Image
Uses of Randomness in Algorithms and Protocols
Seller: Ammareal, Morangis, France
Seller rating 5 out of 5 stars
Hardcover. Condition: Bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Couverture différente. Edition 1990. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Slight signs of wear on the cover. Different cover. Edition 1990. Ammareal gives back up to 15% of this item's net price to charity organizations. Seller Inventory # E-867-816
Quantity: 1 available
Stock Image
Uses of Randomness in Algorithms and Protocols
Seller: Ammareal, Morangis, France
Seller rating 5 out of 5 stars
Hardcover. Condition: Très bon. Ancien livre de bibliothèque. Couverture différente. Edition 1990. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Different cover. Edition 1990. Ammareal gives back up to 15% of this item's net price to charity organizations. Seller Inventory # E-554-891
Quantity: 1 available
Stock Image
Uses of Randomness in Algorithms and Protocols (Acm Distinguished Dissertations, 1989)
Seller: NEPO UG, Rüsselsheim am Main, Germany
Seller rating 5 out of 5 stars
Gebundene Ausgabe. Condition: Sehr gut. 260 Seiten ex Library Book / aus einer wissenschaftlichen Bibliothek Sprache: Englisch Gewicht in Gramm: 969. Seller Inventory # 285885
Quantity: 1 available
Stock Image
Uses of Randomness in Algorithms and Protocols (ACM Distinguished Dissertation)
Seller: dsmbooks, Liverpool, United Kingdom
Seller rating 4 out of 5 stars
hardcover. Condition: Good. Good. book. Seller Inventory # D8S0-3-M-0262111535-5
Quantity: 1 available