DOCSLIB.ORG

Ieee Emanuel R. Pi0re Award Recipients

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Ieee Emanuel R. Pi0re Award Recipients IEEE EMANUEL R. PIORE AWARD RECIPIENTS 2013 – NO AWARD 2012 - FRED B. SCHNEIDER “For contributions to trustworthy computing Samuel B. Eckert Professor of through novel approaches to security, fault Computer Science, Cornell tolerance and formal methods for concurrent University, and distributed systems.” Ithaca, NY, USA 2011 - SHAFI GOLDWASSER “For pioneering work in laying the Professor, MIT and Weizmann foundations of modern cryptography and its Institute of Science, relation to complexity theory.” Cambridge, MA, USA 2010 – NANCY ANN LYNCH “For contributions of foundations of NEC Professor of Software Science distributed and concurrent computing.” and Engineering Massachusetts Institute of Technology, Dept of EECS, Cambridge, MA, USA 2009 – DAVID J. DEWITT “For fundamental contributions to the John P. Morgridge Professor, architecture, algorithms, and University of Wisconsin, implementation of innovative database Madison, WI, USA systems.” 2008 - RICHARD F. RASHID “For contributions to the design of modern Senior Vice President, Research, operating systems, and for innovation and Microsoft Corporation, leadership in industrial research” Redmond, WA, USA 2007- RANDAL E. BRYANT “For seminal contributions to the field of School of Computer Science, computer-aided circuit design and Carnegie-Mellon University, verification, including the development and Pittsburgh, PA, USA promulgation of ordered binary decision diagrams.” 2006- ROBERT K. BRAYTON “For development of the field of logic Professor, Department of Electrical synthesis from its early inception through Engineering, University of California, industrial maturity.” Berkeley, Berkeley, CA, USA 2005 – JACOB A. ABRAHAM “For contributions to the development of Professor reliable and testable computer hardware University of Texas at Austin, systems.” Austin, TX, USA 1 of 4 IEEE EMANUEL R. PIORE AWARD RECIPIENTS 2004 – LESLIE LAMPORT “For seminal contributions to the theory Senior Researcher, Microsoft and practice of concurrent programming Research, and fault-tolerant computing.” Mountain View, CA, USA 2003 - GIOVANNI DeMICHELI "For contributions to computer-aided Professor, Electrical Engineering synthesis of digital systems." Dept., Stanford University, Stanford, CA, USA 2002 – BRIAN RANDELL "For seminal contributions to and Univ of Newcastle leadership in computer system Newcastle on Tyne, UK dependability research." 2001 - RAVISHANKAR K. IYER "For fundamental contributions to Univ. of Illinois at Urbana- measurement, evaluation, and design of Champaign reliable computing systems." Urbana, IL, USA 2000 - WILLIAM M. (VELVEL) KAHAN "For contributions to numerical analysis University of California at Berkley and standardization of floating-point Berkeley, CA, USA arithmetic." 1999 - NARENDRA AHUJA “For contributions to computer vision and University of Illinois at image processing.” Urbana-Champaign, Urbana, IL 1998 - JANAK H. PATEL "For contributions to test generation and University of Illinois, computer architecture." Urbana, IL, USA 1997 - SHUN-ICHI AMARI "For pioneering contributions and RIKEN leadership in neural networks and Wakou-city, Japan information geometry." 1996 - EDWARD J. McCLUSKEY "For pioneering and fundamental Stanford University contributions to design automation and Stanford, CA, USA fault tolerant computing." 1995 - YALE N. PATT "For contributions to computer architecture University of Michigan leading to commercially viable high Ann Arbor, MI, USA performance microprocessors." 1994 - JOHN L. HENNESSY "For contributions to quantitative Stanford University evaluation of computer architectures and Stanford, CA, USA the successful implementation of Reduced 2 of 4 IEEE EMANUEL R. PIORE AWARD RECIPIENTS Instruction-Set Computer (RISC) architecture." 1993 - MAKOTO NAGAO "For leadership and contributions to natural Kyoto University language processing and computer vision Kyoto, Japan areas." 1992 - HAROLD S. STONE "For fundamental contributions to parallel IBM Corp. computer technology, and to computer Hawthorne, NY, USA science education." 1991 - JOSEPH F. TRAUB "For pioneering research in algorithm Columbia University complexity, iteration theory and New York, NY, USA parallelism, and for leadership in computing education." 1990 - ALLEN NEWELL "For seminal contributions to artificial Carnegie Mellon University intelligence." Pittsburgh, PA, USA 1989 - PETER A. FRANASZEK "For contributions to the theory and IBM Corp. practice of coding for contrained channels Hawthorne, NY, USA in digital recording." 1988 - GRACE M. HOPPER (Deceased) "For pioneering contributions in information Digital Equipment Corp. processing and programming language." Washington, DC, USA 1987 - DAVID J. KUCK "For contributions to optimizing compilers University of Illinois for supercomputers." Urbana, IL, USA 1986 – DAVID C. EVANS "For pioneering work in the development of Evans & Sutherland Computer Corp. interactive computer graphics systems and Salt Lake City, UT, USA contributions to computer science AND education." IVAN E. SUTHERLAND Sutherland, Sproull, & Associates, Inc. Pittsburgh, PA, USA 1985 - AZRIEL ROSENFELD "For fundamental contributions to digital University of Maryland image processing." College Park, MD, USA 1984 - HARVEY GEORGE CRAG0N "For creative contributions and leadership Texas Instruments Inc. in uniting computer architecture with the Dallas, TX, USA inherent capabilities of the integrated 3 of 4 IEEE EMANUEL R. PIORE AWARD RECIPIENTS circuit." 1983 - NIKLAUS WIRTH "For creative contribution to programming Swiss Fed. Inst. of Tech. language and design methodology as Zurich, Switzerland exemplified by his development of the Pascal language." 1982 - KENNETH L. THOMPSON "For the creation and development of an DENNIS M. RITCHIE operating system of high utility, Bell Laboratories availability, and instructive value, as Murray Hill, NJ, USA embodied in UNIX and its related facilities." 1981 - NO AWARD 1980 - LAWRENCE R. RABINER "For their contributions to digital speech Bell Laboratories processing and digital filter design." Murray Hill, NJ, USA AND RONALD W. SCHAFER Georgia Institute of Technology Atlanta, GA, USA 1979 - RICHARD W. HAMMING "For introduction of error correcting codes, U.S. Naval Postgrad. School pioneering work in operating systems and Monterey, CA, USA programming languages, and the advancement of numerical computation." 1978 - J. PRESPER ECKERT, JR. "For the design and construction of JOHN W. MAUCHLY electronic digital computers which Dynatrend, Inc., stimulated the development of the Springhouse, PA, USA computer industry." 1977 - GEORGE ROBERT STIBITZ "For pioneering contributions to the Dartmouth Medical School development of computers, utilizing binary Hanover, NH, USA and floating-point arithmetic, memory indexing, operation from a remote console, and program-controlled computations." 4 of 4 .
Load more

Recommended publications
  • 1 Oral History Interview with Brian Randell January 7, 2021 Via Zoom
    Oral History Interview with Brian Randell January 7, 2021 Via Zoom Conducted by William Aspray Charles Babbage Institute 1 Abstract Brian Randell tells about his upbringing and his work at English Electric, IBM, and Newcastle University. The primary topic of the interview is his work in the history of computing. He discusses his discovery of the Irish computer pioneer Percy Ludgate, the preparation of his edited volume The Origins of Digital Computers, various lectures he has given on the history of computing, his PhD supervision of Martin Campbell-Kelly, the Computer History Museum, his contribution to the second edition of A Computer Perspective, and his involvement in making public the World War 2 Bletchley Park Colossus code- breaking machines, among other topics. This interview is part of a series of interviews on the early history of the history of computing. Keywords: English Electric, IBM, Newcastle University, Bletchley Park, Martin Campbell-Kelly, Computer History Museum, Jim Horning, Gwen Bell, Gordon Bell, Enigma machine, Curta (calculating device), Charles and Ray Eames, I. Bernard Cohen, Charles Babbage, Percy Ludgate. 2 Aspray: This is an interview on the 7th of January 2021 with Brian Randell. The interviewer is William Aspray. We’re doing this interview via Zoom. Brian, could you briefly talk about when and where you were born, a little bit about your growing up and your interests during that time, all the way through your formal education? Randell: Ok. I was born in 1936 in Cardiff, Wales. Went to school, high school, there. In retrospect, one of the things I missed out then was learning or being taught Welsh.
    [Show full text]
  • Reproducibility and Pseudo-Determinism in Log-Space
    Reproducibility and Pseudo-determinism in Log-Space by Ofer Grossman S.B., Massachusetts Institute of Technology (2017) Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Master of Science in Electrical Engineering and Computer Science at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY May 2020 c Massachusetts Institute of Technology 2020. All rights reserved. Author...................................................................... Department of Electrical Engineering and Computer Science May 15, 2020 Certified by.................................................................. Shafi Goldwasser RSA Professor of Electrical Engineering and Computer Science Thesis Supervisor Accepted by................................................................. Leslie A. Kolodziejski Professor of Electrical Engineering and Computer Science Chair, Department Committee on Graduate Students 2 Reproducibility and Pseudo-determinism in Log-Space by Ofer Grossman Submitted to the Department of Electrical Engineering and Computer Science on May 15, 2020, in partial fulfillment of the requirements for the degree of Master of Science in Electrical Engineering and Computer Science Abstract Acuriouspropertyofrandomizedlog-spacesearchalgorithmsisthattheiroutputsareoften longer than their workspace. This leads to the question: how can we reproduce the results of a randomized log space computation without storing the output or randomness verbatim? Running the algorithm again with new
    [Show full text]
  • Fault-Tolerant Distributed Computing in Full-Information Networks
    Fault-Tolerant Distributed Computing in Full-Information Networks Shafi Goldwasser∗ Elan Pavlov Vinod Vaikuntanathan∗ CSAIL, MIT MIT CSAIL, MIT Cambridge MA, USA Cambridge MA, USA Cambridge MA, USA December 15, 2006 Abstract In this paper, we use random-selection protocols in the full-information model to solve classical problems in distributed computing. Our main results are the following: • An O(log n)-round randomized Byzantine Agreement (BA) protocol in a synchronous full-information n network tolerating t < 3+ faulty players (for any constant > 0). As such, our protocol is asymp- totically optimal in terms of fault-tolerance. • An O(1)-round randomized BA protocol in a synchronous full-information network tolerating t = n O( (log n)1.58 ) faulty players. • A compiler that converts any randomized protocol Πin designed to tolerate t fail-stop faults, where the n source of randomness of Πin is an SV-source, into a protocol Πout that tolerates min(t, 3 ) Byzantine ∗ faults. If the round-complexity of Πin is r, that of Πout is O(r log n). Central to our results is the development of a new tool, “audited protocols”. Informally “auditing” is a transformation that converts any protocol that assumes built-in broadcast channels into one that achieves a slightly weaker guarantee, without assuming broadcast channels. We regard this as a tool of independent interest, which could potentially find applications in the design of simple and modular randomized distributed algorithms. ∗Supported by NSF grants CNS-0430450 and CCF0514167. 1 1 Introduction The problem of how n players, some of who may be faulty, can make a common random selection in a set, has received much attention.
    [Show full text]
  • The Roots of Software Engineering*
    THE ROOTS OF SOFTWARE ENGINEERING* Michael S. Mahoney Princeton University (CWI Quarterly 3,4(1990), 325-334) At the International Conference on the History of Computing held in Los Alamos in 1976, R.W. Hamming placed his proposed agenda in the title of his paper: "We Would Know What They Thought When They Did It."1 He pleaded for a history of computing that pursued the contextual development of ideas, rather than merely listing names, dates, and places of "firsts". Moreover, he exhorted historians to go beyond the documents to "informed speculation" about the results of undocumented practice. What people actually did and what they thought they were doing may well not be accurately reflected in what they wrote and what they said they were thinking. His own experience had taught him that. Historians of science recognize in Hamming's point what they learned from Thomas Kuhn's Structure of Scientific Revolutions some time ago, namely that the practice of science and the literature of science do not necessarily coincide. Paradigms (or, if you prefer with Kuhn, disciplinary matrices) direct not so much what scientists say as what they do. Hence, to determine the paradigms of past science historians must watch scientists at work practicing their science. We have to reconstruct what they thought from the evidence of what they did, and that work of reconstruction in the history of science has often involved a certain amount of speculation informed by historians' own experience of science. That is all the more the case in the history of technology, where up to the present century the inventor and engineer have \*-as Derek Price once put it\*- "thought with their fingertips", leaving the record of their thinking in the artefacts they have designed rather than in texts they have written.
    [Show full text]
  • A Decade of Lattice Cryptography
    Full text available at: http://dx.doi.org/10.1561/0400000074 A Decade of Lattice Cryptography Chris Peikert Computer Science and Engineering University of Michigan, United States Boston — Delft Full text available at: http://dx.doi.org/10.1561/0400000074 Foundations and Trends R in Theoretical Computer Science Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 United States Tel. +1-781-985-4510 www.nowpublishers.com [email protected] Outside North America: now Publishers Inc. PO Box 179 2600 AD Delft The Netherlands Tel. +31-6-51115274 The preferred citation for this publication is C. Peikert. A Decade of Lattice Cryptography. Foundations and Trends R in Theoretical Computer Science, vol. 10, no. 4, pp. 283–424, 2014. R This Foundations and Trends issue was typeset in LATEX using a class file designed by Neal Parikh. Printed on acid-free paper. ISBN: 978-1-68083-113-9 c 2016 C. Peikert All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. Photocopying. In the USA: This journal is registered at the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923. Authorization to photocopy items for in- ternal or personal use, or the internal or personal use of specific clients, is granted by now Publishers Inc for users registered with the Copyright Clearance Center (CCC). The ‘services’ for users can be found on the internet at: www.copyright.com For those organizations that have been granted a photocopy license, a separate system of payment has been arranged.
    [Show full text]
  • Communication Complexity (For Algorithm Designers)
    Full text available at: http://dx.doi.org/10.1561/0400000076 Communication Complexity (for Algorithm Designers) Tim Roughgarden Stanford University, USA [email protected] Boston — Delft Full text available at: http://dx.doi.org/10.1561/0400000076 Foundations and Trends R in Theoretical Computer Science Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 United States Tel. +1-781-985-4510 www.nowpublishers.com [email protected] Outside North America: now Publishers Inc. PO Box 179 2600 AD Delft The Netherlands Tel. +31-6-51115274 The preferred citation for this publication is T. Roughgarden. Communication Complexity (for Algorithm Designers). Foundations and Trends R in Theoretical Computer Science, vol. 11, nos. 3-4, pp. 217–404, 2015. R This Foundations and Trends issue was typeset in LATEX using a class file designed by Neal Parikh. Printed on acid-free paper. ISBN: 978-1-68083-115-3 c 2016 T. Roughgarden All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. Photocopying. In the USA: This journal is registered at the Copyright Clearance Cen- ter, Inc., 222 Rosewood Drive, Danvers, MA 01923. Authorization to photocopy items for internal or personal use, or the internal or personal use of specific clients, is granted by now Publishers Inc for users registered with the Copyright Clearance Center (CCC). The ‘services’ for users can be found on the internet at: www.copyright.com For those organizations that have been granted a photocopy license, a separate system of payment has been arranged.
    [Show full text]
  • Cryptology and Computational Number Theory (Boulder, Colorado, August 1989) 41 R
    http://dx.doi.org/10.1090/psapm/042 Other Titles in This Series 50 Robert Calderbank, editor, Different aspects of coding theory (San Francisco, California, January 1995) 49 Robert L. Devaney, editor, Complex dynamical systems: The mathematics behind the Mandlebrot and Julia sets (Cincinnati, Ohio, January 1994) 48 Walter Gautschi, editor, Mathematics of Computation 1943-1993: A half century of computational mathematics (Vancouver, British Columbia, August 1993) 47 Ingrid Daubechies, editor, Different perspectives on wavelets (San Antonio, Texas, January 1993) 46 Stefan A. Burr, editor, The unreasonable effectiveness of number theory (Orono, Maine, August 1991) 45 De Witt L. Sumners, editor, New scientific applications of geometry and topology (Baltimore, Maryland, January 1992) 44 Bela Bollobas, editor, Probabilistic combinatorics and its applications (San Francisco, California, January 1991) 43 Richard K. Guy, editor, Combinatorial games (Columbus, Ohio, August 1990) 42 C. Pomerance, editor, Cryptology and computational number theory (Boulder, Colorado, August 1989) 41 R. W. Brockett, editor, Robotics (Louisville, Kentucky, January 1990) 40 Charles R. Johnson, editor, Matrix theory and applications (Phoenix, Arizona, January 1989) 39 Robert L. Devaney and Linda Keen, editors, Chaos and fractals: The mathematics behind the computer graphics (Providence, Rhode Island, August 1988) 38 Juris Hartmanis, editor, Computational complexity theory (Atlanta, Georgia, January 1988) 37 Henry J. Landau, editor, Moments in mathematics (San Antonio, Texas, January 1987) 36 Carl de Boor, editor, Approximation theory (New Orleans, Louisiana, January 1986) 35 Harry H. Panjer, editor, Actuarial mathematics (Laramie, Wyoming, August 1985) 34 Michael Anshel and William Gewirtz, editors, Mathematics of information processing (Louisville, Kentucky, January 1984) 33 H. Peyton Young, editor, Fair allocation (Anaheim, California, January 1985) 32 R.
    [Show full text]
  • A Purdue University Course in the History of Computing
    Purdue University Purdue e-Pubs Department of Computer Science Technical Reports Department of Computer Science 1991 A Purdue University Course in the History of Computing Saul Rosen Report Number: 91-023 Rosen, Saul, "A Purdue University Course in the History of Computing" (1991). Department of Computer Science Technical Reports. Paper 872. https://docs.lib.purdue.edu/cstech/872 This document has been made available through Purdue e-Pubs, a service of the Purdue University Libraries. Please contact [email protected] for additional information. A PURDUE UNIVERSITY COURSE IN mE HISTORY OF COMPUTING Saul Rosen CSD-TR-91-023 Mrrch 1991 A Purdue University Course in the History of Computing Saul Rosen CSD-TR-91-023 March 1991 Abstract University COUISes in the history of computing are still quite rarc. This paper is a discussion of a one-semester course that I have taught during the past few years in the Department of Computer Sciences at Purdue University. The amount of material that could be included in such a course is overwhelming, and the literature in the subject has increased at a great rate in the past decade. A syllabus and list of major references are presented here as they are presented to the students. The course develops a few major themes, several of which arc discussed briefly in the paper. The coume has been an interesting and stimulating experience for me. and for some of the students who took the course. I do not foresee a rapid expansion in the number of uniVcCiities that will offer courses in the history of computing.
    [Show full text]
  • 31 International Symposium on Distributed Computing Andréa W
    31 International Symposium on Distributed Computing DISC 2017, October 16–20, Vienna, Austria Edited by Andréa W. Richa LIPIcs – Vol. 91 – DISC2017 www.dagstuhl.de/lipics Editor Andréa W. Richa Computer Science and Engineering School of Computing, Informatics and Decision Systems Engineering (CIDSE) Arizona State University Tempe, AZ, USA [email protected] ACM Classification 1998 C.2 Computer-Communication Networks, C.2.4 Distributed Systems, D.1.3 Concurrent Programming, E.1 Data Structures, F Theory of Computation, F.1.1 Models of Computation, F.1.2 Modes of Computation ISBN 978-3-95977-053-8 Published online and open access by Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, Germany. Online available at http://www.dagstuhl.de/dagpub/978-3-95977-053-8. Publication date October, 2017 Bibliographic information published by the Deutsche Nationalbibliothek The Deutsche Nationalbibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data are available in the Internet at http://dnb.d-nb.de. License This work is licensed under a Creative Commons Attribution 3.0 Unported license (CC-BY 3.0): http://creativecommons.org/licenses/by/3.0/legalcode. In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the work under the following conditions, without impairing or restricting the authors’ moral rights: Attribution: The work must be attributed to its authors. The copyright is retained by the corresponding authors. Digital Object Identifier: 10.4230/LIPIcs.DISC.2017.0 ISBN 978-3-95977-053-8 ISSN 1868-8969 http://www.dagstuhl.de/lipics 0:iii LIPIcs – Leibniz International Proceedings in Informatics LIPIcs is a series of high-quality conference proceedings across all fields in informatics.
    [Show full text]
  • TCM Report, Spring
    Alan F. Shugart Contents BOARD OF DIRECTORS CONTRIBUTING MEMBERS Richard L. Sites Ronald G. Smart 1 John Willia m Poduska. Sr.. Chairman David Ahl. Mr. and Mrs. Rolland B. Arndt. Charles E. Sporck The Director's Letter Apollo Computer. Inc. Isaac L. Auerbach. Robert W. Bailey. Ph.D.. Ivan and Marcia Sutherland John Banning. Alan G. Bell. Gregory C .F. Del Thorndike and Steve Teicher Dr. G w e n Bell C. Gordon Bell Bettice. Alfred M. Bertocchi. Richard Billings. Erwin Tomash Encore Computer Corporation Allen H. Brady. Daniel S. Bricklin. Fred and Jean De Val pine 3 Dr. Gwen Bell Nancy Brooks. David A. Brown. Gordon S. Charles P Waite Howard Hathaway Aiken Brown, Lawrence C. Brown, Marshall D. Stephen L. Watson The Computer Museum Butler. Charles T. and Virginia G. Casale. Harvey W. Wiggins. Jr. The Life of a Computer Pioneer Danald Christiansen. Richard J. Clayton. William Wolfson Erich Bloch George Towne Clifford. Howard E. Cox. Jr .. G regory W. Welch National Science Foundation Henry J. Crouse. David N. Cutler. Joe Cychosz. 13 Harvey D. Cragon Gerald Davis and Francoise Szigetti. Clive B. CORPORATE MEMBERS University of Texas, Austin Dawson. F. de Bros, Bruce A. and Frances M. A Conversation Delagi. Jack Dennis. Nick de Wolf. L. John David Donaldson Doerr. James R. Donaldson. Philip H. Dorn. BENEfACTOR- SIO.OOO or more with the Hackers Ropes and Gray Gregory L. Duckworth, Ray Duncan, Thomas Apollo Computer. Inc: Eggers. Dan L. Eisner. Bob O. Evans. Robert Bank of America Foundation· 16 Robert Everett A. Farmer, Andrew D. Feit. Tse-yun Feng.
    [Show full text]
  • Arxiv:2106.11534V1 [Cs.DL] 22 Jun 2021 2 Nanjing University of Science and Technology, Nanjing, China 3 University of Southampton, Southampton, U.K
    Noname manuscript No. (will be inserted by the editor) Turing Award elites revisited: patterns of productivity, collaboration, authorship and impact Yinyu Jin1 · Sha Yuan1∗ · Zhou Shao2, 4 · Wendy Hall3 · Jie Tang4 Received: date / Accepted: date Abstract The Turing Award is recognized as the most influential and presti- gious award in the field of computer science(CS). With the rise of the science of science (SciSci), a large amount of bibliographic data has been analyzed in an attempt to understand the hidden mechanism of scientific evolution. These include the analysis of the Nobel Prize, including physics, chemistry, medicine, etc. In this article, we extract and analyze the data of 72 Turing Award lau- reates from the complete bibliographic data, fill the gap in the lack of Turing Award analysis, and discover the development characteristics of computer sci- ence as an independent discipline. First, we show most Turing Award laureates have long-term and high-quality educational backgrounds, and more than 61% of them have a degree in mathematics, which indicates that mathematics has played a significant role in the development of computer science. Secondly, the data shows that not all scholars have high productivity and high h-index; that is, the number of publications and h-index is not the leading indicator for evaluating the Turing Award. Third, the average age of awardees has increased from 40 to around 70 in recent years. This may be because new breakthroughs take longer, and some new technologies need time to prove their influence. Besides, we have also found that in the past ten years, international collabo- ration has experienced explosive growth, showing a new paradigm in the form of collaboration.
    [Show full text]
  • Verifiable Random Functions
    Verifiable Random Functions y z Silvio Micali Michael Rabin Salil Vadhan Abstract random string of the proper length. The possibility thus ex- ists that, if it so suits him, the party knowing the seed s may We efficiently combine unpredictability and verifiability by declare that the value of his pseudorandom oracle at some x f x extending the Goldreich–Goldwasser–Micali construction point is other than s without fear of being detected. It f s of pseudorandom functions s from a secret seed , so that is for this reason that we refer to these objects as “pseudo- s f knowledge of not only enables one to evaluate s at any random oracles” rather than using the standard terminology f x x NP point , but also to provide an -proof that the value “pseudorandom functions” — the values s come “out f x s is indeed correct without compromising the unpre- of the blue,” as if from an oracle, and the receiver must sim- s f dictability of s at any other point for which no such a proof ply trust that they are computed correctly from the seed . was provided. Therefore, though quite large, the applicability of pseu- dorandom oracles is limited: for instance, to settings in which (1) the “seed owner”, and thus the one evaluating 1Introduction the pseudorandom oracle, is totally trusted; or (2) it is to the seed-owner’s advantage to evaluate his pseudorandom oracle correctly; or (3) there is absolutely nothing for the PSEUDORANDOM ORACLES. Goldreich, Goldwasser, and seed-owner to gain from being dishonest. Micali [GGM86] show how to simulate a random ora- f x One efficient way of enabling anyone to verify that s b cle from a-bit strings to -bit strings by means of a con- f x really is the value of pseudorandom oracle s at point struction using a seed, that is, a secret and short random clearly consists of publicizing the seed s.However,this string.
    [Show full text]