Crypto2018 2018 Aug. 19, 2018 to Aug. 23, 2018, Santa Barbara, USA

Event Page


Tell us about missing data
Title Speakers Summary Topic Types
Towards Bidirectional Ratcheted Key Exchange Paul Rösler , Bertram Poettering Ratcheted key exchange (RKE) is a cryptographic technique used in instant messaging systems like Signal ...
Optimal Channel Security Against Fine-Grained State Compromise: The Safety of Messaging Joseph Jaeger , Igors Stepanovs We aim to understand the best possible security of a (bidirectional) cryptographic channel against an ...
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal Gil Segev , Lior Rotem Extensive efforts are currently put into securing messaging platforms, where a key challenge is that ...
Round-Optimal Secure Multiparty Computation with Honest Majority Abhishek Jain , Prabhanjan Ananth , Arka Rai Choudhuri , Aarushi Goel We study the exact round complexity of secure multiparty computation (MPC) in the honest majority ...
On the Exact Round Complexity of Secure Three-Party Computation Arpita Patra , Divya Ravi We settle the exact round complexity of three-party computation (3PC) in honest-majority setting, for a ...
Soft Merge with the next talk: Promise Zero Knowledge and its Applications to Round Optimal MPC Abhishek Jain , Vipul Goyal , Amit Sahai , Yael Tauman Kalai , Dakshita Khurana , Saikrishna Badrinarayanan We devise a new partitioned simulation technique for MPC where the simulator uses different strategies ...
Round-Optimal Secure Multi-Party Computation Shai Halevi , Antigoni Polychroniadou , Carmit Hazay , Muthuramakrishnan Venkitasubramaniam Secure multi-party computation (MPC) is a central cryptographic task that allows a set of mutually ...
Faster Homomorphic Linear Transformations in HElib Shai Halevi , Victor Shoup HElib is a software library that implements homomorphic encryption (HE), with a focus on effective ...
CAPA: The Spirit of Beaver against Physical Attacks Svetla Nikova , Ventzislav Nikov , Begül Bilgin , Nigel P. Smart , Oscar Repáraz , Lauren De Meyer , Victor Arribas In this paper we introduce two things: On one hand we introduce the Tile-Probe-and-Fault model, ...
Yes, There is an Oblivious RAM Lower Bound! Jesper buus Nielsen , Kasper Green Larsen An Oblivious RAM (ORAM) introduced by Goldreich and Ostrovsky [JACM’96] is a (possibly randomized) RAM, ...
Constrained PRFs for NC1 in Traditional Groups Takahiro Matsuda , Ryo Nishimaki , Nuttapong Attrapadung , Shota Yamada , Takashi Yamakawa We propose new constrained pseudorandom functions (CPRFs) in traditional groups. Traditional groups mean cyclic and ...
From Idea to Impact, the Crypto story: What's next? Shafi Goldwasser N/A
Fast Message Franking: From Invisible Salamanders to Encryptment Thomas Ristenpart , Paul Grubbs , Yevgeniy Dodis , Joanne Woodage Message franking enables cryptographically verifiable reporting of abusive messages in end-to-end encrypted messaging. Grubbs, Lu, ...
Indifferentiable Authenticated Encryption Manuel Barbosa , Pooya Farshim We study Authenticated Encryption with Associated Data (AEAD) from the viewpoint of composition in arbitrary ...
The Curse of Small Domains: New Attacks on Format-Preserving Encryption Viet tung Hoang , Stefano Tessaro , Ni Trieu Format-preserving encryption (FPE) produces ciphertexts which have the same format as the plaintexts. Building secure ...
GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates Vinod Vaikuntanathan , Hoeteck Wee , Yilei Chen We carry out a systematic study of the GGH15 graded encoding scheme used with general ...
Lower Bounds on Lattice Enumeration with Extreme Pruning Phong q. Nguyen , Junji Shikata , Yoshinori Aono , Takenobu Seito At Eurocrypt ’10, Gama, Nguyen and Regev introduced lattice enumeration with extreme pruning: this algorithm ...
Dissection-BKW Alexander May , Andre Esser , Robert Kübler , Felix Heuer , Christian Sohler The slightly subexponential algorithm of Blum, Kalai and Wasserman (BKW) provides a basis for assessing ...
Cryptanalysis via algebraic spans Boaz Tsaban , Adi Ben-zvi , Arkadius Kalka We introduce a method for obtaining provable polynomial time solutions of problems in nonabelian algebraic ...
Improved Division Property Based Cube Attacks Exploiting Algebraic Properties of Superpoly Takanori Isobe , Willi Meier , Yosuke Todo , Yonglin Hao , Chaoyun Li , Qingju Wang The cube attack is an important technique for the cryptanalysis of symmetric key primitives, especially ...
Generic Attacks against Beyond-Birthday-Bound MACs Gaetan Leurent , Mridul Nandi , Ferdinand Sibleyras In this work, we study the security of several recent MAC constructions with provable security ...
Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits Jens Groth , Vadim Lyubashevsky , Rafael Del Pino , Jonathan Bootle , Andrea Cerulli , Carsten Baum We propose the first zero-knowledge argument with sub-linear communication complexity for arithmetic circuit satisfiability over ...
Lattice-Based Zero-Knowledge Arguments for Integer Relations Huaxiong Wang , San Ling , Benoit Libert , Khoa Nguyen We provide lattice-based protocols allowing to prove relations among committed integers. While the most general ...
Multi-Theorem Preprocessing NIZKs from Lattices David J. Wu , Sam Kim Non-interactive zero-knowledge (NIZK) proofs are fundamental to modern cryptography. Numerous NIZK constructions are known in ...
Soft Merge with the next talk: Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency Charalampos Papamanthou , Dimitrios Papadopoulos , Ioannis Demertzis We propose the first linear-space searchable encryption scheme with constant locality and sublogarithmic read efficiency, ...
Tight Tradeoffs in Searchable Symmetric Encryption Gilad Asharov , Gil Segev , Ido Shahaf A searchable symmetric encryption (SSE) scheme enables a client to store data on an untrusted ...
Soft Merge with the next talk: Hardness of Non-Interactive Differential Privacy from One-Way Functions Tal Malkin , Daniel Wichs , Lucas Kowalczyk , Jonathan Ullman A central challenge in differential privacy is to design computationally efficient non-interactive algorithms that can ...
Risky Traitor Tracing and New Differential Privacy Negative Results Brent Waters , Venkata Koppula , Rishab Goyal , Andrew Russell In this work we seek to construct collusion-resistant traitor tracing systems with small ciphertexts from ...
SPDZ2k: Efficient MPC mod 2^k for Dishonest Majority Chaoping Xing , Ivan Damgård , Ronald Cramer , Peter Scholl , Daniel Escudero Most multi-party computation protocols allow secure computation of arithmetic circuits over a finite field, such ...
Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings Claudio Orlandi , Mark Simkin , Ivan Damgård We present a very simple yet very powerful idea for turning any passively secure MPC ...
TinyKeys: A New Approach to Efficient Multi-Party Computation Carmit Hazay , Emmanuela Orsini , Peter Scholl , Eduardo Soria-vazquez We present a new approach to designing concretely efficient MPC protocols with semi-honest security in ...
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries Yehuda Lindell , Daniel Genkin , Ariel Nof , Koji Chida , Koki Hamada , Dai Ikarashi , Ryo Kikuchi Protocols for secure multiparty computation enable a set of parties to compute a function of ...
Non-Malleable Secret Sharing for General Access Structures Vipul Goyal , Ashutosh Kumar Goyal and Kumar (STOC’18) recently introduced the notion of non-malleable secret sharing. Very roughly, the ...
On the Local Leakage Resilience of Linear Secret Sharing Schemes Fabrice Benhamouda , Yuval Ishai , Tal Rabin , Akshay Degwekar We consider the following basic question: to what extent are standard secret sharing schemes and ...
Quantum FHE (Almost) As Secure As Classical Zvika Brakerski Fully homomorphic encryption schemes (FHE) allow to apply arbitrary efficient computation to encrypted data without ...
IND-CCA-secure Key Encapsulation Mechanism in the Quantum Random Oracle Model, Revisited Zhenfeng Zhang , Haodong Jiang , Long Chen Hong , Wang Zhi Ma With the gradual progress of NIST’s post-quantum cryptography standardization, the Round-1 KEM proposals have been ...
Threshold Cryptosystems From Threshold Fully Homomorphic Encryption Dan Boneh , Rosario Gennaro , Amit Sahai , Steven Goldfeder , Aayush Jain , Sam Kim , Peter M.r. Rasmussen We develop a general approach to adding a threshold functionality to a large class of ...
Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions without Pairings Dario Catalano , Dario Fiore , Michel Abdalla , Romain Gay , Bogdan Ursu We present new constructions of multi-input functional encryption (MIFE) schemes for the inner-product functionality that ...
Pseudorandom Quantum States Yi-kai Liu , Fang Song , Zhengfeng Ji We propose the concept of pseudorandom quantum states, which appear random to any quantum polynomial-time ...
Soft Merge with the next talk: Quantum Attacks against Indistinguishablility Obfuscators Proved Secure in the Weak Multilinear Map Model Alice Pellet-mary We present a quantum polynomial time attack against the GMMSSZ branching program obfuscator of Garg ...
Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem Jung Hee Cheon , Changmin Lee , Minki Hhan , Jiseung Kim In this paper, we propose cryptanalyses of all existing indistinguishability obfuscation (iO) candidates based on ...
Encrypt or Decrypt? To Make a Single-Key Beyond Birthday Secure Nonce-Based MAC Kan Yasuda , Mridul Nandi , Nilanjan Datta , Avijit Dutta At CRYPTO 2016, Cogliati and Seurin have proposed a highly secure nonce-based MAC called Encrypted ...
Rasta: A cipher with low ANDdepth and few ANDs per bit Florian Mendel , Gregor Leander , Christian Rechberger , Eik List , Virginie Lallemand , Maria Eichlseder , Christoph Dobraunig , Lorenzo Grassi Recent developments in multi party computation (MPC) and fully homomorphic encryption (FHE) promoted the design ...
Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models Sandro Coretti , Yevgeniy Dodis , Siyao Guo The random-permutation model (RPM) and the ideal-cipher model (ICM) are idealized models that offer a ...
Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks Jonathan Katz , Jooyoung Lee , Yevgeniy Dodis , Benoît Cogliati , John Steinberger , Aishwarya Thiruvengadam , Zhe Zhang Substitution-Permutation Networks (SPNs) refer to a family of constructions which build a wn-bit block cipher ...
An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing Itai Dinur , Nathan Keller , Ohad Klein The distributed discrete logarithm (DDL) problem was introduced by Boyle et al. at CRYPTO 2016. ...
Must the Communication Graph of MPC Protocols be an Expander? Deepesh Data , Ran Cohen , Elette Boyle , Pavel Hubáček Secure multiparty computation (MPC) on incomplete communication networks has been studied within two primary models: ...
Two-Round Multiparty Secure Computation Minimizing Public Key Operations Sanjam Garg , Peihan Miao , Akshayaram Srinivasan We show new constructions of semi-honest and malicious two-round multiparty secure computation protocols using only ...
Limits of Practical Sublinear Secure Computation Antigoni Polychroniadou , Yuval Ishai , Elette Boyle Secure computations on big data call for protocols that have sublinear communication complexity in the ...
Verifiable Delay Functions Dan Boneh , Joseph Bonneau , Ben Fisch , Benedikt Bünz We study the problem of building a verifiable delay function (VDF). A VDF requires a ...
Proofs of Work from Worst-Case Assumptions Alon Rosen , Prashant Nalini Vasudevan , Marshall Ball , Manuel Sabin We give Proofs of Work (PoWs) whose hardness is based on well-studied worst-case assumptions from ...
Limits on the Power of Garbling Techniques for Public-Key Encryption Sanjam Garg , Mohammad Mahmoody , Mohammad Hajiabadi , Ameer Mohammed Understanding whether public-key encryption can be based on one-way functions is a fundamental open problem ...
Optimizing Authenticated Garbling for Faster Secure Two-Party Computation Jonathan Katz , Xiao sophia Wang , Mike Rosulek , Samuel Ranellucci Wang et al. (CCS 2017) recently proposed a protocol for malicious secure two-party computation that ...
Crypto: a Key Ingredient to Building Respectful Products Lea Kissner N/A
Simplifying Game-Based Definitions: Indistinguishability up to Correctness and Its Application to Stateful AE Phillip Rogaway , Yusi Zhang Often the simplest way of specifying game-based cryptographic definitions is apparently barred because the adversary ...
The Algebraic Group Model and its Applications Eike Kiltz , Georg Fuchsbauer , Julian Loss One of the most important and successful tools for assessing hardness assumptions in cryptography is ...
Amortized Complexity of Information-Theoretically Secure MPC Revisited Chaoping Xing , Ronald Cramer , Chen Yuan , Ignacio Cascudo A fundamental and widely-applied paradigm due to Franklin and Yung (STOC 1992) on Shamir-secret-sharing based ...
Private Circuits: A Modular Approach Amit Sahai , Yuval Ishai , Prabhanjan Ananth We consider the problem of protecting general computations against constant-rate random leakage. That is, the ...
On Tightly Secure Non-Interactive Key Exchange Julia Hesse , Dennis Hofheinz , Lisa Kohl We consider the reduction loss of security reductions for non-interactive key exchange (NIKE) schemes. Currently, ...
Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange Tibor Jager , Kristian Gjøsteen Tight security is increasingly gaining importance in real-world cryptography, as it allows to choose cryptographic ...
A New Public-Key Cryptosystem via Mersenne Numbers Antoine Joux , Divesh Aggarwal , Anupam Prakash , Miklos Santha In this work, we propose a new public-key cryptosystem whose security is based on the ...
Fast Homomorphic Evaluation of Deep Discretized Neural Networks Pascal Paillier , Florian Bourse , Michele Minelli , Matthias Minihold The rise of machine learning as a service multiplies scenarios where one faces a privacy ...
Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities Orr Dunkelman , Adi Shamir , Nathan Keller , Achiya Bar-on , Eyal Ronen Determining the security of AES is a central problem in cryptanalysis, but progress in this ...
Fast Correlation Attack Revisited - Cryptanalysis on Full Grain-128a, Grain-128, and Grain-v1 Bin Zhang , Takanori Isobe , Willi Meier , Yosuke Todo , Kazumaro Aoki A fast correlation attack (FCA) is a well-known cryptanalysis technique for LFSR-based stream ciphers. The ...
A Key-recovery Attack on 855-round Trivium Xiaoyun Wang , Willi Meier , Ximing Fu , Xiaoyang Dong In this paper, we propose a key-recovery attack on Trivium reduced to 855 rounds. As ...
Bernstein Bound on WCS is Tight - Repairing Luykx-Preneel Optimal Forgeries Mridul Nandi In Eurocrypt 2018, Luykx and Preneel described hash-key-recovery and forgery attacks against polynomial hash based ...
Adaptive Garbled RAM from Laconic Oblivious Transfer Rafail Ostrovsky , Sanjam Garg , Akshayaram Srinivasan We give a construction of an adaptive garbled RAM scheme. In the adaptive setting, a ...
On the Round Complexity of OT Extension Sanjam Garg , Mohammad Mahmoody , Daniel Masny , Izaak Meckler We show that any OT extension protocol based on one-way functions (or more generally any ...
Non-Malleable Codes for Partial Functions with Manipulation Detection Aggelos Kiayias , Yiannis Tselekounis , Feng-hao Liu Non-malleable codes were introduced by Dziembowski, Pietrzak and Wichs (ICS ’10) and its main application ...
Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions Rafail Ostrovsky , Ivan Visconti , Daniele Venturi , Giuseppe Persiano In this work, we focus on so-called continuously non-malleable codes in the split-state model, as ...
Correcting Subverted Random Oracles Moti Yung , Qiang Tang , Hong-sheng Zhou , Alexander Russell The random oracle methodology has proven to be a powerful tool for designing and reasoning ...
Combiners for Backdoored Random Oracles Pooya Farshim , Sogol Mazaheri , Balthazar Bauer We formulate and study the security of cryptographic hash functions in the backdoored random-oracle (BRO) ...
On Distributional Collision Resistant Hashing Ilan Komargodski , Eylon Yogev Collision resistant hashing is a fundamental concept that is the basis for many of the ...
Non-Interactive Zero-Knowledge Proofs for Composite Statements Shashank Agrawal , Payman Mohassel , Chaya Ganesh The two most common ways to design non-interactive zero-knowledge (NIZK) proofs are based on Sigma ...
Updatable and Universal Common Reference Strings with Applications to zk-SNARKs Sarah Meiklejohn , Markulf Kohlweiss , Ian Miers , Jens Groth , Mary Maller By design, existing (pre-processing) zk-SNARKs embed a secret trapdoor in a relation-dependent common reference strings ...
Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries Benny Pinkas , Yehuda Lindell , Tore K. Frederiksen , Valery Osheter We present two new, highly efficient, protocols for securely generating a distributed RSA key pair ...
Trapdoor Functions from the Computational Diffie-Hellman Assumption Sanjam Garg , Mohammad Hajiabadi Trapdoor functions (TDFs) are a fundamental primitive in cryptography. Yet, the current set of assumptions ...
On the Complexity of Compressing Obfuscation Gilad Asharov , Rafael Pass , Ilan Komargodski , Naomi Ephraim Indistinguishability obfuscation has become one of the most exciting cryptographic primitives due to its far ...
A Simple Obfuscation Scheme for Pattern-Matching with Wildcards Tal Malkin , Mariana Raykova , Valerio Pastro , Lucas Kowalczyk , Allison Bishop , Kevin Shi We give a simple and efficient method for obfuscating pattern matching with wildcards. In other ...