DOCSLIB.ORG

December 2013 [.Pdf]

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
December 2013 [.Pdf] CMU’S NEWS SOURCE FOR FACULTY & STAFF 12/13 ISSUE “My Work Is From the Heart” Subra Suresh Installed as President; Offers New Take on CMU Motto n Piper Staff In a formal academic ceremony fi lled with all the regalia and pageantry of commencement, Carnegie Mellon of- fi cially inducted Subra Suresh as the uni- versity’s ninth president on Friday, Nov. 15, the 113th anniversary of the univer- sity’s founding by Andrew Carnegie. The investiture ceremony contin- ued with the inaugural theme “Crossing Boundaries, Transforming Lives,” as Suresh compared the journey he took to arrive at CMU with experiences similar to its founder. But, he had his own take on the university’s motto, “My heart is in the work,” when he stated, “My work is from the heart.” The ceremony in Carnegie Music Hall opened with a stunning perfor- mance of Stephen Schwartz’ (A’68) “Corner of the Sky” by Tony Award- winner Patina Miller (A’06). Several gave remarks welcoming Suresh to Carnegie Mellon, including Allan Melt- zer, the longest-standing faculty member at CMU, Faculty Senate Chair Roberta Klatzky, Staff Council Chair John PHOTO BY TIM KAULEN C ONTINUED ON PAGE SIX F ACULTY M ARSHAL J OHN M ACKEY ( LEFT ) AND C HAIRMAN OF THE B OARD R AY L ANE PRESENTED C M U P RESIDENT S UBRA S URESH WITH THE C M U CHARTER AND MEDALLION OF THE UNIVERSITY SEAL . Tepper Quad Science of Learning Largest Gift From Simon Institute, New Consortium To Drive Educational Technology CMU Grad To Create n Piper Staff refl ect learners’ activities for decades. Council (GLC). Academic Hub Carnegie Mellon has launched the This wealth of data now will be shared A new consortium of education and more broadly. technology research leaders, the GLC n Ken Walters Simon Initiative to accelerate the use of learning science and technology to CMU also has called on experts will develop standards, identify best A $67 million gift from the charitable improve student learning. from academia, industry and practices and encourage engagement foundation of CMU alumnus and Named to honor the work of the foundations to form the Global Learning C ONTINUED ON PAGE FIVE renowned investor David A. Tepper late Nobel laureate and CMU Professor (TPR’82) will be used to create an Herbert A. Simon, the initiative will academic hub, including a new home for harness CMU’s decades of learning data the Tepper School of Business, on the and research to improve educational Pittsburgh campus. outcomes for students everywhere. “Our vision for the new David A. As part of the initiative, CMU Tepper Quadrangle builds on CMU’s will provide open access to the world’s strengths, creating new interdisciplinary largest bank of educational technology interactions for learning and research data — detailed data about how people and connecting innovation to the busi- learn and how effective learning ness community,” said CMU President software can be designed and deployed. Subra Suresh. CMU learning scientists have been “I’m excited by President Suresh’s performing research into every student and the university’s vision to make CMU interaction with learning software to C ONTINUED ON PAGE SEVEN O NE 813752_Piper_November R1.indd 3 11/27/13 3:08 PM Human Rights Researchers Work To Find Justice for Victims n Shilo Rea directs CMU’s Center for Human Rights Immediately after Typhoon Haiyan A UTHORS E XPLORE P ROPER Science. hit the Philippines, the international “This means that some victims of community focused on providing W AYS T O R ECORD D EATHS confl ict and disaster have been identifi ed (in Bosnia or in the aftermath of the food, shelter and medical assistance to The recent violence in Syria vividly demonstrates the diffi culty — and 9/11 World Trade Center attacks), while survivors. importance — of accurately recording and estimating nonmilitary deaths in But for the families of the confl ict areas. others have not (in Rwanda or Haiti),” he thousands feared dead or missing, a “Counting Civilian Casualties: An Introduction to Recording and said. “The 2004 Indian Ocean Tsunami long-term recovery from the devastating Estimating Nonmilitary Deaths in Confl ict” surveys the challenges of this illustrates the inequities: international storm also depends on managing the task, presenting and evaluating methods for ensuring that these tragic efforts to identify the remains of victims remains honestly and honorably. That’s killings are properly acknowledged. Co-edited by Carnegie Mellon’s Jay D. were undertaken in Thailand, where there Aronson and Baruch Fischhoff and the University of Pittsburgh’s Taylor B. the role Carnegie Mellon’s Alex John was a high density of Western tourists, Seybolt, the book contains contributions from the top researchers in the London and Jay D. Aronson are helping but not in Sri Lanka, Indonesia, or other fi eld, presenting case studies from Latin America, South America, Europe, affected areas.” to play. Africa, the Middle East and Asia. To that end, Aronson reiterated London and Aronson are working Published by Oxford University Press, the book stems from a 2009 to improve standards and offer ethical workshop co-sponsored by CMU and Pitt and examines the most com- what he, London and the University of guidelines for identifying victims monly used casualty recording and estimation techniques and evaluates Pittsburgh’s Lisa S. Parker called for in in confl ict and disaster areas to help their strengths and weaknesses. It also analyzes how fi gures are used — the Sept. 13 issue of “Science” — the provide justice to victims and their and sometimes misused — by governments, rebels, human rights advo- creation of international structure to families. cates, war crime tribunals and others. promote more equal access to forensic London, professor of philosophy “One day, we may have an international convention, guaranteeing identifi cation technologies. proper, respectful records of all those killed in confl icts,” said Fischhoff, the and director of the Center for Ethics London advocated for policies to Howard Heinz University Professor in the Department of Social and Deci- and Policy, said CMU is the place for ensure that samples and information sion Sciences and Department of Engineering and Public Policy. “When gathered for the purposes of identifying this type of humanitarian effort because we do, the methods reported in this book will help to ensure that the work “CMU is a hotbed of multi-disciplinary is done with the accuracy and dignity that individuals deserve. Perhaps a missing people are not misused and that work with a strong emphasis on the clearer picture of these tragedies will reduce them in the future, while help- the process is strong enough to withstand ethical and policy dimensions of new ing the survivors today.” legal scrutiny. technologies.” “If families believe that their genetic London and Aronson recently material will be used in ways that could spoke at “The Missing: An Agenda For and data protection — a similar topic to a death of a loved one is a fi rst step in the result in their being subject to extra the Future,” a high-level international recent paper they published in “Science.” healing process and is often necessary policing, political reprisal or the disclosure conference that brought together the Aronson, associate professor of for families to secure benefi ts and assert of health-related information, then they world’s leading experts to discuss science, technology and society in the other rights, such as remarrying. may be unwilling to participate in the missing persons from armed confl icts, Department of History, argued that “Unfortunately, access to the identifi cation process,” London said. human rights abuses, disasters, identifying the missing should not be a resources and technologies to timely “Key to ensuring trust are clearly migration, human traffi cking, organized luxury and is crucial to enforcing human identify remains is signifi cantly articulated, enforceable procedures crime and other cases. Held at The rights, clarifying history and facilitating restricted by the willingness and ability that safeguard the rights and welfare Hague in the Netherlands, London and justice. It also plays a critical role for of governments and other organizations of participants and that ensure high Aronson presented on standards, ethics the victims’ families — confi rming the to pay for them,” said Aronson, who also standards of scientifi c quality.” CMU Participates in Transform Africa Summit PIPER n Chriss Swaney 12/13 Issue country building a Sub-Saharan Africa is P UBLISHER knowledge-based econ- Ken Walters home to 650 million omy. At present, CMU E DITOR M ANAGING E DITOR mobile phone subscribers, Bruce Gerson Heidi Opdyke offers a master’s degree in 50 million Facebook users information technology, W RITERS and an increasing number Dana Casto Abby Simmons and will begin offering Jocelyn Duffy Kelly Solman of technology and entre- a second master’s degree Bruce Gerson Byron Spice preneurial hubs. With that Sarah Nightingale Chriss Swaney in electrical and computer Heidi Opdyke Ken Walters growth comes a demand engineering in August Shilo Rea Pam Wigley for highly skilled workers, 2014. D ESIGNER and that need is being ad- Melissa Stoebe “Our 16-month Communications Design and Photography dressed by Carnegie Mel- programs deliver both Group lon’s graduate programs in theory and practice to stu- P HOTOGRAPHY Rwanda. Ken Andreyo dents, including success- Tim Kaulen James H. Garrett Jr., ful summer internships at Communications Design and Photography dean of the College of Engineering Group He said CMU’s graduate programs in global tech companies,” Garrett said. and the Thomas Lord Professor of Rwanda are designed to produce Africa’s To contact The Piper staff, call 412-268-2900 In addition to Garrett, CMU or email [email protected].
Load more

Recommended publications
  • 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]
  • CRN What It Was Doing and Why It Was Cognitive Systems Vision Doing It, and to Recover from Mental Continued on Page 8 Expanding the Pipeline
    COMPUTING RESEARCH NEWS Computing Research Association, Celebrating 30 Years of Service to the Computing Research Community November 2002 Vol. 14/No. 5 DARPA’s New Cognitive Systems Vision By Ron Brachman and IPTO’s goal is to create a new to cope with systems both keep Zachary Lemnios generation of cognitive systems. growing. In order to make our systems more reliable, more secure, The impact of the Defense Mired in Moore’s Law? and more understandable, and to Advanced Research Projects Agency One benefit of such cognitive continue making substantial contri- (DARPA) on computing over the systems would be their help in butions to society, we need to do past 40 years has been profound. Led extracting us from a corner into something dramatically different. by the visionary J.C.R. Licklider and which our success seems to have his innovative successors in the painted us. The research that has The Promise of Cognitive Information Processing Techniques helped the industry follow Moore’s Systems Office (IPTO), DARPA initiated “Law” has created processors that are IPTO is attacking this problem by work that ultimately put personal remarkably fast and small, and data driving a fundamental change in computers on millions of desktops storage capabilities that are vast and computing systems. By giving systems Ron Brachman and made the global Internet a cheap. Unfortunately, these incred- more cognitive capabilities, we reality. In fact, the original IPTO, ible developments have cut two ways. believe we can make them more which lasted from 1962 to 1985, was While today’s computers are more responsible for their own behavior in large part responsible for estab- powerful than ever, we have been and maintenance.
    [Show full text]
  • The Conference Program Booklet
    Austin Convention Center Conference Austin, TX Program http://sc15.supercomputing.org/ Conference Dates: Exhibition Dates: The International Conference for High Performance Nov. 15 - 20, 2015 Nov. 16 - 19, 2015 Computing, Networking, Storage and Analysis Sponsors: SC15.supercomputing.org SC15 • Austin, Texas The International Conference for High Performance Computing, Networking, Storage and Analysis Sponsors: 3 Table of Contents Welcome from the Chair ................................. 4 Papers ............................................................... 68 General Information ........................................ 5 Posters Research Posters……………………………………..88 Registration and Conference Store Hours ....... 5 ACM Student Research Competition ........ 114 Exhibit Hall Hours ............................................. 5 Posters SC15 Information Booth/Hours ....................... 5 Scientific Visualization/ .................................... 120 Data Analytics Showcase SC16 Preview Booth/Hours ............................. 5 Student Programs Social Events ..................................................... 5 Experiencing HPC for Undergraduates ...... 122 Registration Pass Access .................................. 7 Mentor-Protégé Program .......................... 123 Student Cluster Competition Kickoff ......... 123 SCinet ............................................................... 8 Student-Postdoc Job & ............................. 123 Convention Center Maps ................................. 12 Opportunity Fair Daily Schedules
    [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]
  • Curriculum Vitae
    Massachusetts Institute of Technology School of Engineering Faculty Personnel Record Date: April 1, 2020 Full Name: Charles E. Leiserson Department: Electrical Engineering and Computer Science 1. Date of Birth November 10, 1953 2. Citizenship U.S.A. 3. Education School Degree Date Yale University B. S. (cum laude) May 1975 Carnegie-Mellon University Ph.D. Dec. 1981 4. Title of Thesis for Most Advanced Degree Area-Efficient VLSI Computation 5. Principal Fields of Interest Analysis of algorithms Caching Compilers and runtime systems Computer chess Computer-aided design Computer network architecture Digital hardware and computing machinery Distance education and interaction Fast artificial intelligence Leadership skills for engineering and science faculty Multicore computing Parallel algorithms, architectures, and languages Parallel and distributed computing Performance engineering Scalable computing systems Software performance engineering Supercomputing Theoretical computer science MIT School of Engineering Faculty Personnel Record — Charles E. Leiserson 2 6. Non-MIT Experience Position Date Founder, Chairman of the Board, and Chief Technology Officer, Cilk Arts, 2006 – 2009 Burlington, Massachusetts Director of System Architecture, Akamai Technologies, Cambridge, 1999 – 2001 Massachusetts Shaw Visiting Professor, National University of Singapore, Republic of 1995 – 1996 Singapore Network Architect for Connection Machine Model CM-5 Supercomputer, 1989 – 1990 Thinking Machines Programmer, Computervision Corporation, Bedford, Massachusetts 1975
    [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]
  • 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]
  • 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]
  • Verifiable Random Functions
    Verifiable Random Functions The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Micali, Silvio, Michael Rabin, and Salil Vadhan. 1999. Verifiable random functions. In Proceedings of the 40th Annual Symposium on the Foundations of Computer Science (FOCS `99), 120-130. New York: IEEE Computer Society Press. Published Version http://dx.doi.org/10.1109/SFFCS.1999.814584 Citable link http://nrs.harvard.edu/urn-3:HUL.InstRepos:5028196 Terms of Use This article was downloaded from Harvard University’s DASH repository, and is made available under the terms and conditions applicable to Other Posted Material, as set forth at http:// nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of- use#LAA 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 .
    [Show full text]