DOCSLIB.ORG

Submission Data for 2020-2021 CORE Conference Ranking Process International Workshop on Randomization and Computation

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Submission Data for 2020-2021 CORE Conference Ranking Process International Workshop on Randomization and Computation Submission Data for 2020-2021 CORE conference Ranking process International Workshop on Randomization and Computation Ronen Shaltiel, Omer Reingold Conference Details Conference Title: International Workshop on Randomization and Computation Acronym : RANDOM Rank: A Requested Rank Rank: A Recent Years Proceedings Publishing Style Proceedings Publishing: self-contained Link to most recent proceedings: https://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=16124 Further details: The proceedings of RANDOM are published together with the proceedings of APPROX Until 2013 the proceedings were published in LNCS. From 2014 the proceedings are published by LIPIcs (Dagstuhl). The proceedings include only papers that were accepted to RANDOM and APPROX. No other papers appear in the proceedings Most Recent Years Most Recent Year Year: 2019 URL: https://randomconference.com/random-2019/ Location: MIT, USA Papers submitted: 66 Papers published: 39 Acceptance rate: 59 Source for numbers: https://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol145-approx-random2019-complete.pdf General Chairs Name: Omer Reingold Affiliation: Stanford Gender: M H Index: 51 GScholar url: https://scholar.google.com/citations?user=TD9RhcgAAAAJ&hl=en DBLP url: https://dblp.org/pid/r/OmerReingold.html Program Chairs Name: Dimitris Achlioptas Affiliation: UC Santa Cruz/Google Gender: M H Index: 46 GScholar url: https://scholar.google.com/citations?user=GBQ6w8IAAAAJ&hl=en DBLP url: https://dblp.org/pid/34/4066.html 1 Second Most Recent Year Year: 2018 URL: http://cui.unige.ch/tcs/random-approx/2018/ Location: Princeton University Papers submitted: 73 Papers published: 30 Acceptance rate: 41 Source for numbers: https://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol116-approx-random2018-complete.pdf General Chairs Name: Jose Rolim Affiliation: University of Geneva Gender: M H Index: 24 GScholar url: https://scholar.google.ch/citations?user=6KQy8zgAAAAJ&hl=en DBLP url: https://dblp.org/pid/r/JDPRolim.html Program Chairs Name: Eric Blais Affiliation: University of Waterloo Gender: M H Index: 18 GScholar url: https://scholar.google.ca/citations?user=V75BAeIAAAAJ&hl=en DBLP url: https://dblp.uni-trier.de/pid/46/1548.html Third Most Recent Year Year: 2017 URL: http://cui.unige.ch/tcs/random-approx/2017/ Location: UC Berkeley Papers submitted: 72 Papers published: 27 Acceptance rate: 38 Source for numbers: https://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol81-approx-random2017-complete.pdf General Chairs Name: Jose Rolim Affiliation: University of Geneva Gender: M H Index: 24 GScholar url: https://scholar.google.ch/citations?user=6KQy8zgAAAAJ&hl=en DBLP url: https://dblp.org/pid/r/JDPRolim.html Program Chairs Name: Santosh Vempala Affiliation: Georgia Tech Gender: M H Index: 61 GScholar url: https://scholar.google.com/citations?user=hRggMmIAAAAJ&hl=en DBLP url: https://dblp.org/pid/v/SantoshVempala.html Policies Chair Selection: The steering committee discusses potential candidates and selects a program committee chair. Past and present steering committee members can be found here: https://randomconference.com/steering-committee/ Policy name: Policy regarding logistics, publication and sexual misconduct can be found in the provided url Policy url: https://randomconference.com/policy/ (Senior) Program Committee 2 Link to (s)pc: https://randomconference.com/random-2019/random-2019-program-committee/ File: http://portal.core.edu.au/core/media/conf_submissions_spc_file/RANDOM_1.txt H-index plot: http://portal.core.edu.au/core/media/conf_submissions_hindex_plots/hindex_buckets_1590.png Information Contained within this graph is derived using the Elsevier Scopus Database 2021. Data and Metrics Google Scholar Metrics Sub-category url: https://scholar.google.com.au/citations?view_op=top_venues&hl=en&vq=eng_theoreticalcomputerscience Position in sub-category: 20+ Image of top 20: http://portal.core.edu.au/core/media/changes_h5/higherrank1590_gscholar_minh5.png 3 h5-index for this conference: 19 ACM Metrics Not Sponsored by ACM Aminer Rank Not Listed in Aminer Other Rankings Not aware of any other Rankings Conferences in area: 1st tier: FOCS, STOC, SODA 2nd tier: ICALP, CCC, ITCS, RANDOM, APPROX, ESA 3rd tier: (and more specialized): MFCS, STACS, SoCG, ISIT 4th tier: WG, LATIN, TAMC, SAGT, ICCS Top People Publishing Here Not Providing Top People Publishing Here Where People Publish Top (Senior) Program Committee Members Generated Report Name: conf submissions top spc/higherrank1590 top spc.csv WPP Report: http://portal.core.edu.au/core/media/conf_rank_report/higherrank1590_spc_report.txt Graphs: http://portal.core.edu.au/core/media/conf_rank_graphs/higherrank1590_spc_graph.png 4 Reference item: \\ IMPORTANT NOTE: In DBLP, both APPROX and RANDOM are grouped together, and using the automatic tool, papers for both conferences APPROX and RANDOM appear under the header "APPROX". 7. International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX) _____________________________________________________________________________________________ This conference was published at 17 times by 7 of 14 experts in the last 5 years. The experts that publish at this conference are: Christian Sohler(1), David P. Woodruff(8), Jan Vondrk(1), Uriel Feige(2), Nikhil Bansal(2), Subhash Khot(2), Prasad Raghavendra(1) In 2015, there were 5 publications by 4 experts: Christian Sohler, Nikhil Bansal, David P. Woodruff, Prasad Raghavendra In 2016, there were 3 publications by 3 experts: Subhash Khot, Uriel Feige, David P. Woodruff In 2017, there were 2 publications by 2 experts: David P. Woodruff, Jan Vondrk In 2018, there were 3 publications by 1 experts: David P. Woodruff In 2019, there were 4 publications by 3 experts: Uriel Feige, David P. Woodruff, Subhash Khot 7 out of the 14 experts published at this conference in 1 or more years 3 out of the 14 experts published at this conference in 2 or more years 1 out of the 14 experts published at this conference in 5 or more years Top People Report Method of selection: As the goal is to identify top people in TCS=Theoretical computer science, I compiled a list of the winners of the Knuth prize and Godel Prize. These are the prizes handed out in the two top conferences in TCS (STOC, FOCS respectively). I used the period 2009-2019, and only included people where I could find the h-index, and where the h-index was at least 45. This process produced 19 people, and I added the last Nevanlinna ward winner Constantinos Daskalakis. Keyword: Godel Prize, Knuth Prize, Nevanlinna Prize 5 name h-index gscholar url David S. Johnson 83 https://scholar.google.com/citations?user=LyEq7qEAAAAJ&hl=iw&oi=ao Gary Miller 60 https://scholar.google.com/citations?user=umm-i20AAAAJ&hl=iw&oi=ao Noam Nisan 72 https://scholar.google.com/citations?user=zXQZPnMAAAAJ&hl=iw&oi=ao Oded Goldreich 91 https://scholar.google.com/citations?user=DLQW_LoAAAAJ&hl=iw&oi=ao Johan HÃěstad 46 https://scholar.google.com/citations?user=n0QrdEMAAAAJ&hl=iw&oi=ao Cynthia Dwork 72 https://scholar.google.com/citations?hl=iw&user=y2H5xmkAAAAJ Avi Wigderson 77 https://scholar.google.com/scholar?hl=iw&as_sdt=0%2C5&q=Avi+Wigderson&btnG= Omer Reingold 51 https://scholar.google.com/citations?user=TD9RhcgAAAAJ&hl=iw&oi=ao Salil Vadhan 63 https://scholar.google.com/citations?user=dqVjyRQAAAAJ&hl=iw&oi=ao Sanjeev Arora 64 https://scholar.google.com/citations?user=RUP4S68AAAAJ&hl=iw&oi=ao Christos Papadimitriou 129 https://scholar.google.com/citations?user=rXYLXJMAAAAJ&hl=iw&oi=ao Tim Roughgarden 61 https://scholar.google.com/citations?user=0lcJYs8AAAAJ&hl=iw&oi=ao ÃĽva Tardos 65 https://scholar.google.com/citations?user=h6jljQQAAAAJ&hl=iw&oi=ao Dan Boneh 120 https://scholar.google.com/citations?user=MwLqCs4AAAAJ&hl=iw&oi=ao Moni Naor 92 https://scholar.google.com/citations?user=stSUaHAAAAAJ&hl=iw&oi=ao Daniel Spielman 56 https://scholar.google.com/citations?user=L82mYv8AAAAJ&hl=iw&oi=ao Frank McSherry 45 https://scholar.google.com/citations?user=YYJ3aycAAAAJ&hl=iw&oi=ao Kobbi Nissim 45 https://scholar.google.com/citations?user=U-RE8IgAAAAJ&hl=iw&oi=ao Oded Regev 46 https://scholar.google.com/citations?user=3-gk0ioAAAAJ&hl=iw&oi=ao Constantinos Daskalakis 47 https://scholar.google.com/citations?user=iTv2cOgAAAAJ&hl=iw&oi=ao Reference item: \\ IMPORTANT NOTE: In DBLP the conferences RANDOM and APPROX are grouped together under the heading "APPROX" and so the relevant part for RANDOM is under the heading "APPROX". 8. International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX) _____________________________________________________________________________________________ This conference was published at 7 times by 6 of 18 experts in the last 5 years. The experts that publish at this conference are: Omer Reingold(1), Oded Regev 0001(2), Kobbi Nissim(1), Salil P. Vadhan(1), Johan Hstad(2), Tim Roughgarden(1) In 2015, there were 2 publications by 2 experts: Oded Regev 0001, Johan Hstad In 2016, there were 1 publications by 1 experts: Johan Hstad In 2017, there were 2 publications by 2 experts: Tim Roughgarden, Oded Regev 0001 In 2019, there were 2 publications by 3 experts: Salil P. Vadhan, Omer Reingold, Kobbi Nissim 6 out of the 18 experts published at this conference in 1 or more years 2 out of the 18 experts published at this conference in 2 or more years WPP Report: http://portal.core.edu.au/core/media/conf_rank_report/higherrank1590_top_people_report.txt Graphs: http://portal.core.edu.au/core/media/conf_rank_graphs/higherrank1590_top_people_graph.png
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]
  • The Next Digital Decade Essays on the Future of the Internet
    THE NEXT DIGITAL DECADE ESSAYS ON THE FUTURE OF THE INTERNET Edited by Berin Szoka & Adam Marcus THE NEXT DIGITAL DECADE ESSAYS ON THE FUTURE OF THE INTERNET Edited by Berin Szoka & Adam Marcus NextDigitalDecade.com TechFreedom techfreedom.org Washington, D.C. This work was published by TechFreedom (TechFreedom.org), a non-profit public policy think tank based in Washington, D.C. TechFreedom’s mission is to unleash the progress of technology that improves the human condition and expands individual capacity to choose. We gratefully acknowledge the generous and unconditional support for this project provided by VeriSign, Inc. More information about this book is available at NextDigitalDecade.com ISBN 978-1-4357-6786-7 © 2010 by TechFreedom, Washington, D.C. This work is licensed under the Creative Commons Attribution- NonCommercial-ShareAlike 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/3.0/ or send a letter to Creative Commons, 171 Second Street, Suite 300, San Francisco, California, 94105, USA. Cover Designed by Jeff Fielding. THE NEXT DIGITAL DECADE: ESSAYS ON THE FUTURE OF THE INTERNET 3 TABLE OF CONTENTS Foreword 7 Berin Szoka 25 Years After .COM: Ten Questions 9 Berin Szoka Contributors 29 Part I: The Big Picture & New Frameworks CHAPTER 1: The Internet’s Impact on Culture & Society: Good or Bad? 49 Why We Must Resist the Temptation of Web 2.0 51 Andrew Keen The Case for Internet Optimism, Part 1: Saving the Net from Its Detractors 57 Adam Thierer CHAPTER 2: Is the Generative
    [Show full text]
  • 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.
    [Show full text]
  • Chicago Journal of Theoretical Computer Science the MIT Press
    Chicago Journal of Theoretical Computer Science The MIT Press Volume 1997, Article 1 12 March 1997 ISSN 1073–0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142 USA; (617)253-2889; [email protected], [email protected]. Published one article at a time in LATEX source form on the Internet. Pag- ination varies from copy to copy. For more information and other articles see: http://www-mitpress.mit.edu/jrnls-catalog/chicago.html • http://www.cs.uchicago.edu/publications/cjtcs/ • ftp://mitpress.mit.edu/pub/CJTCS • ftp://cs.uchicago.edu/pub/publications/cjtcs • Feige and Kilian Limited vs. Polynomial Nondeterminism (Info) The Chicago Journal of Theoretical Computer Science is abstracted or in- R R R dexed in Research Alert, SciSearch, Current Contents /Engineering Com- R puting & Technology, and CompuMath Citation Index. c 1997 The Massachusetts Institute of Technology. Subscribers are licensed to use journal articles in a variety of ways, limited only as required to insure fair attribution to authors and the journal, and to prohibit use in a competing commercial product. See the journal’s World Wide Web site for further details. Address inquiries to the Subsidiary Rights Manager, MIT Press Journals; (617)253-2864; [email protected]. The Chicago Journal of Theoretical Computer Science is a peer-reviewed scholarly journal in theoretical computer science. The journal is committed to providing a forum for significant results on theoretical aspects of all topics in computer science. Editor in chief: Janos Simon Consulting
    [Show full text]
  • The Flajolet-Martin Sketch Itself Preserves Differential Privacy: Private Counting with Minimal Space
    The Flajolet-Martin Sketch Itself Preserves Differential Privacy: Private Counting with Minimal Space Adam Smith Shuang Song Abhradeep Thakurta Boston University Google Research, Brain Team Google Research, Brain Team [email protected] [email protected] [email protected] Abstract We revisit the problem of counting the number of distinct elements F0(D) in a data stream D, over a domain [u]. We propose an ("; δ)-differentially private algorithm that approximates F0(D) within a factor of (1 ± γ), and with additive error of p O( ln(1/δ)="), using space O(ln(ln(u)/γ)/γ2). We improve on the prior work at least quadratically and up to exponentially, in terms of both space and additive p error. Our additive error guarantee is optimal up to a factor of O( ln(1/δ)), n ln(u) 1 o and the space bound is optimal up to a factor of O min ln γ ; γ2 . We assume the existence of an ideal uniform random hash function, and ignore the space required to store it. We later relax this requirement by assuming pseudo- random functions and appealing to a computational variant of differential privacy, SIM-CDP. Our algorithm is built on top of the celebrated Flajolet-Martin (FM) sketch. We show that FM-sketch is differentially private as is, as long as there are p ≈ ln(1/δ)=(εγ) distinct elements in the data set. Along the way, we prove a structural result showing that the maximum of k i.i.d. random variables is statisti- cally close (in the sense of "-differential privacy) to the maximum of (k + 1) i.i.d.
    [Show full text]
  • (L ,J SEP 3 0 2009 LIBRARIES
    Nearest Neighbor Search: the Old, the New, and the Impossible by Alexandr Andoni Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY September 2009 © Massachusetts Institute of Technology 2009. All rights reserved. Author .............. .. .. ......... .... ..... ... ......... ....... Department of Electrical Engineering and Computer Science September 4, 2009 (l ,J Certified by................ Piotr I/ yk Associate Professor Thesis Supervisor Accepted by ................................ /''~~ Terry P. Orlando Chairman, Department Committee on Graduate Students MASSACHUSETTS PaY OF TECHNOLOGY SEP 3 0 2009 ARCHIVES LIBRARIES Nearest Neighbor Search: the Old, the New, and the Impossible by Alexandr Andoni Submitted to the Department of Electrical Engineering and Computer Science on September 4, 2009, in partial fulfillment of the requirements for the degree of Doctor of Philosophy Abstract Over the last decade, an immense amount of data has become available. From collections of photos, to genetic data, and to network traffic statistics, modern technologies and cheap storage have made it possible to accumulate huge datasets. But how can we effectively use all this data? The ever growing sizes of the datasets make it imperative to design new algorithms capable of sifting through this data with extreme efficiency. A fundamental computational primitive for dealing with massive dataset is the Nearest Neighbor (NN) problem. In the NN problem, the goal is to preprocess a set of objects, so that later, given a query object, one can find efficiently the data object most similar to the query. This problem has a broad set of applications in data processing and analysis.
    [Show full text]
  • 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.
    [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]
  • Hard Communication Channels for Steganography
    Hard Communication Channels for Steganography Sebastian Berndt1 and Maciej Liśkiewicz2 1 University of Lübeck, Lübeck, Germany [email protected] 2 University of Lübeck, Lübeck, Germany [email protected] Abstract This paper considers steganography – the concept of hiding the presence of secret messages in legal communications – in the computational setting and its relation to cryptography. Very re- cently the first (non-polynomial time) steganographic protocol has been shown which, for any communication channel, is provably secure, reliable, and has nearly optimal bandwidth. The security is unconditional, i.e. it does not rely on any unproven complexity-theoretic assumption. This disproves the claim that the existence of one-way functions and access to a communication channel oracle are both necessary and sufficient conditions for the existence of secure steganogra- phy in the sense that secure and reliable steganography exists independently of the existence of one-way functions. In this paper, we prove that this equivalence also does not hold in the more realistic setting, where the stegosystem is polynomial time bounded. We prove this by construct- ing (a) a channel for which secure steganography exists if and only if one-way functions exist and (b) another channel such that secure steganography implies that no one-way functions exist. We therefore show that security-preserving reductions between cryptography and steganography need to be treated very carefully. 1998 ACM Subject Classification E.3 Data Encryption Keywords and phrases provable secure steganography, cryptographic assumptions, pseudoran- dom functions, one-way functions, signature schemes Digital Object Identifier 10.4230/LIPIcs.ISAAC.2016.16 1 Introduction Digital steganography has recently received substantial interest in modern computer science since it allows secret communication without revealing its presence.
    [Show full text]
  • Approximation, Randomization, and Combinatorial Optimization
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 17th International Workshop, APPROX 2014, and 18th International Workshop, RANDOM 2014 September 4–6, 2014, Barcelona, Spain Edited by Klaus Jansen José D. P. Rolim Nikhil R. Devanur Cristopher Moore LIPIcs – Vol. 28 – APPROX/RANDOM’14 www.dagstuhl.de/lipics Editors Klaus Jansen José D. P. Rolim University of Kiel University of Geneva Kiel Geneva [email protected] [email protected] Nikhil R. Devanur Cristopher Moore Microsoft Research Santa Fe Institute Redmond New Mexico [email protected] [email protected] ACM Classification 1998 C.2.1 Network Architecture and Design, C.2.2 Computer-communication, E.4 Coding and Information Theory, F. Theory of Computation, F.1.0 Computation by Abstract Devices, F.1.1 Models of Computation – relations between models, F.1.2 Modes of Computation, F.1.3 Complexity Measures and Classes, F.2.0 Analysis of Algorithms and Problem Complexity, F.2.1 Numerical Algorithms and Problems, F.2.2 Nonnumerical Algorithms and Problems G.1.2 Approximation, G.1.6 Optimization, G.2 Discrete Mathematics, G.2.1 Combinatorics, G.2.2 Graph Theory, G.3 Probability and Statistics, I.1.2 Algorithms, J.4 Computer Applications – Social and Behavioral Sciences ISBN 978-3-939897-74-3 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-939897-74-3. Publication date September, 2014 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.
    [Show full text]
  • Algebraic Pseudorandom Functions with Improved Efficiency from the Augmented Cascade*
    Algebraic Pseudorandom Functions with Improved Efficiency from the Augmented Cascade* DAN BONEH† HART MONTGOMERY‡ ANANTH RAGHUNATHAN§ Department of Computer Science, Stanford University fdabo,hartm,[email protected] September 8, 2020 Abstract We construct an algebraic pseudorandom function (PRF) that is more efficient than the classic Naor- Reingold algebraic PRF. Our PRF is the result of adapting the cascade construction, which is the basis of HMAC, to the algebraic settings. To do so we define an augmented cascade and prove it secure when the underlying PRF satisfies a property called parallel security. We then use the augmented cascade to build new algebraic PRFs. The algebraic structure of our PRF leads to an efficient large-domain Verifiable Random Function (VRF) and a large-domain simulatable VRF. 1 Introduction Pseudorandom functions (PRFs), first defined by Goldreich, Goldwasser, and Micali [GGM86], are a fun- damental building block in cryptography and have numerous applications. They are used for encryption, message integrity, signatures, key derivation, user authentication, and many other cryptographic mecha- nisms. Beyond cryptography, PRFs are used to defend against denial of service attacks [Ber96, CW03] and even to prove lower bounds in learning theory. In a nutshell, a PRF is indistinguishable from a truly random function. We give precise definitions in the next section. The fastest PRFs are built from block ciphers like AES and security is based on ad-hoc inter- active assumptions. In 1996, Naor and Reingold [NR97] presented an elegant PRF whose security can be deduced from the hardness of the Decision Diffie-Hellman problem (DDH) defined in the next section.
    [Show full text]
  • Hardness of Non-Interactive Differential Privacy from One-Way
    Hardness of Non-Interactive Differential Privacy from One-Way Functions Lucas Kowalczyk* Tal Malkin† Jonathan Ullman‡ Daniel Wichs§ May 30, 2018 Abstract A central challenge in differential privacy is to design computationally efficient non-interactive algorithms that can answer large numbers of statistical queries on a sensitive dataset. That is, we would like to design a differentially private algorithm that takes a dataset D Xn consisting of 2 some small number of elements n from some large data universe X, and efficiently outputs a summary that allows a user to efficiently obtain an answer to any query in some large family Q. Ignoring computational constraints, this problem can be solved even when X and Q are exponentially large and n is just a small polynomial; however, all algorithms with remotely similar guarantees run in exponential time. There have been several results showing that, under the strong assumption of indistinguishability obfuscation (iO), no efficient differentially private algorithm exists when X and Q can be exponentially large. However, there are no strong separations between information-theoretic and computationally efficient differentially private algorithms under any standard complexity assumption. In this work we show that, if one-way functions exist, there is no general purpose differen- tially private algorithm that works when X and Q are exponentially large, and n is an arbitrary polynomial. In fact, we show that this result holds even if X is just subexponentially large (assuming only polynomially-hard one-way functions). This result solves an open problem posed by Vadhan in his recent survey [Vad16]. *Columbia University Department of Computer Science.
    [Show full text]