Applied Cryptography and Network Security: 17th International Conference, ACNS 2019, Bogota, Colombia, June 5–7, 2019, Proceedings (Lecture Notes in Computer Science (11464))

This book constitutes the refereed proceedings of the 17th International Conference on Applied Cryptography and Network Security, ACNS 2019, held in Bogota, Colombia in June 2019. The 29 revised full papers presented were carefully reviewed and selected from 111 submissions. The papers were organized in topical sections named: integrity and cryptanalysis; digital signature and MAC; software and systems security; blockchain and cryptocurrency; post quantum cryptography; public key and commitment; theory of cryptographic implementations; and privacy preserving techniques. Front Matter ....Pages i-xiii Front Matter ....Pages 1-1 Rate-Optimizing Compilers for Continuously Non-malleable Codes (Sandro Coretti, Antonio Faonio, Daniele Venturi)....Pages 3-23 Re: What’s Up Johnny? (Jens Müller, Marcus Brinkmann, Damian Poddebniak, Sebastian Schinzel, Jörg Schwenk)....Pages 24-42 Cryptanalysis of ForkAES (Subhadeep Banik, Jannis Bossert, Amit Jana, Eik List, Stefan Lucks, Willi Meier et al.)....Pages 43-63 Front Matter ....Pages 65-65 Short Lattice-Based One-out-of-Many Proofs and Applications to Ring Signatures (Muhammed F. Esgin, Ron Steinfeld, Amin Sakzad, Joseph K. Liu, Dongxi Liu)....Pages 67-88 Hierarchical Attribute-Based Signatures: Short Keys and Optimal Signature Length (Daniel Gardham, Mark Manulis)....Pages 89-109 Raptor: A Practical Lattice-Based (Linkable) Ring Signature (Xingye Lu, Man Ho Au, Zhenfei Zhang)....Pages 110-130 Parallelizable MACs Based on the Sum of PRPs with Security Beyond the Birthday Bound (Alexander Moch, Eik List)....Pages 131-151 Front Matter ....Pages 153-153 DynOpVm: VM-Based Software Obfuscation with Dynamic Opcode Mapping (Xiaoyang Cheng, Yan Lin, Debin Gao, Chunfu Jia)....Pages 155-174 Hide and Seek: An Architecture for Improving Attack-Visibility in Industrial Control Systems (Jairo Giraldo, David Urbina, Alvaro A. Cardenas, Nils Ole Tippenhauer)....Pages 175-195 A Modular Hybrid Learning Approach for Black-Box Security Testing of CPS (John Henry Castellanos, Jianying Zhou)....Pages 196-216 PassGAN: A Deep Learning Approach for Password Guessing (Briland Hitaj, Paolo Gasti, Giuseppe Ateniese, Fernando Perez-Cruz)....Pages 217-237 Front Matter ....Pages 239-239 Uncle-Block Attack: Blockchain Mining Threat Beyond Block Withholding for Rational and Uncooperative Miners (Sang-Yoon Chang, Younghee Park, Simeon Wuthier, Chang-Wu Chen)....Pages 241-258 Longitudinal Analysis of Misuse of Bitcoin (Karim Eldefrawy, Ashish Gehani, Alexandre Matton)....Pages 259-278 Front Matter ....Pages 279-279 Faster Multiplication in \(\mathbb {Z}_{2^m}[x]\) on Cortex-M4 to Speed up NIST PQC Candidates (Matthias J. Kannwischer, Joost Rijneveld, Peter Schwabe)....Pages 281-301 Generic and Practical Key Establishment from Lattice (Zhengzhong Jin, Yunlei Zhao)....Pages 302-322 One Sample Ring-LWE with Rounding and Its Application to Key Exchange (Jintai Ding, Xinwei Gao, Tsuyoshi Takagi, Yuntao Wang)....Pages 323-343 Masking Dilithium (Vincent Migliore, Benoît Gérard, Mehdi Tibouchi, Pierre-Alain Fouque)....Pages 344-362 Proxy Re-Encryption and Re-Signatures from Lattices (Xiong Fan, Feng-Hao Liu)....Pages 363-382 Front Matter ....Pages 383-383 DL-Extractable UC-Commitment Schemes (Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michał Zając)....Pages 385-405 A New Encoding Framework for Predicate Encryption with Non-linear Structures in Prime Order Groups (Jongkil Kim, Willy Susilo, Fuchun Guo, Joonsang Baek, Nan Li)....Pages 406-425 Unbounded Inner-Product Functional Encryption with Succinct Keys (Edouard Dufour-Sans, David Pointcheval)....Pages 426-441 Password-Authenticated Public-Key Encryption (Tatiana Bradley, Jan Camenisch, Stanislaw Jarecki, Anja Lehmann, Gregory Neven, Jiayu Xu)....Pages 442-462 Front Matter ....Pages 463-463 Public Immunization Against Complete Subversion Without Random Oracles (Giuseppe Ateniese, Danilo Francati, Bernardo Magri, Daniele Venturi)....Pages 465-485 Strong Leakage and Tamper-Resilient PKE from Refined Hash Proof System (Shi-Feng Sun, Dawu Gu, Man Ho Au, Shuai Han, Yu Yu, Joseph Liu)....Pages 486-506 Front Matter ....Pages 507-507 Benchmarking Privacy Preserving Scientific Operations (Abdelrahaman Aly, Nigel P. Smart)....Pages 509-529 Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing (Aner Ben-Efraim, Michael Nielsen, Eran Omri)....Pages 530-549 pRate: Anonymous Star Rating with Rating Secrecy (Jia Liu, Mark Manulis)....Pages 550-570 Masking Fuzzy-Searchable Public Databases (Alexandra Boldyreva, Tianxin Tang, Bogdan Warinschi)....Pages 571-591 Homomorphic Training of 30,000 Logistic Regression Models (Flavio Bergamaschi, Shai Halevi, Tzipora T. Halevi, Hamish Hunt)....Pages 592-611 Back Matter ....Pages 613-614 It was in the middle of the 1980s, when the seminal paper by Kar­ markar opened a new epoch in nonlinear optimization. The importance of this paper, containing a new polynomial-time algorithm for linear op­ timization problems, was not only in its complexity bound. At that time, the most surprising feature of this algorithm was that the theoretical pre­ diction of its high efficiency was supported by excellent computational results. This unusual fact dramatically changed the style and direc­ tions of the research in nonlinear optimization. Thereafter it became more and more common that the new methods were provided with a complexity analysis, which was considered a better justification of their efficiency than computational experiments. In a new rapidly develop­ ing field, which got the name "polynomial-time interior-point methods", such a justification was obligatory. Afteralmost fifteen years of intensive research, the main results of this development started to appear in monographs [12, 14, 16, 17, 18, 19]. Approximately at that time the author was asked to prepare a new course on nonlinear optimization for graduate students. The idea was to create a course which would reflect the new developments in the field. Actually, this was a major challenge. At the time only the theory of interior-point methods for linear optimization was polished enough to be explained to students. The general theory of self-concordant functions had appeared in print only once in the form of research monograph [12]. This is the first elementary exposition of the main ideas of complexity theory for convex optimization. Up to now, most of the material can be found only in special journals and research monographs. The book covers optimal methods and lower complexity bounds for smooth and non-smooth convex optimization. A separate chapter is devoted to polynomial-time interior-point methods. Audience: The book is suitable for industrial engineers and economists.