A Decade of Lattice Cryptography
Total Page:16
File Type:pdf, Size:1020Kb
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 -
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. -
Curriculum Vitae
Curriculum Vitae Prof. Michal Feldman School of Computer Science, Tel-Aviv University Personal Details • Born: Israel, 1976 • Gender: Female • email: [email protected] Education • Ph.D.: Information Management and Systems, University of California at Berkeley, May 2005. Thesis title: Incentives for cooperation in peer-to-peer systems. • B.Sc.: Bar-Ilan University, Computer Science, Summa Cum Laude, June 1999. Academic Positions 2013 - present: Associate Professor, School of Computer Science, Tel-Aviv University, Israel. Associate Professor, School of Business Administration and Center for 2011 - 2013: the Study of Rationality, Hebrew University of Jerusalem, Israel. 2007 - 2011: Senior Lecturer, School of Business Administration and Center for the Study of Rationality, Hebrew University of Jerusalem, Israel. Additional Positions 2011 - 2013: Visiting Researcher (weekly visitor), Microsoft Research New England, Cambridge, MA, USA. 2011 - 2013: Visiting Professor, Harvard School of Engineering and Applied Sciences, Center for Research on Computation and Society, School of Computer Science, Cambridge, MA, USA (Marie Curie IOF program). 2008 - 2011: Senior Researcher (part-time), Microsoft Research in Herzliya, Israel. 2007 - 2013: Member, Center for the Study of Rationality, Hebrew University. 2005 - 2007: Post-Doctoral Fellow (Lady Davis fellowship), Hebrew University, School of Computer Science and Engineering. 2004: Ph.D. Intern, HP Labs, Palo Alto, California, USA. 1 Grants (Funding ID) • European Research Council (ERC) Starting Grant: \Algorithmic Mechanism Design - Beyond Truthfulness": 1.4 million Euro, 2013-2017. • FP7 Marie Curie International Outgoing Fellowship (IOF): \Innovations in Algorithmic Game Theory" (IAGT): 313,473 Euro, 2011-2014. • Israel Science Foundation (ISF) grant. \Equilibria Under Coalitional Covenants in Non-Cooperative Games - Existence, Quality and Computation:" 688,000 NIS (172,000 NIS /year), 2009-2013. -
Information and Announcements Mathematics Prizes Awarded At
Information and Announcements Mathematics Prizes Awarded at ICM 2014 The International Congress of Mathematicians (ICM) is held once in four years under the auspices of the International Mathematical Union (IMU). The ICM is the largest, and the most prestigious, meeting of the mathematics community. During the ICM, the Fields Medal, the Nevanlinna Prize, the Gauss Prize, the Chern Medal and the Leelavati Prize are awarded. The Fields Medals are awarded to mathematicians under the age of 40 to recognize existing outstanding mathematical work and for the promise of future achievement. A maximum of four Fields Medals are awarded during an ICM. The Nevanlinna Prize is awarded for outstanding contributions to mathematical aspects of information sciences; this awardee is also under the age of 40. The Gauss Prize is given for mathematical research which has made a big impact outside mathematics – in industry or technology, etc. The Chern Medal is awarded to a person whose mathematical accomplishments deserve the highest level of recognition from the mathematical community. The Leelavati Prize is sponsored by Infosys and is a recognition of an individual’s extraordinary achievements in popularizing among the public at large, mathematics, as an intellectual pursuit which plays a crucial role in everyday life. The 27th ICM was held in Seoul, South Korea during August 13–21, 2014. Fields Medals The following four mathematicians were awarded the Fields Medal in 2014. 1. Artur Avila, “for his profound contributions to dynamical systems theory, which have changed the face of the field, using the powerful idea of renormalization as a unifying principle”. Work of Artur Avila (born 29th June 1979): Artur Avila’s outstanding work on dynamical systems, and analysis has made him a leader in the field. -
Limitations and Possibilities of Algorithmic Mechanism Design By
Incentives, Computation, and Networks: Limitations and Possibilities of Algorithmic Mechanism Design by Yaron Singer A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate Division of the University of California, Berkeley Committee in charge: Professor Christos Papadimitriou, Chair Professor Shachar Kariv Professor Scott Shenker Spring 2012 Incentives, Computation, and Networks: Limitations and Possibilities of Algorithmic Mechanism Design Copyright 2012 by Yaron Singer 1 Abstract Incentives, Computation, and Networks: Limitations and Possibilities of Algorithmic Mechanism Design by Yaron Singer Doctor of Philosophy in Computer Science University of California, Berkeley Professor Christos Papadimitriou, Chair In the past decade, a theory of manipulation-robust algorithms has been emerging to address the challenges that frequently occur in strategic environments such as the internet. The theory, known as algorithmic mechanism design, builds on the foundations of classical mechanism design from microeconomics and is based on the idea of incentive compatible pro- tocols. Such protocols achieve system-wide objectives through careful design that ensures it is in every agent's best interest to comply with the protocol. As it turns out, however, implementing incentive compatible protocols as advocated in classical mechanism design the- ory often necessitates solving intractable problems. To address this, algorithmic mechanism design focuses on designing -
FOCS 2005 Program SUNDAY October 23, 2005
FOCS 2005 Program SUNDAY October 23, 2005 Talks in Grand Ballroom, 17th floor Session 1: 8:50am – 10:10am Chair: Eva´ Tardos 8:50 Agnostically Learning Halfspaces Adam Kalai, Adam Klivans, Yishay Mansour and Rocco Servedio 9:10 Noise stability of functions with low influences: invari- ance and optimality The 46th Annual IEEE Symposium on Elchanan Mossel, Ryan O’Donnell and Krzysztof Foundations of Computer Science Oleszkiewicz October 22-25, 2005 Omni William Penn Hotel, 9:30 Every decision tree has an influential variable Pittsburgh, PA Ryan O’Donnell, Michael Saks, Oded Schramm and Rocco Servedio Sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing 9:50 Lower Bounds for the Noisy Broadcast Problem In cooperation with ACM SIGACT Navin Goyal, Guy Kindler and Michael Saks Break 10:10am – 10:30am FOCS ’05 gratefully acknowledges financial support from Microsoft Research, Yahoo! Research, and the CMU Aladdin center Session 2: 10:30am – 12:10pm Chair: Satish Rao SATURDAY October 22, 2005 10:30 The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics Tutorials held at CMU University Center into `1 [Best paper award] Reception at Omni William Penn Hotel, Monongahela Room, Subhash Khot and Nisheeth Vishnoi 17th floor 10:50 The Closest Substring problem with small distances Tutorial 1: 1:30pm – 3:30pm Daniel Marx (McConomy Auditorium) Chair: Irit Dinur 11:10 Fitting tree metrics: Hierarchical clustering and Phy- logeny Subhash Khot Nir Ailon and Moses Charikar On the Unique Games Conjecture 11:30 Metric Embeddings with Relaxed Guarantees Break 3:30pm – 4:00pm Ittai Abraham, Yair Bartal, T-H. -
Four Results of Jon Kleinberg a Talk for St.Petersburg Mathematical Society
Four Results of Jon Kleinberg A Talk for St.Petersburg Mathematical Society Yury Lifshits Steklov Institute of Mathematics at St.Petersburg May 2007 1 / 43 2 Hubs and Authorities 3 Nearest Neighbors: Faster Than Brute Force 4 Navigation in a Small World 5 Bursty Structure in Streams Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 / 43 3 Nearest Neighbors: Faster Than Brute Force 4 Navigation in a Small World 5 Bursty Structure in Streams Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 Hubs and Authorities 2 / 43 4 Navigation in a Small World 5 Bursty Structure in Streams Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 Hubs and Authorities 3 Nearest Neighbors: Faster Than Brute Force 2 / 43 5 Bursty Structure in Streams Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 Hubs and Authorities 3 Nearest Neighbors: Faster Than Brute Force 4 Navigation in a Small World 2 / 43 Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 Hubs and Authorities 3 Nearest Neighbors: Faster Than Brute Force 4 Navigation in a Small World 5 Bursty Structure in Streams 2 / 43 Part I History of Nevanlinna Prize Career of Jon Kleinberg 3 / 43 Nevanlinna Prize The Rolf Nevanlinna Prize is awarded once every 4 years at the International Congress of Mathematicians, for outstanding contributions in Mathematical Aspects of Information Sciences including: 1 All mathematical aspects of computer science, including complexity theory, logic of programming languages, analysis of algorithms, cryptography, computer vision, pattern recognition, information processing and modelling of intelligence. -
Satisfiability and Evolution
2014 IEEE Annual Symposium on Foundations of Computer Science Satisfiability and Evolution Adi Livnat Christos Papadimitriou Aviad Rubinstein Department of Biological Sciences Computer Science Division Computer Science Division Virginia Tech. University of California at Berkeley University of California at Berkeley [email protected] [email protected] [email protected] Gregory Valiant Andrew Wan Computer Science Department Simons Institute Stanford University University of California at Berkeley [email protected] [email protected] Abstract—We show that, if truth assignments on n variables genes are able to efficiently arise in polynomial populations reproduce through recombination so that satisfaction of a par- with recombination. In the standard view of evolution, a ticular Boolean function confers a small evolutionary advan- variant of a particular gene is more likely to spread across tage, then a polynomially large population over polynomially many generations (polynomial in n and the inverse of the initial a population if it makes its own contribution to the overall satisfaction probability) will end up almost surely consisting fitness, independent of the contributions of variants of other exclusively of satisfying truth assignments. We argue that this genes. How can complex, multi-gene traits spread in a theorem sheds light on the problem of the evolution of complex population? This may seem to be especially problematic adaptations. for multi-gene traits whose contribution to fitness does not Keywords-evolution; algorithms; Boolean functions decompose into small additive components associated with each gene variant —traits with the property that even if I. INTRODUCTION one gene variant is different from the one that is needed The TCS community has a long history of applying its for the right combination, there is no benefit, or even a net perspectives and tools to better understand the processes negative benefit. -
Research Notices
AMERICAN MATHEMATICAL SOCIETY Research in Collegiate Mathematics Education. V Annie Selden, Tennessee Technological University, Cookeville, Ed Dubinsky, Kent State University, OH, Guershon Hare I, University of California San Diego, La jolla, and Fernando Hitt, C/NVESTAV, Mexico, Editors This volume presents state-of-the-art research on understanding, teaching, and learning mathematics at the post-secondary level. The articles are peer-reviewed for two major features: (I) advancing our understanding of collegiate mathematics education, and (2) readability by a wide audience of practicing mathematicians interested in issues affecting their students. This is not a collection of scholarly arcana, but a compilation of useful and informative research regarding how students think about and learn mathematics. This series is published in cooperation with the Mathematical Association of America. CBMS Issues in Mathematics Education, Volume 12; 2003; 206 pages; Softcover; ISBN 0-8218-3302-2; List $49;AII individuals $39; Order code CBMATH/12N044 MATHEMATICS EDUCATION Also of interest .. RESEARCH: AGul<lelbrthe Mathematics Education Research: Hothomatldan- A Guide for the Research Mathematician --lllll'tj.M...,.a.,-- Curtis McKnight, Andy Magid, and -- Teri J. Murphy, University of Oklahoma, Norman, and Michelynn McKnight, Norman, OK 2000; I 06 pages; Softcover; ISBN 0-8218-20 16-8; List $20;AII AMS members $16; Order code MERN044 Teaching Mathematics in Colleges and Universities: Case Studies for Today's Classroom Graduate Student Edition Faculty -
Navigability of Small World Networks
Navigability of Small World Networks Pierre Fraigniaud CNRS and University Paris Sud http://www.lri.fr/~pierre Introduction Interaction Networks • Communication networks – Internet – Ad hoc and sensor networks • Societal networks – The Web – P2P networks (the unstructured ones) • Social network – Acquaintance – Mail exchanges • Biology (Interactome network), linguistics, etc. Dec. 19, 2006 HiPC'06 3 Common statistical properties • Low density • “Small world” properties: – Average distance between two nodes is small, typically O(log n) – The probability p that two distinct neighbors u1 and u2 of a same node v are neighbors is large. p = clustering coefficient • “Scale free” properties: – Heavy tailed probability distributions (e.g., of the degrees) Dec. 19, 2006 HiPC'06 4 Gaussian vs. Heavy tail Example : human sizes Example : salaries µ Dec. 19, 2006 HiPC'06 5 Power law loglog ppk prob{prob{ X=kX=k }} ≈≈ kk-α loglog kk Dec. 19, 2006 HiPC'06 6 Random graphs vs. Interaction networks • Random graphs: prob{e exists} ≈ log(n)/n – low clustering coefficient – Gaussian distribution of the degrees • Interaction networks – High clustering coefficient – Heavy tailed distribution of the degrees Dec. 19, 2006 HiPC'06 7 New problematic • Why these networks share these properties? • What model for – Performance analysis of these networks – Algorithm design for these networks • Impact of the measures? • This lecture addresses navigability Dec. 19, 2006 HiPC'06 8 Navigability Milgram Experiment • Source person s (e.g., in Wichita) • Target person t (e.g., in Cambridge) – Name, professional occupation, city of living, etc. • Letter transmitted via a chain of individuals related on a personal basis • Result: “six degrees of separation” Dec. -
Secure Multi-Party Computation in Practice
SECURE MULTI-PARTY COMPUTATION IN PRACTICE Marcella Christine Hastings A DISSERTATION in Computer and Information Science Presented to the Faculties of the University of Pennsylvania in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy 2021 Supervisor of Dissertation Nadia Heninger Adjunct Associate Professor, University of Pennsylvania Associate Professor, University of California, San Diego Graduate Group Chairperson Mayur Naik Professor and Computer and Information Science Graduate Group Chair Dissertation Committee Brett Hemenway Falk, Research Assistant Professor Stephan A. Zdancewic, Professor Sebastian Angel, Raj and Neera Singh Term Assistant Professor abhi shelat, Associate Professor at Khoury College of Computer Sciences, Northeastern University ACKNOWLEDGMENT This dissertation would have been much less pleasant to produce without the presence of many people in my life. I would like to thank my advisor and my dissertation committee for their helpful advice, direction, and long-distance phone calls over the past six years. I would like to thank my fellow PhD students at the University of Pennsylvania, especially the ever-changing but consistently lovely office mates in the Distributed Systems Laboratory and my cohort. Our shared tea-time, cookies, disappointments, and achievements provided an essential community that brought me great joy during my time at Penn. I would like to thank the mentors and colleagues who hosted me at the Security and Privacy Lab at the University of Washington in 2018, the Software & Application Innovation Lab at Boston University in 2019, and the Cryptography and Privacy Research group at Microsoft Research in 2020. My career and happiness greatly benefited from spending these summers exploring fresh research directions and rediscovering the world outside my own work. -
The Best Nurturers in Computer Science Research
The Best Nurturers in Computer Science Research Bharath Kumar M. Y. N. Srikant IISc-CSA-TR-2004-10 http://archive.csa.iisc.ernet.in/TR/2004/10/ Computer Science and Automation Indian Institute of Science, India October 2004 The Best Nurturers in Computer Science Research Bharath Kumar M.∗ Y. N. Srikant† Abstract The paper presents a heuristic for mining nurturers in temporally organized collaboration networks: people who facilitate the growth and success of the young ones. Specifically, this heuristic is applied to the computer science bibliographic data to find the best nurturers in computer science research. The measure of success is parameterized, and the paper demonstrates experiments and results with publication count and citations as success metrics. Rather than just the nurturer’s success, the heuristic captures the influence he has had in the indepen- dent success of the relatively young in the network. These results can hence be a useful resource to graduate students and post-doctoral can- didates. The heuristic is extended to accurately yield ranked nurturers inside a particular time period. Interestingly, there is a recognizable deviation between the rankings of the most successful researchers and the best nurturers, which although is obvious from a social perspective has not been statistically demonstrated. Keywords: Social Network Analysis, Bibliometrics, Temporal Data Mining. 1 Introduction Consider a student Arjun, who has finished his under-graduate degree in Computer Science, and is seeking a PhD degree followed by a successful career in Computer Science research. How does he choose his research advisor? He has the following options with him: 1. Look up the rankings of various universities [1], and apply to any “rea- sonably good” professor in any of the top universities.