BUSEC Publications

2015

  • Cryptographic Theory Meets Practice: Efficient and Privacy-Preserving Payments for Public Transport. Andy Rupp, Foteini Baldimtsi, Gesine Hinterwälder and Christof Paar ACM-TISSEC 2015
  • Sorting and Searching Behind the Curtain. Foteini Baldimtsi and Olga Ohrimenko Financial Cryptography (FC) 2015
  • Anonymous Transferable E-Cash. Foteini Baldimtsi, Melissa Chase, Georg Fuchsbauer, Markulf Kohlweiss PKC 2015
  • Recovering Lost Device-Bound Credentials. Foteini Baldimtsi, Jan Camenisch, Lucjan Hanzlik, Stephan Krenn, Anja Lehmann, Gregory Neven ACNS 2015
  • Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation. Ran Canetti, Shafi Goldwasser, Oxana Poburinnaya TCC 2015: 557-585
  • Why Is It Taking So Long to Secure Internet Routing?. Sharon Goldberg. The Communications of the ACM (ACM Queue) ACM Queue: October 2014.
  • NSEC5: Provably Preventing DNSSEC Zone Enumeration. Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin, Sachin Vasant, Asaf Ziv NDSS’15.: San Deigo, CA. Feb 2015.
  • Resettably Sound Zero-Knowledge Arguments from OWFs – The (Semi) Black-Box Way. Rafail Ostrovsky, Alessandra Scafuro, Muthuramakrishnan Venkitasubramaniam TCC (1) 2015: 345-374. March 2015.
  • draft-vcelak-nsec5-00: NSEC5, DNSSEC Authenticated Denial of Existence. Jan Včelák and Sharon Goldberg (with contributors Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin, Ondřej Surý, Sachin Vasant and Asaf Ziv) IETF Internet Draft. Submitted to IETF’92, Dallas, TX: March 2015.
  • Loopholes for Circumventing the Constitution: Unrestrained Bulk Surveillance on Americans by Collecting Network Traffic Abroad. Axel Arnbak and Sharon Goldberg Michigan Telecommunications and Technology Law Review (MTTLR): Vol 21(2), May 2015.
  • Garbled RAM From One-Way Functions. Sanjam Garg, Steve Lu, Rafail Ostrovsky, Alessandra Scafuro STOC 2015: 449-458. June 2015.
  • Round-Optimal Black-Box Two-Party Computation. Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro CRYPTO (2) 2015: 339-358. August 2015.
  • Eclipse Attacks on Bitcoin’s Peer-to-Peer Network. Ethan Heilman, Alison Kendler, Aviv Zohar, Sharon Goldberg 24th USENIX Security Symposium: Washington, DC., August 2015.

2014

  • Obfuscation for Evasive Functions. Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai TCC 2014: 26-51. February 2014.
  • Protecting Obfuscation Against Algebraic Attacks. Boaz Barak, Sanjam Garg, Yael Tauman Kalai, Omer Paneth, Amit Sahai. EUROCRYPT 2014: 221-238. May 2014.
  • Multi-Input Functional Encryption. Shafi Goldwasser, S. Dov Gordon, Vipul Goyal, Abhishek Jain, Jonathan Katz, Feng-Hao Liu, Amit Sahai, Elaine Shi, Hong-Sheng Zhou. EUROCRYPT 2014: 578-602. May 2014.
  • From the Consent of the Routed: Improving the Transparency of the RPKI
 Ethan Heilman, Danny Cooper, Leonid Reyzin and Sharon Goldberg. SIGCOMM ’14, Chicago, IL. August 2014.
  • Calibrating Data to Sensitivity in Private Data Analysis, a Platform for Differentially-Private Analysis of Weighted Datasets Sharon Goldberg, Frank McSherry, and Davide Proserpio. VLDB ’14, Hangzhou, China, September 2014. Full version VLDB version
  • On Strong Simulation and Composable Point Obfuscation. Nir Bitansky, Ran Canetti. J. Cryptology 27(2): 317-357 (2014)
  • Verifiable Set Operations over Outsourced Databases. Ran Canetti, Omer Paneth, Dimitrios Papadopoulos, Nikos Triandopoulos. Public Key Cryptography 2014: 113-130
  • Key Derivation from Noisy Sources with More Errors than Entropy. Ran Canetti, Benjamin Fuller, Omer Paneth, and Leonid Reyzin. Full Paper Slides
  • TRUESET: Faster Verifiable Set Computations. Ahmed Kosba, Dimitrios Papadopoulos, Babis Papamanthou, Mahmoud Sayed, Elaine Shi and Nikos Triandopoulos. USENIX Security 2014.
  • Taking Authenticated Range Queries to Arbitrary Dimensions. Dimitrios Papadopoulos, Stavros Papadopoulos, Nikos Triandopoulos. ACM CCS 2014

2013

  • The Diffusion of Networking Technologies. Sharon Goldberg and Zhenming Liu. SODA ’13, New York, NY. January 2013. Paper Slides Blog Post Video of Harvard CRCS Seminar
  • Public-Coin Concurrent Zero-Knowledge in the Global Hash Model. Ran Canetti, Huijia Lin, Omer Paneth. TCC 2013: 80-99. March 2013.
  • Succinct Non-Interactive Arguments via Linear Interactive Proofs. Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth. TCC 2013: 315-333. March 2013.
  • On the Impossibility of Approximate Obfuscation and Applications to Resettable Cryptography. Nir Bitansky, Omer Paneth. STOC 2013: 241-250. June 2013.
  • Recursive Composition and Bootstrapping for SNARKS and Proof-Carrying Data. Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer. STOC 2013: 111-120. June 2013.
  • Is the Juice Worth the Squeeze? BGP Security in Partial Deployment. Robert Lychev, Sharon Goldberg, Michael Schapira. SIGCOMM ’13
  • On the Risk of Misbehaving RPKI Authorities. Danny Cooper, Ethan Heilman, Kyle Brogle, Leonid Reyzin and Sharon Goldberg. HotNets-XII, College Park, MD. November 2013. Awarded a 2014 IETF/IRTF Applied Networking Research Prize. Full Paper Short HotNets paper Project page
  • Mercurial Commitments with Applications to Zero-Knowledge Sets. Melissa Chase, Alexander Healy, Anna Lysyanskaya, Tal Malkin, Leonid Reyzin. J. Cryptology 26(2): 251-279 (2013)
  • Delegatable Pseudorandom Functions and Applications. Aggelos Kiayias, Stavros Papadopoulos, Nikos Triandopoulos, Thomas Zacharias. ACM Conference on Computer and Communications Security 2013: 669-684. November 2013.
  • Computational Fuzzy Extractors. Benjamin Fuller, Xianrui Meng, and Leonid Reyzin. AISACRYPT’13. December 2013. Paper
  • Constant-Round Concurrent Zero Knowledge in the Bounded Player Model. Vipul Goyal, Abhishek Jain, Rafail Ostrovsky, Silas Richelson, Ivan Visconti. ASIACRYPT (1) 2013: 21-40.
  • Verifiable Set Operations over Outsourced Databases. Ran Canetti, Omer Paneth, Dimitris Papadopoulos, and Nikos Triandopoulos. Public Key Cryptography, 2013
  • A (Not) NICE Way to Verify the OpenFlow Switch Specification. Natali Ruchansky and Davide Proserpio. SIGCOMM ’13, Hong Kong, August 2013. Full Paper
  • The Rise of the Sharing Economy: Estimating the Impact of Airbnb on the Hotel Industry. John W. Byers, Davide Proserpio, and Georgios Zervas. WISE ’13, Milan, Italy, December 2013. Abstract Full Paper
  • On the Power of Nonuniformity in Proofs of Security. Kai-Min Chung, Huija Lin, Mohammad Mahmoody, Rafael Pass. TCC ’13.
  • Refereed Delegation of Computation. Ran Canetti, Ben Riva, Guy N. Rothblum. Inf. Comput. 226: 16-36 (2013)
  • Concurrent Zero Knowledge in the Bounded Player Model. Vipul Goyal, Abhishek Jain, Rafail Ostrovsky, Silas Richelson, Ivan Visconti. TCC 2013: 60-79
  • Why “Fiat-Shamir for Proofs” Lacks a Proof. Nir Bitansky, Dana Dachman-Soled, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Adriana López-Alt, Daniel Wichs. TCC 2013: 182-201
  • From Unprovability to Environmentally Friendly Protocols. Ran Canetti, Huija Lin, Rafael Pass. FOCS ’13
  • Constant-Round Concurrent Zero Knowledge from P-Certificates. Kai-Min Chung, Huijia Lin, Rafael Pass. FOCS 2013: 50-59
  • Regularity of Lossy RSA on Subdomains and Its Applications. Mark Lewko, Adam O’Neill and Adam Smith. EUROCRYPT ’13
  • On Concurrently Secure Computation in the Multiple Ideal Query Model. Vipul Goyal, Abhishek Jain. EUROCRYPT 2013: 684-701
  • Amplification of Chosen-Ciphertext Security. Huijia Lin, Stefano Tessaro. EUROCRYPT 2013: 503-519
  • On the Achievability of Simulation-Based Security for Functional Encryption. Angelo De Caro, Vincenzo Iovino, Abhishek Jain, Adam O’Neill, Omer Paneth, Giuseppe Persiano. CRYPTO 2013. CRYPTO (2) 2013: 519-535
  • Semantically-Secure Functional Encryption: Possibility Results, Impossibility Results, and the Quest for a General Definition. M. Bellare and A. O’Neill. CANS ’13
  • Secure Computation Against Adaptive Auxiliary Information. Elette Boyle, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Amit Sahai. CRYPTO (1) 2013: 316-334
  • What Information Is Leaked Under Concurrent Composition? Vipul Goyal, Divya Gupta, Abhishek Jain. CRYPTO (2) 2013: 220-238

2012

  • Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits. Nir Bitansky, Alessandro Chiesa. CRYPTO 2012: 255-272
  • Point Obfuscation and 3-Round Zero-Knowledge. Nir Bitansky, Omer Paneth. TCC 2012:190-208
  • Provable Security of S-BGP and Other Path Vector Protocols: Model, Analysis and Extensions. Alexandra Boldyreva, Robert Lychev. ACM Conference on Computer and Communications Security 2012: 541-552
  • Sequential Aggregate Signatures with Lazy Verification from Trapdoor Permutations. Kyle Brogle, Sharon Goldberg, and Leonid Reyzin. AISACRYPT 2012. Beijing, China. Dec 2012. project page Cryptology ePrint Archive: Report 2011/222 slides
  • A Unified Approach to Deterministic Encryption and a Connection Computational Entropy. Benjamin Fuller, Adam O’Neill Leonid Reyzin. To appear at Theory of Cryptography 2012. Full version available on IACR ePrint.
  • Modeling on Quicksand: Dealing with the Scarcity of Ground Truth in Interdomain Routing Data. Phillipa Gill, Michael Schapira, and Sharon Goldberg. ACM Computer Communication Review. Jan. 2012. article
  • Technology Diffusion in Communication Networks. Sharon Goldberg and Zhenming Liu. February 2012. Arxiv Report 1202.2928. blog post Bellair’s workshop 2012 slides
  • Leakage-Tolerant Interactive Protocols. Nir Bitansky, Ran Canetti, Shai Halevi. TCC 2012: 266-284
  • Black-Box Constructions of Composable Protocols Without Set-Up. Huijia Lin, Rafael Pass. CRYPTO 2012: 461-478
  • Black-Box Constructions of Composable Protocols Without Set-Up.. Huijia Lin, Rafael Pass. CRYPTO 2012: 461-478
  • Network Destabilizing Attacks. Robert Lychev, Sharon Goldberg and Michael Schapira. To appear as a brief announcement in PODC’12. Arxiv Report 1203.1281
  • A Unified Framework for UC from Only OT. Rafael Pass, Huijia Lin, Muthuramakrishnan Venkitasubramaniam. ASIACRYPT 2012: 699-717. December 2012.

2011

  • Towards a Game Theoretic View of Secure Computation. Gilad Asharov, Ran Canetti, Carmit Hazay. eurocrypt 2011. http://eprint.iacr.org/2011/137.
  • Program Obfuscation with Leaky Hardware. Nir Bitansky, Ran Canetti, Shai Halevi, Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum. Asiacrypt 2011.
  • Practical Delegation of Computation Using Multiple Servers. Ran Canetti, Ben Riva, Guy N. Rothblum. ACM CCS 2011. eprint.iacr.org/2010/414.
  • Refereed Delegation of Computation. Ran Canetti, Ben Riva, Guy N. Rothblum. Manuscript.
  • Let the Market Drive Deployment: A Strategy for Transitioning to BGP Security. Phillipa Gill, Michael Schapira, and Sharon Goldberg. Proc. ACM SIGCOMM (SIGCOMM’10), Toronto, Canada, August 2011.  project page extended abstract full version
  • Some Notions of Entropy for Cryptography. Leonid Reyzin. A short survey paper and invited talk (slides available) at ICITS 2011. Link.
  • Constant-Round Non-Malleable Commitments from Any One-Way Function. Huijia Lin, Rafael Pass. STOC 2011: 705-714. June 2011.

2010

  • Privacy Amplification with Asymptotically Optimal Entropy Loss. Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky, and Leonid Reyzin. Link.
  • How Secure are Secure Interdomain Routing Protocols? Sharon Goldberg, Michael Schapira, Pete Hummon, and Jennifer Rexford. Proc. ACM SIGCOMM (SIGCOMM’10), New Delhi, India, August 2010.     paper
  • Authenticated Index Structures for Aggregation Queries. Feifei Li, Marios Hadjieleftheriou George Kollios, and Leonid Reyzin. ACM Transactions on Information and System Security (TISSEC) 13(4), 2010. LinkImplementation available.

2009

  • Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6. Yevgeniy Dodis, Leonid Reyzin, Ronald L. Rivest, and Emily Shen. Appears in FSE 2009. Link.
  • Key Agreement from Close Secrets over Unsecured Channels. Bhavana Kanukurthi, and Leonid Reyzin. Appears in Eurocrypt 2009.  Link.