ebook img

Advances in Cryptology – CRYPTO 2012: 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings PDF

902 Pages·2012·12.273 MB·English
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Advances in Cryptology – CRYPTO 2012: 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings

Lecture Notes in Computer Science 7417 CommencedPublicationin1973 FoundingandFormerSeriesEditors: GerhardGoos,JurisHartmanis,andJanvanLeeuwen EditorialBoard DavidHutchison LancasterUniversity,UK TakeoKanade CarnegieMellonUniversity,Pittsburgh,PA,USA JosefKittler UniversityofSurrey,Guildford,UK JonM.Kleinberg CornellUniversity,Ithaca,NY,USA AlfredKobsa UniversityofCalifornia,Irvine,CA,USA FriedemannMattern ETHZurich,Switzerland JohnC.Mitchell StanfordUniversity,CA,USA MoniNaor WeizmannInstituteofScience,Rehovot,Israel OscarNierstrasz UniversityofBern,Switzerland C.PanduRangan IndianInstituteofTechnology,Madras,India BernhardSteffen TUDortmundUniversity,Germany MadhuSudan MicrosoftResearch,Cambridge,MA,USA DemetriTerzopoulos UniversityofCalifornia,LosAngeles,CA,USA DougTygar UniversityofCalifornia,Berkeley,CA,USA GerhardWeikum MaxPlanckInstituteforInformatics,Saarbruecken,Germany Reihaneh Safavi-Naini Ran Canetti (Eds.) Advances in Cryptology – CRYPTO 2012 32nd Annual Cryptology Conference Santa Barbara, CA, USA, August 19-23, 2012 Proceedings 1 3 VolumeEditors ReihanehSafavi-Naini UniversityofCalgary,DepartmentofComputerScience 2500UniversityDriveNW,Calgary,ABT2N1N4,Canada E-mail:[email protected] RanCanetti BostonUniversity,DepartmentofComputerScience 111CummingtonStreet,Boston,MA02215,USA E-mail:[email protected] and TelAvivUniversity,BlavatnikSchoolofComputerScience TelAviv,Israel E-mail:[email protected] ISSN0302-9743 e-ISSN1611-3349 ISBN978-3-642-32008-8 e-ISBN978-3-642-32009-5 DOI10.1007/978-3-642-32009-5 SpringerHeidelbergDordrechtLondonNewYork LibraryofCongressControlNumber:2012942915 CRSubjectClassification(1998):E.3,G.2.1,F.2.1-2,D.4.6,K.6.5,C.2,J.1 LNCSSublibrary:SL4–SecurityandCryptology ©InternationalAssociationforCryptologicResearch2012 Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting, reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965, initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable toprosecutionundertheGermanCopyrightLaw. Theuseofgeneraldescriptivenames,registerednames,trademarks,etc.inthispublicationdoesnotimply, evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevantprotectivelaws andregulationsandthereforefreeforgeneraluse. Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India Printedonacid-freepaper SpringerispartofSpringerScience+BusinessMedia(www.springer.com) Preface CRYPTO2012,the32ndAnnualInternationalCryptologyConference,washeld August19–23onthecampusoftheUniversityofCalifornia,SantaBarbara.The event was sponsored by the International Association for Cryptologic Research (the IACR) in cooperation with the UCSB Computer Science Department and the IEEE Computer Society’s Technical Committee on Security and Privacy. We received 225 submissions of which 48 were accepted for publication, a record number for IACR flagship conferences. These proceedings contains the revised versions of all the papers. One pair of papers shared a single presenta- tionslotintheprogram(markedinthe Table ofContents).Therewerealsotwo invited talks. On Monday, Jonathan Zittrain, Professor of Law and Computer Science at Harvard University, gave a talk entitled “The End of Crypto.” On Wednesday,ErnieBrickell,ChiefSecurityArchitectforIntelCorporation,spoke about“RecentAdvancesandExistingResearchQuestionsinPlatformSecurity.” To accommodate the increase in the number of accepted papers, one paper pre- sentation session was planned on the traditionally free Tuesday afternoon. This session was followed by a tutorial session on differential privacy, entitled “Pin- ning Down ‘Privacy’ in Statistical Databases: A Tutorial,” delivered by Adam Smith. The rump session was as usual on Tuesday evening, and was chaired by Dan Bernstein and Tanja Lange. Our goal was to have a technical program that is strong and representative of the diversity and breadth of cryptologic research. Toward this goal we took a number of steps including selecting a large Program Committee (PC) with diverseresearchinterestandexperience,andinthe CallforPapers,encouraging submissions in all areas of cryptology with emphasis on innovative application and approaches. Papers were reviewed double-blind, with non-PC-member pa- persassignedtothreereviewers,andPCmemberpaperstofourreviewers.Dur- ing the discussion phase, when necessary, extra reviews were solicited. As part of paper discussion phase we held a PC meeting at Cambridge, UK, collocated with Eurocrypt 2012. We ensured that all papers received fair and objective evaluationby experts and also a broadergroupof PC members, with particular attention paid to highlighting strengths and weaknessesof papers.The final de- cisions were made based on the reviews and discussion, and in the case of two “equal” papers, taking other factors such as balance of the program into ac- count.Inthecaseofambiguitywerelayedquestionsofreviewerstoauthors,and delivered back the responses,with all communications anonymized. The task of paper selection was especially challenging given the high number of strong sub- missions.In the end, asizable number ofstrongpaperscouldnotbe included in the programfor lack of space. For the Best Paper Award, the PC overwhelmingly selected “Efficient Dis- sectionofComposite Problems,withApplications to Cryptanalysis,Knapsacks, VI Preface and Combinatorial Search Problems,” by Itai Dinur, Orr Dunkelman, Nathan Keller, and Adi Shamir. The PC praised the work for important cryptographic applicationsinsymmetric cryptographyandpublic-keycryptography,as wellas applications to other combinatorial problems. We would like to sincerely thank authors of all submissions – those whose paper made it into the program and those whose papers did not. We and the PC as a whole were impressed by the quality of submissions contributed from all around the world. Although this made the task of selecting the final list very challenging, it gave us the opportunity to have a very strong and diverse program. Our sincere gratitude also goes out to the PC. We were extremely fortunate that so many brilliant people put such an inordinate amount of time not only in writing reviews, but also actively participating in discussions for nearly six weeks. They responded promptly to our requests for extra reviews, opinions, comments,comparisonsandinputs.Wewereextremelyimpressedbytheknowl- edge, dedication, and integrity of our PC. We are also indebted to the many external reviewers who significantly contributed to the comprehensive evalua- tion of papers. A list of PC members and external reviewers appears after this note. Despite all our efforts, the list of external reviewers may have errors or omissions and we apologize for that. WewouldliketothankYiqunLisaYin,theGeneralChair,forworkingclosely with us throughout the whole process, providing the much-needed support in every step, including creating and maintaining the website, and planning and organizing the logistics of the PC meeting and the conference. WebenefitedenormouslyfromadviceandfeedbackofthepastCRYPTOPro- gramChairs,PhilRogaway,TalRabin,andShaiHalevi.Theygenerouslyshared with us their experiences that enabled us to take more informed decisions. Shai Halevi also provided us with unlimited support of his software websubrev that we used for the whole conference planning, paper evaluation, and interaction with PC members and authors. Josh Benaloh was our IACR point of contact, always providing timely and informative answers to our questions. Alfred Hof- mannandhiscolleaguesatSpringerprovidedameticulousserviceforthetimely production of this volume. We would like to thank Google, Microsoft Research, Qualcomm, RIM, and Voltage Security for their generous support. Serving as CRYPTO Program Co-chairs was a privilege and also a great challenge.This was the first year that CRYPTO was to implement Co-chairing, with Rei serving as Senior Co-chair, having tie-breaker decision role. Despite many unknowns and the need for extra effort to define the processes and order of things in Co-chairing,in the end it was a great opportunity to work together and build on our strengths. We are happy that we took the challenge and along the way found new friendships in addition to the running of the conference. June 2012 Rei Safavi-Naini Ran Canetti CRYPTO 2012 The 32nd Annual International Cryptology Conference Santa Barbara,California, USA August 19–23,2012 Sponsored by the International Association of Cryptologic Research (IACR) in cooperation with the Computer Science Department of the University of California, Santa Barbara and the IEEE Computer Society’s Technical Committee on Security and Privacy General Chair Yiqun Lisa Yin Independent Security Consultant, USA Program Co-chairs Rei Safavi-Naini University of Calgary, Canada Ren Canetti Boston University (USA) and Tel Aviv University (Israel) Program Committee Benny Applebaum Tel Aviv University, Israel Dan Boneh Stanford, USA Colin Boyd QUT, Australia Ivan Damg˚ard Aarhus University, Denmark Yevgeniy Dodis New York University, USA Serge Fehr CWI Amsterdam, The Netherlands C´edric Fournet Microsoft Research, UK Marc Fischlin Darmstadt University of Technology, Germany Pierre-Alain Fouque E´cole Normale Sup´erieure, France Juan Garay AT&T Labs - Research, USA Steven Galbraith The University of Auckland, New Zealand Jens Groth University College London, UK Susan Hohenberger Johns Hopkins University, USA Yuval Ishai Technion, Israel Ari Juels RSA Laboratories,USA VIII CRYPTO 2012 Yael Kalai Microsoft Research, USA Hugo Krawczyk IBM Research, USA Ralf Ku¨sters University of Trier, Germany Aggelos Kiayias University of Connecticut, USA Kaoru Kurosawa Ibaraki University, Japan Stefan Lucks Bauhaus-Universita¨tWeimar, Germany Tal Malkin Columbia University, USA Alexander May Ruhr University Bochum, Germany Daniele Micciancio University of California at San Diego, USA Kaisa Nyberg Aalto University and Nokia, Finland Tatsuaki Okamoto NTT, Japan Kenny Paterson Royal Holloway, University of London, UK Chris Peikert Georgia Tech, USA Thomas Peyrin Nanyang TechnologicalUniversity, Singapore Renato Renner ETH Zurich, Switzerland Palash Sarkar Indian Statistical Institute, Kolkata, India Franc¸ois-Xavier Standaert UCL, Belgium Damien Stehl´e CNRS and ENS de Lyon, France Thomas Shrimpton Portland State University, USA Tsuyoshi Takagi Kyushu University, Japan Eran Tromer Tel Aviv University, Israel Dominique Unruh University of Tartu, Estonia Vinod Vaikuntanathan University of Toronto, Canada Advisory Member Phil Rogaway (CRYPTO 2011 ProgramChair) University of California, Davis, USA External Reviewers Masayuki Abe Santiago Zanella Zvika Brakerski Hadi Ahmadi Beguelin Christina Brzuska Mohsen Alimomeni Amos Beimel Ignacio Cascudo Jacob Alperin-Sheriff Mihir Bellare David Cash Elena Andreeva Rikke Bendlin Nathan Chenette Kazumaro Aoki Mario Berta Jung Hee Cheon Yoshinori Aono Rishiraj Bhattacharyya Alessandro Chiesa Gilad Asharov Nir Bitansky Ashish Choudhury Jean-Philippe Aumasson C´eline Blondeau Baudoin Collard Paul Baecher Andrey Bogdanov Jason Crampton Thomas Baign`eres Joppe W. Bos Cas Cremers Josep Balasch Niek Bouman Dana Dachman-Soled Stephanie Bayer Xavier Boyen George Danezis Normand Beaudry Elette Boyle Anindya De CRYPTO 2012 IX Jean Paul Degabriele Brett Hemenway Marine Minier Yi Deng Gottfried Herold Arno Mittelbach Claus Diem Alejandro Hevia Payman Mohassel Jintai Ding Martin Hirt Nicky Mouha Dejan Dukaric Viet Tung Hoang Sean Murphy Frederic Dupuis Dennis Hofheinz Steve Myers Junfeng Fan Pavel Hubacek David Naccache Pooya Farshim Yuval Ishai Jesper Buus Nielsen Sebastian Faust Mitsugu Iwamoto Ryo Nishimaki Dario Fiore Abhishek Jain Kobbi Nissim Ewan Fleischmann Stanislaw Jarecki Peter Nordholdt Christian Forler Pascal Junod Adam O’Neill David Freeman Charanjit Jutla Wakaha Ogata Eduarda Freire Kimmo J¨arvinen Cristina Onete Georg Fuchsbauer Nikos Karvelas Claudio Orlandi Eiichiro Fujisaki Jonathan Katz Carles Padro Jakob Funder Yutaka Kawai Bryan Parno Jun Furukawa Eike Kiltz Rafael Pass Ariel Gabizon Susumu Kiyoshima Valerio Pastro Tommaso Gagliardoni Franc¸ois Koeune Arpita Patra David Galindo Markulf Kohlweiss Olivier Pereira Sanjam Garg Vladimir Kolesnikov Paolo Palmieri Pierrick Gaudry Sara Krehbiel Olivier Pereira Peter Gazi Virendra Kumar Ludovic Perret Rosario Gennaro Noboru Kunihiro Thomas Peters Wesley George Fabien Laguillaumie Christophe Petit Benoit Gerard Adeline Langlois Le Trieu Phong Benedikt Gierlichs Gregor Leander Krzysztof Pietrzak Ian Goldberg Anja Lehmann Benny Pinkas Sharon Goldberg Allison Lewko Christopher Portmann Alonso Gonzalez Benoit Libert Manoj Prabhakaran Serge Gorbunov Rachel Lin Gordon Proctor Dov Gordon Yehuda Lindell Xavier Pujol Vipul Goyal Adriana Lopez-Alt Tal Rabin Jian Guo Edward Lui Charles Rackoff Robbert de Haan Vadim Lyubashevsky Ananth Raghunathan Iftach Haitner Bernardo Machado Tamara Rezk Shai Halevi David Tom Ristenpart Risto Hakala Mark Manulis Matt Robshaw Keisuke Hakuta Giorgia Azzurra Marson Yannis Rouselakis Goichiro Hanaoka Ryutaro Mastumoto Amit Sahai Guillaume Hanrot Takahiro Matsuda Yusuke Sakai Yasufumi Hashimoto Florian Mendel Kazuo Sakiyama Taku Hayashi Bart Mennink Katerina Samari Carmit Hazay Alexander Meurer Yu Sasaki X CRYPTO 2012 Christian Schaffner Stefano Tessaro Hoeteck Wee Thomas Schneider Enrico Thomae Lei Wei Dominique Schroeder Emmanuel Thom´e Jakob Wenzel Jacob Schuldt Susan Thomson Daniel Wichs Sven Scha¨ge Marco Tomamichel Douglas Wikstrom Gil Segev Nikos Triandopoulos Christopher Wolf Abhi Shelat Yiannis Tselekounis David Woodruff Chih-hao Shen Max Tuengerthal Shota Yamada Dave Singel´ee Jon Ullman Go Yamamoto Adam Smith Yevgeniy Vahlis Takanori Yasuda Ben Smith Margarita Vald Tomoko Yonemura Douglas Stebila Serge Vaudenay Kazuki Yoneyama Emil Stefanov Muthu Yu Yu John Steinberger Venkitasubramaniam Hila Zarosim Ron Steinfeld Daniele Venturi Mark Zhandry Uri Stemmer Ivan Visconti Mingwu Zhang Paul Syverson Andreas Vogt Hong-Sheng Zhou Bjoern Tackmann Felipe Voloch Vassilis Zikas Katsuyuki Takashima Michael Walter Angela Zottarel Qiang Tang Bogdan Warinschi Aris Tentes Gaven Watson Table of Contents Symmetric Cryptosystems An Enciphering Scheme Based on a Card Shuffle..................... 1 Viet Tung Hoang, Ben Morris, and Phillip Rogaway Tweakable Blockciphers with Beyond Birthday-Bound Security ........ 14 Will Landecker, Thomas Shrimpton, and R. Seth Terashima Breaking and Repairing GCM Security Proofs ....................... 31 Tetsu Iwata, Keisuke Ohashi, and Kazuhiko Minematsu On the Distribution of Linear Biases: Three Instructive Examples...... 50 Mohamed Ahmed Abdelraheem, Martin ˚Agren, Peter Beelen, and Gregor Leander Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs............................................... 68 Eric Miles and Emanuele Viola Invited Talk The End of Crypto............................................... 86 Jonathan Zittrain Secure Computation I Must You Know the Code of f to Securely Compute f?............... 87 Mike Rosulek Adaptively Secure Multi-Party Computation with Dishonest Majority........................................................ 105 Sanjam Garg and Amit Sahai Collusion-PreservingComputation ................................. 124 Jo¨el Alwen, Jonathan Katz, Ueli Maurer, and Vassilis Zikas Secret Sharing Schemes for Very Dense Graphs ...................... 144 Amos Beimel, Oriol Farra`s, and Yuval Mintz

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.