ACM Conference on Computer and Communications Security

CCS 2017 - Papers on Secure and verifiable computation

Topics · Papers

Secure and verifiable computation

A Touch of Evil: High-Assurance Cryptographic Hardware from Untrusted Components
Vasilios Mavroudis (University College London), Andrea Cerulli (University College London), Petr Svenda (Masaryk University), Dan Cvrcek (EnigmaBridge), Dusan Klinec (EnigmaBridge), George Danezis (University College London)
5Gen-C: Multi-input Functional Encryption and Program Obfuscation for Arithmetic Circuits
Brent Carmer (Oregon State University / Galois, Inc.), Alex J. Malozemoff (Galois, Inc.), Mariana Raykova (Yale University)
Full accounting for verifiable outsourcing
Riad S. Wahby (Stanford University), Ye Ji (New York University), Andrew J. Blumberg (University of Texas at Austin), abhi shelat (Northeastern University), Justin Thaler (Georgetown University), Michael Walfish (New York University), Thomas Wies (New York University)
DUPLO: Unifying Cut-and-Choose for Garbled Circuits
Vladimir Kolesnikov (Bell Labs), Jesper Buus Nielsen (Aarhus University), Mike Rosulek (Oregon State University), Ni Trieu (Oregon State University), Roberto Trifiletti (Aarhus University)
TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation
Nico Döttling (University of California, Berkeley), Satrajit Ghosh (Aarhus University), Jesper Buus Nielsen (Aarhus University), Tobias Nilges (Aarhus University), Roberto Trifiletti (Aarhus University)
[PDF]
Session: 1K
Malicious-Secure Private Set Intersection via Dual Execution
Peter Rindal (Oregon State University), Mike Rosulek (Oregon State University)
A Comprehensive Symbolic Analysis of TLS 1.3
Cas Cremers (University of Oxford), Marko Horvat (The Max Planck Institute For Software Systems), Jonathan Hoyland (Royal Holloway, University of London), Sam Scott (Royal Holloway, University of London), Thyla van der Merwe (Royal Holloway, University of London)
New Techniques for Structural Batch Verification in Bilinear Groups with Applications to Groth-Sahai Proofs
Gottfried Herold (ENS Lyon), Max Hoffmann (Ruhr-Universität Bochum), Michael Klooß  (Karlsruhe Institute of Technology), Carla Ràfols (UPF Barcelona), Andy Rupp (Karlsruhe Institute of Technology)
Certified Verification of Algebraic Properties on Low-Level Mathematical Constructs in Cryptographic Programs
Ming-Hsien Tsai (Academia Sinica), Bow-Yaw Wang (Academia Sinica), Bo-Yin Yang (Academia Sinica)
[PDF]
Session: 4I
Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives
Raphael Bost (Direction Générale de l’Armement - Maitrise de l’Information / Université de Rennes 1), Brice Minaud (Royal Holloway, University of London), Olga Ohrimenko (Microsoft Research, Cambridge)
A Fast and Verified Software Stack for Secure Function Evaluation
José Bacelar Almeida (HASLab – INESC TEC / Universidade do Minho), Manuel Barbosa (HASLab – INESC TEC / DCC FC Universidade do Porto), Gilles Barthe (IMDEA Software Institute), François Dupressoir (University of Surrey), Benjamin Grégoire (INRIA Sophia-Antipolis), Vincent Laporte (IMDEA Software Institute), Vitor Pereira (HASLab – INESC TEC / DCC FC Universidade do Porto)
Betrayal, Distrust, and Rationality: Smart Counter-Collusion Contracts for Verifiable Cloud Computing
Changyu Dong (Newcastle University), Yilei Wang (Newcastle University), Amjad Aldweesh (Newcastle University), Patrick McCorry (Newcastle University), Aad van Moorsel (Newcastle University)
Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation
Xiao Wang (University of Maryland), Samuel Ranellucci (University of Maryland / George Mason University), Jonathan Katz (University of Maryland)
(Award Finalist)
[PDF]
[Paper]
[Artifact]
Session: 1A
Fast Private Set Intersection from Homomorphic Encryption
Hao Chen (Microsoft Research), Kim Laine (Microsoft Research), Peter Rindal (Oregon State University)
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup
Scott Ames (University of Rochester), Carmit Hazay (Bar-Ilan University), Yuval Ishai (Technion / University of California, Los Angeles), Muthuramakrishnan Venkitasubramaniam (University of Rochester)
[PDF]
Session: 1J
Iron: Functional Encryption using Intel SGX
Ben Fisch (Stanford University), Dhinakaran Vinayagamurthy (University of Waterloo), Dan Boneh (Stanford University), Sergey Gorbunov (University of Waterloo)
(Award Finalist)
[PDF]
[Paper]
Session: 1D
Scaling ORAM for Secure Computation
Jack Doerner (Northeastern University), abhi shelat (Northeastern University)
(Award Finalist)
[PDF]
[Paper]
[Artifact]
Session: 1C
Verified Correctness and Security of mbedTLS HMAC-DRBG
Katherine Q. Ye (Princeton University / Carnegie Mellon University), Matthew Green (Johns Hopkins University), Naphat Sanguansin (Princeton University), Lennart Beringer (Princeton University), Adam Petcher (Oracle), Andrew W. Appel (Princeton University)
Implementing BP-Obfuscation Using Graph-Induced Encoding
Shai Halevi (IBM), Tzipora Halevi (IBM), Victor Shoup (IBM and New York University), Noah Stephens-Davidowitz (New York University)
Global-Scale Secure Multiparty Computation
Xiao Wang (University of Maryland), Samuel Ranellucci (University of Maryland / George Mason University), Jonathan Katz (University of Maryland)
Composing Differential Privacy and Secure Computation: A case study on scaling private record linkage
Xi He (Duke University), Ashwin Machanavajjhala (Duke University), Cheryl Flynn (AT&T Labs-Research), Divesh Srivastava (AT&T Labs-Research)
Precise Detection of Side-Channel Vulnerabilities using Quantitative Cartesian Hoare Logic
Jia Chen (University of Texas at Austin), Yu Feng (University of Texas at Austin), Isil Dillig (University of Texas at Austin)
[PDF]
Session: 3D
Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services
Matteo Campanelli (City College of New York), Rosario Gennaro (City College of New York), Steven Goldfeder (Princeton University), Luca Nizzardo (IMDEA Software Institute and Universidad Politécnica de Madrid)
Practical Multi-party Private Set Intersection from Symmetric-Key Techniques
Vladimir Kolesnikov (Bell Labs), Naor Matania (Bar-Ilan University), Benny Pinkas (Bar-Ilan University), Mike Rosulek (Oregon State University), Ni Trieu (Oregon State University)
Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards
Arka Rai Choudhuri (Johns Hopkins University), Matthew Green (Johns Hopkins University), Abhishek Jain (Johns Hopkins University), Gabriel Kaptchuk (Johns Hopkins University), Ian Miers (Johns Hopkins University)
[PDF]
Session: 5C
A Formal Foundation for Secure Remote Execution of Enclaves
Pramod Subramanyan (University of California, Berkeley), Rohit Sinha (University of California, Berkeley), Ilia Lebedev (Massachusetts Institute of Technology), Srinivas Devadas (Massachusetts Institute of Technology), Sanjit Seshia (University of California, Berkeley)
(Award Finalist)
[PDF]
[Paper]
[Artifact]
Session: 4K
Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case
Nishanth Chandran (Microsoft Research India), Juan Garay (Texas A&M University), Payman Mohassel (Visa Research), Satyanarayana Vusirikala (Microsoft Research India)