Asiacrypt2018 2018 Dec. 2, 2018 to Dec. 6, 2018, Brisbane, Australia

Event Page


Tell us about missing data
Title Speakers Summary Topic Types
25 Years of Linear Cryptanalysis - Early History and Path Search Algorithm Mitsuru Matsui N/A
Block Cipher Invariants as Eigenvectors of Correlation Matrices Tim Beyne A new approach to invariant subspaces and nonlinear invariants is developed. This results in both ...
Practical attacks against the Walnut digital signature scheme Ward Blackburn Recently, NIST started the process of standardizing quantum-resistant public-key cryptographic algorithms. WalnutDSA, the subject of ...
Pattern Matching on Encrypted Streams Pierre-alain Fouque , Cristina Onete , Olivier Sanders , Nicolas Desmoulins Pattern matching is essential in applications such as deep-packet inspection (DPI), searching on genomic data, ...
Two attacks on rank metric code-based schemes: RankSign and an IBE scheme Thomas Tillich RankSign [30] is a code-based signature scheme proposed to the NIST competition for quantum-safe cryptography ...
SQL on Structurally-Encrypted Databases Seny Moataz We show how to encrypt a relational database in such a way that it can ...
An efficient structural attack on NIST submission DAGS Elise Couvreur We present an efficient key recovery attack on code based encryption schemes using some quasi-dyadic ...
Parameter-Hiding Order Revealing Encryption David Cash , Cong Zhang , Feng-hao Liu , Mark Zhandry , Adam O'neill Order-revealing encryption (ORE) is a primitive for outsourcing encrypted databases which allows for efficiently performing ...
Revisiting Key-Alternating Feistel Ciphers: Reducing Key-size, and Multi-user Security Chun Wang Key-Alternating Feistel (KAF) ciphers, a.k.a. Feistel-2 models, refer to Feistel networks with round functions of ...
Measuring, simulating and exploiting the head concavity phenomenon in BKZ Damien Stehlé , Shi Bai , Weiqiang Wen The Blockwise-Korkine-Zolotarev (BKZ) lattice reduction algorithm is central in cryptanalysis, in particular for lattice-based cryptography. ...
Short Variable Length Domain Extenders With Beyond Birthday Bound Security Bart Mennink , Mridul Nandi , Yu Long Chen Length doublers are cryptographic functions that transform an n-bit cryptographic primitive into an efficient and ...
Quantum Lattice Enumeration and Tweaking Discrete Pruning Phong q. Nguyen , Yoshinori Aono , Yixin Shen Enumeration is a fundamental lattice algorithm. We show how to speed up enumeration on a ...
Building Quantum-One-Way Functions from Block Ciphers: Davies-Meyer and Merkle-Damgård Constructions Akinori Yasuda We present hash functions that are almost optimally one-way in the quantum setting. Our hash ...
On the Hardness of the Computational Ring-LWR Problem and its Applications Zhenfeng Zhang , Zhenfei Zhang , Long Chen In this paper, we propose a new assumption, the Computational Learning With Rounding over rings, ...
Tweakable Block Ciphers Secure Beyond the Birthday Bound in the Ideal Cipher Model Byeonghak Lee We propose a new construction of tweakable block ciphers from standard block ciphers. Our construction, ...
On the Statistical Leak of the GGH13 Multilinear Map and some Variants Léo Pellet-mary At EUROCRYPT 2013, Garg, Gentry and Halevi proposed a candidate construction (later referred as GGH13) ...
ZCZ: Achieving n-bit SPRP Security with a Minimal Number of Tweakable-block-cipher Calls Eik List , Mridul Nandi , Ritam Bhaumik Strong Pseudo-random Permutations (SPRPs) are important for various applications. In general, it is desirable to ...
LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS Pierre-alain Fouque , Mehdi Tibouchi , Thomas Espitau , Jonathan Bootle , Claire Delaplace This paper is devoted to analyzing the variant of Regev’s learning with errors (LWE) problem ...
Quantum Algorithms for the k-xor Problem María Naya-plasencia , Lorenzo Grassi , André Schrottenloher The k -xor (or generalized birthday) problem is a widely studied question with many applications ...
Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution Jens Groth , Mary Maller , Jonathan Bootle , Andrea Cerulli , Sune K. Jakobsen There have been tremendous advances in reducing interaction, communication and verification time in zero-knowledge proofs ...
Hidden Shift Quantum Cryptanalysis and Implications Xavier Naya-plasencia At Eurocrypt 2017 a tweak to counter Simon’s quantum attack was proposed: replace the common ...
Improved (Almost) Tightly-Secure Simulation-Sound QA-NIZK with Applications Masayuki Abe , Miyako Ohkubo , Arnab Roy , Charanjit S. Jutla We construct the first (almost) tightly-secure unbounded-simulation-sound quasi-adaptive non-interactive zero-knowledge arguments (USS-QA-NIZK) for linear-subspace languages ...
Picnic: Postquantum signatures from zero-knowledge proofs Melissa Chase N/A
Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model Shota Yamada , Takashi Yamakawa , Shuichi Katsumata In (STOC, 2008), Gentry, Peikert, and Vaikuntanathan proposed the first identity-based encryption (GPV-IBE) scheme based ...
Programming the Demirci-Sel{c{c}}uk Meet-in-the-Middle Attack with Constraints Lei Hu , Yosuke Todo , Siwei Sun , Patrick Derbez , Bing Sun , Danping Cryptanalysis with SAT/SMT, MILP and CP has increased in popularity among symmetric-key cryptanalysts and designers ...
A Framework for Achieving KDM-CCA Secure Public-Key Encryption Fuyuki Tanaka We propose a framework for achieving a public-key encryption (PKE) scheme that satisfies key dependent ...
Cryptanalysis of MORUS Tomer Ashur , Yu Sasaki , Gaetan Leurent , Brice Minaud , Maria Eichlseder , Martin M. Lauridsen , Yann Rotella , Benoît Viguier MORUS is a high-performance authenticated encryption algorithm submitted to the CAESAR competition, and recently selected ...
Understanding and Constructing AKE via Double-key Key Encapsulation Mechanism Bao Li , Xianhui Lu , Haiyang Xue , Bei Liang , Jingnan He Motivated by abstracting the common idea behind several implicitly authenticated key exchange (AKE) protocols, we ...
Identity-based Encryption Tightly Secure under Chosen-ciphertext Attacks Dennis Hofheinz , Jiaxin Pan , Dingding Jia We propose the first identity-based encryption (IBE) scheme that is (almost) tightly secure against chosen-ciphertext ...
New MILP Modeling: Improved Conditional Cube Attacks on Keccak-based Constructions San Ling , Jian Guo , Ling Song , Danping Shi In this paper, we propose a new MILP modeling to find better or even optimal ...
Short Digital Signatures and ID-KEMs via Truncation Collision Resistance Tibor Kurek Truncation collision resistance is a simple non-interactive complexity assumption that seems very plausible for standard ...
On the Concrete Security of Goldreich’s Pseudorandom Generator Yann Rotella , Geoffroy Couteau , Pierrick Méaux , Mélissa Rossi , Aurélien Dupin Local pseudorandom generators allow to expand a short random string into a long pseudo-random string, ...
New Instantiations of the CRYPTO 2017 Masking Schemes Pierre Roche At CRYPTO 2017, Belaïd et al. presented two new private multiplication algorithms over finite fields, ...
Signatures with Flexible Public Key: Introducing Equivalence Classes for Public Keys Michael Backes , Lucjan Hanzlik , Kamil Kluczniak , Jonas Schneider We introduce a new cryptographic primitive called signatures with flexible public key (SFPK) . We ...
Statistical Ineffective Fault Attacks on Masked AES with Fault Countermeasures Florian Mendel , Maria Eichlseder , Christoph Dobraunig , Stefan Mangard , Hannes Groß , Robert Primas Implementation attacks like side-channel and fault attacks are a threat to deployed devices especially if ...
Compact Multi-Signatures for Smaller Blockchains Dan Boneh , Gregory Neven , Manu Drijvers We construct new multi-signature schemes that provide new functionality. Our schemes are designed to reduce ...
Multi-Key Homomorphic Signatures Unforgeable under Insider Corruption Sherman Chow , Russell Lai , Raymond Tai , Harry Wong Homomorphic signatures (HS) allows the derivation of the signature of the message-function pair (m, g), ...
Tight Private Circuits: Achieving Probing Security with the Least Refreshing Sonia Belaid , Matthieu Rivain , Dahmun Goudarzi Masking is a common countermeasure to secure implementations against side-channel attacks. In 2003, Ishai, Sahai, ...
Attacks and Countermeasures for White-box Designs Alex Udovenko In traditional symmetric cryptography, the adversary has access only to the inputs and outputs of ...
Attribute-Based Signatures for Unbounded Languages from Standard Assumptions Goichiro Hanaoka , Nuttapong Attrapadung , Yusuke Sakai , Shuichi Katsumata Attribute-based signature (ABS) schemes are advanced signature schemes that simultaneously provide fine-grained authentication while protecting ...
Democracy, security and evidence: let's have all three Vanessa Teague N/A
Learning Strikes Again: the Case of the DRS Signature Scheme Yang Ducas Lattice signature schemes generally require particular care when it comes to preventing secret information from ...
How to Securely Compute with Noisy Leakage in Quasilinear Complexity Matthieu Rivain , Antoine Joux , Dahmun Goudarzi Since their introduction in the late 90’s, side-channel attacks have been considered as a major ...
Leakage-Resilient Cryptography from Puncturable Primitives and Obfuscation Yu Chen , Hong-sheng Zhou , Yuyu Wang In this work, we develop a framework for building leakage-resilient cryptosystems in the bounded leakage ...
Unbounded Inner Product Functional Encryption from Bilinear Maps Junichi Takashima Inner product functional encryption (IPFE), introduced by Abdalla et al. (PKC2015), is a kind of ...
Adaptively Simulation-Secure Attribute-Hiding Predicate Encryption Tatsuaki Okamoto , Katsuyuki Takashima , Pratish Datta This paper demonstrates how to achieve simulation-based strong attribute hiding against adaptive adversaries for predicate ...
Improved Inner-product Encryption with Adaptive Security and Full Attribute-hiding Jie Chen , Hoeteck Wee , Junqing Gong In this work, we propose two IPE schemes achieving both adaptive security and full attribute-hiding ...
On Multiparty Garbling of Arithmetic Circuits Aner Ben Efraim We initiate a study of garbled circuits that contain both Boolean and arithmetic gates in ...
Free IF: How to Omit Inactive Branches and Implement S-Universal Garbled Circuit (Almost) for Free Vladimir Kolesnikov Two-party Secure Function Evaluation (SFE) allows two parties to evaluate a function known to both ...
Secure Computation with Low Communication from Cross-checking Xiao sophia Wang , S. Dov Gordon , Samuel Ranellucci We construct new four-party protocols for secure computation that are secure against a single malicious ...
Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT) Carmit Hazay , Emmanuela Orsini , Peter Scholl , Eduardo Soria-vazquez In this work we develop a new theory for concretely efficient, large-scale MPC with active ...
Non-Interactive Secure Computation from One-Way Functions Abhishek Jain , Rafail Ostrovsky , Ivan Visconti , Saikrishna Badrinarayanan The notion of non-interactive secure computation (NISC) first introduced in the work of Ishai et ...
Decentralized Multi-Client Functional Encryption for Inner Product Duong hieu Phan , David Pointcheval , Romain Gay , Jérémy Chotard , Edouard Dufour Sans We consider a situation where multiple parties, owning data that have to be frequently updated, ...
Practical Fully Secure Unrestricted Inner Product Functional Encryption modulo p Fabien Laguillaumie , Guilhem Castagnos , Ida Tucker Functional encryption (FE) is a modern public-key cryptographic primitive allowing an encryptor to finely control ...
Simple and Efficient Two-Server ORAM Jonathan Katz , Xiao sophia Wang , S. Dov Gordon We show a protocol for two-server oblivious RAM (ORAM) that is simpler and more efficient ...
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting Jonathan Katz , Elaine Shi , T-h. hubert Chan , Antigoni Polychroniadou , Kartik Nayak The problem of Oblivious RAM (ORAM) has traditionally been studied in the single-server setting, but ...
Homomorphic Secret Sharing for Low Degree Polynomials Dominique Schröder , Giulio Malavolta , Russell Lai Homomorphic secret sharing (HSS) allows n clients to secret-share data to m servers, who can ...
Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols Amos Peter Homomorphic secret sharing (HSS) allows n clients to secret-share data to m servers, who can ...
Constructing Ideal Secret Sharing Schemes based on Chinese Remainder Theorem Yu Ning , Fuyou Miao , Wenchao Huang , Keju Meng , Yan Xiong , Xingfu Wang Since (t, n)-threshold secret sharing (SS) was initially proposed by Shamir and Blakley separately in ...
A Universally Composable Framework for the Privacy of Email Ecosystems Aggelos Kiayias , Thomas Zacharias , Pyrros Chaidos , Olga Fourtounelli Email communication is amongst the most prominent online activities, and as such, can put sensitive ...
State Separation for Code-Based Game-Playing Proofs Markulf Kohlweiss , Cedric Fournet , Antoine Delignat-lavaud , Chris Brzuska , Konrad Kohbrok The security analysis of real-world protocols involves reduction steps that are conceptually simple but still ...
Security of the Blockchain against Long Delay Attack Puwen Wei , Quan Yuan , Yuliang Zheng N/A
Towards practical key exchange from ordinary isogeny graphs Benjamin Smith , Luca De Feo , Jean Kieffer We revisit the ordinary isogeny-graph based cryptosystems of Couveignes and Rostovtsev–Stolbunov, long dismissed as impractical. ...
CSIDH: An Efficient Post-Quantum Commutative Group Action Tanja Lange , Joost Renes , Wouter Castryck , Chloe Martindale , Lorenz Panny We propose an efficient commutative group action suitable for non-interactive key exchange in a post-quantum ...
Computing supersingular isogenies on Kummer surfaces Craig Costello We apply Scholten’s construction to give explicit isogenies between the Weil restriction of supersingular Montgomery ...
Robustly Reusable Fuzzy Extractor from Standard Assumptions Yunhua Liu A fuzzy extractor (FE) aims at deriving and reproducing (almost) uniform cryptographic keys from noisy ...
Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH Tibor Jager , Jiaxin Pan , Rafael Kurek We construct efficient and tightly secure pseudorandom functions (PRFs) with only logarithmic security loss and ...
Simulatable Channels: Extended Security that is Universally Composable and Easier to Prove Jean Fischlin Ever since the foundational work of Goldwasser and Micali, simulation has proven to be a ...