Topics in Cryptology - CT-RSA 2019 / Вопросы криптологии CT-RSA 2019
Год издания: 2019
Автор: Mitsuru Matsui (Ed.) / Митсуру Мацуи (Ред.)
Жанр или тематика: Сборник статей конференции
Издательство: Springer Nature Switzerland AG
ISBN: 978-3-030-12612-4
Серия: Lecture Notes in Computer Science
Язык: Английский
Формат: PDF
Качество: Издательский макет или текст (eBook)
Интерактивное оглавление: Да
Количество страниц: 590
Тираж: нет данных
Описание:
Lecture Notes in Computer Science, 11405.
This book constitutes the refereed proceedings of the Cryptographer's Track at the RSA Conference 2019, CT-RSA 2019, held in San Francisco, CA, USA, in March 2019.
The 28 papers presented in this volume were carefully reviewed and selected from 75 submissions.
CT-RSA, or Cryptographers Track RSA Conference, is the venue for scientific papers on cryptography within the RSA Conference. For those who have never been the RSA Conference is the main trade show for the security industry; over 40,000 people attend the exhibition floor, keynote addresses, events, seminars, training events and the various technical tracks. CT-RSA is the track devoted to scientific papers on cryptography. As such CT-RSA is a great venue to ensure that scientific results not only get published to the wider cryptologic community, but also get exposed to technical attendees from industry, government and wider afield.
(перевод)
Книга представляет собой реферируемые труды секции криптографов на конференции RSA 2019, CT-RSA 2019, состоявшейся в Сан-Франциско, Калифорния, США, в марте 2019 года.
28 документов, представленных в этом томе, были тщательно рассмотрены и отобраны из 75 представленных материалов.
CT-RSA, или Cryptographers Track конференции RSA, является площадкой для обсуждения научных работ по криптографии в рамках конференции RSA. Для тех, кто никогда там не был: конференция RSA является главной выставкой индустрии безопасности; более 40 000 человек посещают выставки, выступления, мероприятия, семинары, тренинги и различные технические секции. CT-RSA - это секция, посвященный научным работам по криптографии. Как таковая CT-RSA является отличным местом, чтобы гарантировать, что научные результаты не только будут опубликованы в более широком криптологическом сообществе, но и получение доступа к техническим участникам из промышленности, правительства и более широких кругов.
Оглавление
Structure-Preserving Certificateless Encryption and Its Application 1
Tao Zhang, Huangting Wu, and Sherman S.M. Chow
Public Key Encryption Resilient to Post-challenge Leakage and Tampering Attacks 23
Suvradip Chakraborty and C. Pandu Rangan
Downgradable Identity-Based Encryption and Applications 44
Olivier Blazy, Paul Germouty, and Duong Hieu Phan
Large Universe Subset Predicate Encryption Based on Static Assumption (Without Random Oracle) 62
Sanjit Chatterjee and Sayantan Mukherjee
An Improved RNS Variant of the BFV Homomorphic Encryption Scheme 83
Shai Halevi, Yuriy Polyakov, and Victor Shoup
New Techniques for Multi-value Input Homomorphic Evaluation and Applications 106
Sergiu Carpov, Malika Izabachène, and Victor Mollimard
Efficient Function-Hiding Functional Encryption: From Inner-Products to Orthogonality 127
Manuel Barbosa, Dario Catalano, Azam Soleimanian, and Bogdan Warinschi
Robust Encryption, Extended 149
Rémi Géraud, David Naccache, and Răzvan Roşie
Tight Reductions for Diffie-Hellman Variants in the Algebraic Group Model 169
Taiga Mizuide, Atsushi Takayasu, and Tsuyoshi Takagi
Doubly Half-Injective PRGs for Incompressible White-Box Cryptography 189
Estuardo Alpirez Bock, Alessandro Amadori, Joppe W. Bos, Chris Brzuska, and Wil Michiels
Error Detection in Monotone Span Programs with Application to Communication-Efficient Multi-party Computation 210
Nigel P. Smart and Tim Wood
Lossy Trapdoor Permutations with Improved Lossiness 230
Benedikt Auerbach, Eike Kiltz, Bertram Poettering, and Stefan Schoenen
Post-quantum EPID Signatures from Symmetric Primitives 251
Dan Boneh, Saba Eskandarian, and Ben Fisch
Assessment of the Key-Reuse Resilience of NewHope 272
Aurélie Bauer, Henri Gilbert, Guénaël Renault, and Mélissa Rossi
Universal Forgery and Multiple Forgeries of MergeMAC and Generalized Constructions 293
Tetsu Iwata, Virginie Lallemand, Gregor Leander, and Yu Sasaki
Linking Stam’s Bounds with Generalized Truncation 313
Bart Mennink
Poly-Logarithmic Side Channel Rank Estimation via Exponential Sampling 330
Liron David and Avishai Wool
Efficient Fully-Leakage Resilient One-More Signature Schemes 350
Antonio Faonio
MILP-Based Differential Attack on Round-Reduced GIFT 372
Baoyu Zhu, Xiaoyang Dong, and Hongbo Yu
Quantum Chosen-Ciphertext Attacks Against Feistel Ciphers 391
Gembu Ito, Akinori Hosoyamada, Ryutaroh Matsumoto, Yu Sasaki, and Tetsu Iwata
Automatic Search for a Variant of Division Property Using Three Subsets 412
Kai Hu and Meiqin Wang
Constructing TI-Friendly Substitution Boxes Using Shift-Invariant Permutations 433
Si Gao, Arnab Roy, and Elisabeth Oswald
Fast Secure Comparison for Medium-Sized Integers and Its Application in Binarized Neural Networks 453
Mark Abspoel, Niek J. Bouman, Berry Schoenmakers, and Niels de Vreede
EPIC: Efficient Private Image Classification (or: Learning from the Masters) 473
Eleftheria Makri, Dragos Rotaru, Nigel P. Smart, and Frederik Vercauteren
Context Hiding Multi-key Linearly Homomorphic Authenticators 493
Lucas Schabhüser, Denis Butin, and Johannes Buchmann
Revisiting the Secret Hiding Assumption Used in Verifiable (Outsourced) Computation 514
Liang Zhao
Delegatable Anonymous Credentials from Mercurial Signatures 535
Elizabeth C. Crites and Anna Lysyanskaya
Accountable Tracing Signatures from Lattices 556
San Ling, Khoa Nguyen, Huaxiong Wang, and Yanhong Xu
Author Index 577
