Inscrypt 2021

The 17th International Conference on Information Security and Cryptology
Qingdao, China
August 11-14 2021

About Inscrypt 2021

The 17th International Conference on Information Security and Cryptology will be held in Qingdao, Shandong, from August 12 to 14, 2021. It is organized by the State Key Laboratory of Information Security (SKLOIS) of the Institute of Information Engineering of Chinese Academy of Science and the School of Cyber Science and Technology, Shandong University. Topics of interest encompass research advances in all areas of information security, cryptography, coding, and their applications. Inscrypt 2021 seeks for high-quality research contributions in the form of well-developed papers. The conference proceedings will be published by Springer Verlag in LNCS series. Inscrypt 2021 is in Cooperation with IACR.


Important Note: Due to the pandemic, Incrypt 2021 has to be fully virtual. Please click the following link to participate.

https://zoom.us/j/98672172446?pwd=MUZRMnRaa25FTngybmoraVR1YTZNdz09

Click here to download the preproceedings of Inscrypt 2021.

Contact: inscrypt2021@126.com

Important Dates

Paper Submission Due May 20, 2021 June 10, 2021
Author Notification July 20, 2021
Camera-ready Paper Due August 16, 2021
Registration Due (New)
August 10, 2021
Conference Date August 12-14,...

Honorary Chairs

Dongdai Lin, Chinese Academy of Sciences, China

Xiaoyun Wang, Tsinghua University, China

General Chairs

Yu Chen, Shandong University, China

Chun Guo, Shandong University, China

Technical Program Chairs

Yu Yu, Shanghai Jiao Tong University, China

Moti Yung, Google and Columbia University, USA

Organizing Chairs

Puwen Wei, Shandong University, China

Steering Committee

Feng Bao, Huawei International, Singapore

Kefei Chen, Hangzhou Normal University, China

Dawu Gu, Shanghai Jiao Tong University, China

Xinyi Huang, Fujian Normal University, China

Hui Li, Xidian University, China

Dongdai Lin, Chinese Academy of Sciences, China

Peng Liu, Pennsylvania State University, USA

Zhe Liu, Nanjing University of Aeronautics and Astronautics, China

Wen-Feng Qi, National Digital Switching System Engineering and Technological Research Center, China

Meiqin Wang, Shandong University, China

Xiaofeng Wang, Indiana University at Bloomington, USA

Xiaoyun Wang, Tsinghua University, China

Jian Weng, Jinan University, China

Moti Yung, Google and Columbia University, USA

Fangguo Zhang, Sun Yat-sen University, China

Huanguo Zhang, Wuhan University, China


Program Committee

Man Ho Au, The University of Hong Kong

Shi Bai, Florida Atlantic University

Davide Bellizia, Université catholique de Louvain

Zhenzhen Bao, Nanyang Technological University

Qi Chen, Guangzhou University

Long Chen, New Jersey Institue of Technology

Rongmao Chen, National University of Defense Technology

Xiaofeng Chen, Xidian University

Yi Deng, Institute of Information Engineering, Chinese Academy of Sciences

Haixin Duan, Institute for Network Science and Cyberspace, Tsinghua University; Qi An Xin Group Corp

Thanassis Giannetsos, Digital Security & Trusted Computing Group, Ubiquitous Technologies Limited

Jian Guo, Nanyang Technological University

Qian Guo, Lund University

Shuai Han, Shanghai Jiao Tong University

Itamar Levi, Bar Ilan University, Ramat Gan, Israel

Jian Liu, Zhejiang University

Kaitai Liang, TU Delft

Jingqiang Lin, School of Cyber Security, University of Science and Technology of China

Joseph Liu, Monash University

Juanru Li, Shanghai Jiao Tong University

Zhen Ling, Southeast University

Meicheng Liu, Institute of Information Engineering, Chinese Academy of Sciences

Qipeng Liu, Princeton University

Junzuo Lai, Jinan University

Abe Masayuki, NTT and Kyoto University

Weizhi Meng, Technical University of Denmark

Khoa Nguyen, Nanyang Technological University

Jianting Ning, National University of Singapore

Emmanouil Panaousis, University of Greenwich

Christophe Petit, Université libre de Bruxelles

Thomas Peters, UCLouvain

Longjiang Qu, National University of Defense Technology

Chao Shen, Xi'an Jiaotong University

Ron Steinfeld, Monash University

Ling Song, Jinan University

Ling Sun, Shandong University

Siwei Sun, Institute of Information Engineering, Chinese Academy of Sciences

Qiang Tang, The University of Sydney

Anyu Wang, Institute for advanced study, Tsinghua University

Qian Wang, Wuhan University

Qingju Wang, University of Luxembourg

Weijia Wang, Shandong University

Xiao Wang, Northwestern University

Xiang Xie, Shanghai Key Laboratory of Privacy-Preserving Computation

Peng Xu, Huazhong University of Science and Technology

Liang Xiao, Xiamen University

Moti Yung (chair), Snap Inc./ Columbia

Yu Yu (chair), Shanghai Jiao Tong University

Yang Yu, Tsinghua University

Bingsheng Zhang, Zhejiang University

Jiaheng Zhang, UC Berkeley

Jiang Zhang, State Key Laboratory of Cryptology

Lei Zhang, Fudan University

Yupeng Zhang, Texas A&M University

Yang Zhang, CISPA Helmholtz Center for Information Security

Xiaohan Zhang, Fudan University

Zhenfeng Zhang, Institute of Software, Chinese Academy of Sciences

Hong-Sheng Zhou, Virginia Commonwealth University



Authors are invited to submit full papers presenting new research results related to all aspects of cryptology, information security and their applications. More info about the previous conferences can be found at here (https://dblp.uni-trier.de/db/conf/cisc/index.html).


All submissions must describe original research that is not published or currently under review by another conference or journal. Areas of interest include, but are not limited to:


  • Foundations of Cryptography

  • Provable Security

  • Codes

  • Sequences

  • Boolean Functions

  • Blockciphers

  • Authenticated Encryption

  • Public Key Encryption

  • Signatures

  • Key Exchange

  • Cryptographic Implementations

  • Hash Functions and MACs

  • Key Management/Agreement

  • Cryptographic Protocols

  • Information Hiding

  • Watermarking

  • Secure Computation

  • Functional Computation

  • Obfuscation

  • Side-channel Security

  • Fault Attacks

  • Post-quantum

  • Blockchain

  • Authentication

  • Biometric security

  • Distributed Systems

  • AI Security

  • Network Security

  • Security Architectures

  • Operating System Security

  • Security Certification

  • Malicious Codes Detection

  • Privacy Enhancing

  • Genomic Privacy

  • Big Data

  • Cloud Security


Instruction for Authors

The submission must be written in English, in single-column format, and be anonymous, with no author names, affiliations, acknowledgments, or obvious references. The submission should begin with a title, a short abstract, and a list of key words, and its introduction should summarize the contributions of the paper at a level appropriate for a non-specialist reader. The Springer LNCS format is recommended, and details can be obtained here. Once tweaked, the submission must use at least 11-point fonts, and have reasonable margins. The paper should be intelligible and self-contained within 20 pages including references and appendices and must be submitted electronically to hotcrp, via the url

https://inscrypt21.hotcrp.com

It is strongly encouraged that submissions are processed in LaTeX. All submissions must have page numbers (e.g. using LaTeX command \pagestyle{plain}).

Submissions must not substantially duplicate work that any of the authors has published in a journal or a conference/workshop with proceedings, or has submitted/is planning to submit before the author notification deadline to a journal or other conferences/workshops that have proceedings. Accepted submissions may not appear in any other conference or workshop that has proceedings. Submissions not meeting these guidelines risk rejection without consideration of their merits. It is highly advised to prepare the submissions in the Springer LNCS format. This conference is in Cooperation with IACR.




Keynote

This year we are glad to invite four famous Keynote speakers.


Keynote 1

Speaker: Shengli Liu(刘胜利)

Title: Authenticated Key Exchange: Tight Security & Explicit Authentication
Abstract: Authenticated Key Exchange (AKE) protocols enable two parties to authenticate e
ach other and compute a shared session key, which can be used for the later secure communications. We discuss the security requirements for AKE, show the modular construction of AKE from Digital Signatures (SIG) and Key Encapsulation Mechanisms (KEM), and study how to achieve tight security for AKE in the multi-user multi-challenge settings and in the standard model. We also propose the concrete instantiations of our AKE construction, resulting the first tightly secure 2-round (3-round) AKE in the standard model.

Bio: Shengli Liu is a professor and doctoral supervisor at Shanghai Jiao Tong University. She obtained her bachelor's degree, master's degree and doctorate in engineering from Xidian University. In 2002, she obtained another doctorate in cryptography from the Department of Mathematics and Computer at Eindhoven University of Technology in Netherlands. Since April 2002, she has been working in the Department of Computer Science and Engineering, Shanghai Jiao Tong University. In 2009, she was selected into the Shanghai Rising-star Program (Class A). In 2019, she was funded by the National Science Fund for Distinguished Young Scholars. She studies in the field of the design and certification of public key cryptography algorithms. A series of research results she had achieved in this field were published at the conferences including CRYPTO, EUROCRYPT, ASAICRYPT, and PKC. In 2016, she won the Cryptologic Innovation Award (second prize) of the Chinese Association for Cryptologic Research, and the third prize for the Party and Government Confidential Cryptologic Science and Technology Progress Award in 2018. She was also the advisor of excellent Doctoral Dissertation of CACR in 2017 and 2019.


Keynote 2

Speaker: Ran Canetti

Title: Secure Computation as a Societal Tool: Promise, Hurdles, and Dangers
Abstract: Over the past four decades, cryptography has developed a powerful set of algorithmic tools that enable computing any agreed-upon information from (potentially sensitive) raw data - without exposing the raw data itself.  These secure computation tools apply even to raw data that come from multiple sources, and even when neither the data sources nor the entities performing the computation are trusted.
With the growing reliance of societal institutions on information extracted from vast troves of data pertaining to individuals and societal groups, cryptographic secure computation machinery has the potential to reshape modern societies - by drawing new tradeoffs between societal goals and individual privacy and freedoms, providing new ways for individuals to interact and collaborate, and reshaping power structures.
In this talk I will try to overview some of the ways for secure computation can make societal impact – both for the better and for the worse. I will then discuss some of the hurdles and challenges (technical, legal, and societal) that stand in the way to societal adoption, and some of the potential dangers that careless design or adoption might entail. The talk draws from my experience in designing and analyzing secure computation tools, as well as recent collaborations with law and policy scholars.

Bio: Ran Canetti is a professor of Computer Science and the director of the center for Reliable Information System and Cyber Security at Boston University. He is also a Fellow of the International Association for Cryptologic Research, and of the Association of Computing Machinery, and an incumbent of the RSA Award in Mathematics 2018. Canetti graduated from the Weizmann Institute of Science in 1996, was a researcher at IBM Watson Research Center, and a professor of Computer Science at Tel Aviv University.
Canetti's research interests span multiple aspects of cryptography and information security, with emphasis on the design, analysis and use of cryptographic protocols. Recently he has been interested in finding common ground for Law and Cryptography to collaborate towards enabling a better future for society.


Keynote 3

Speaker: Sanjam Garg

Title: A Survey on Two-Round MPC
Abstract: A decade ago, we did not know if multiparty secure computation (MPC) could be realized in two rounds. Providing the first progress on this problem, in 2014 a two-round MPC protocol based on indistinguishability obfuscation was obtained. Subsequently, a sequence of works reduced the assumptions needed in these constructions to just two-round oblivious transfer; the minimal assumption necessary for the task. Additionally, several surprising extensions (e.g. two-round MPC with reusable first round message) from a broad range of assumptions have been obtained. In this talk, I will survey this line of work
.

Bio: Sanjam Garg is an Associate Professor at the University of California, Berkeley. His research interests are in cryptography and security. He obtained his Ph.D. from the University of California, Los Angeles in 2013 and his undergraduate degree from the Indian Institute of Technology, Delhi in 2008. Prof. Garg is the recipient of various honors such as the ACM Doctoral Dissertation Award, the Sloan Research Fellowship and the IIT Delhi Graduates of the Last Decade Award. Prof. Garg's research has been recognized with best paper awards at EUROCRYPT 2013, CRYPTO 2017 and EUROCRYPT 2018.


Keynote 4

Speaker: François-Xavier Standaert

Title: Towards an Open Approach to Leakage-Resistant Authenticated Encryption
Abstract:
In this talk, I will start by describing how side-channel attacks exploit physical leakages such as an implementation's power consumption or electromagnetic radiation. I will then discuss the definitional challenges that these attacks raise, and argue why heuristic hardware-level countermeasures are unlikely to solve the problem convincingly. Based on these premises, and focusing on the symmetric setting, securing cryptographic implementations can be viewed as a tradeoff between the design of modes of operation, underlying primitives and countermeasures. Regarding modes of operation, I will describe a general design strategy for leakage-resistant authenticated encryption, propose models and assumptions on which security proofs can be based, and show how this design strategy encourages so-called leveled implementations, where only a part of the computation needs strong (hence expensive) protections against side-channel attacks. Regarding underlying primitives and countermeasures, I will emphasize the formal and practically-relevant guarantees that can be obtained thanks to masking (i.e., secret sharing at the circuit level), and how considering the implementation of such countermeasures as an algorithmic design goal (e.g., for block ciphers) could lead to improved performances. I will then describe how limiting the leakage of the less protected parts in a leveled implementations can be combined with excellent performances, for instance with respect to the energy cost. I will finally conclude by putting forward the importance of sound evaluation practices in order to empirically validate (by lack of falsification) the assumptions needed both for leakage-resistant modes of operation and countermeasures like masking, and motivate the need of an open approach for this purpose. That is, by allowing adversaries and evaluators to know implementation details, we can expect to enable a better understanding of the fundamentals of physical security, therefore leading to improved security and efficiency in the long term.
Bio: François-Xavier Standaert received the Electrical Engineering degree and PhD degree from the Universite catholique de Louvain, respectively in 2001 and 2004. Since 2008, he is associate researcher of the Belgian Fund for Scientific Research (F.R.S.-FNRS) and professor at the UCL Institute of Information and Communication Technologies, Electronics and Applied Mathematics (ICTEAM). He was program co-chair of CHES 2010 and program co-chair of EUROCRYPT 2021. In 2011, he was awarded a Starting Independent Research Grant by the European Research Council. In 2016, he has been awarded a Consolidator Grant by the European Research Council. From 2017 to 2022, he will be board member (director) of the International Association for Cryptologic Research (IACR). His research interests include cryptographic hardware and embedded systems, low power implementations for constrained environments (RFIDs, sensor networks, ...), the design and cryptanalysis of symmetric cryptographic primitives, physical security issues in general and side-channel analysis in particular.



Accepted Papers


1. On characterization of transparency order for (n,m)-functions

Yu Zhou; Yongzhuang Wei; Hailong Zhang; Luyang Li; Enes Pasalic; Wenling Wu

Science and Technology on Communication Security Laboratory; Guilin University of Electronic Technology; Institute of Information Engineering, Chinese Academy of Sciences; National Engineering Laboratory for Wireless Security, Xi’an University of Post and Telecommunications; University of Primorska, FAMNIT & IAM; TCA Laboratory, SKLCS, Institute of Software, Chinese Academy of Sciences

2. UC-Secure Cryptographic Reverse Firewall--Guarding Corrupt-ed Systems with the Minimum Trusted Module

Geng Li; Jianwei Liu; Zongyang Zhang; Yanting Zhang

National Computer Network Emergency Response Technical Team/Coordination Center of China; School of Cyber Science and Technology, Beihang University; School of Cyber Science and Technology, Beihang University; School of Cyber Science and Technology, Beihang University

3. Security Analysis on an ElGamal-like Multivariate Encryption Scheme Based on Isomorphism of Polynomials

Yasuhiko Ikematsu; Shuhei Nakamura; Bagus Santoso; Takanori Yasuda

Kyushu University; Nihon University; University of Electro-Communications; Okayama University of Science

4. Binary sequences derived from monomial permutation polynomials over \mathrm{GF}(2^{p})

Qun-Xiong Zheng; Yupeng Jiang; Dongdai Lin; Wen-Feng Qi

PLA Strategic Support Force Information Engineering University and State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; School of Cyber Science and Technology, Beihang University; Institute of Information Engineering, CAS; PLA Strategic Support Force Information Engineering University

5. Isomorphism and Equivalence of Galois Nonlinear Feedback Shift Registers

Wenhui Kong; Jianghua Zhong; Dongdai Lin

State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences

6. Concurrent Signatures from a Variety of Keys

George Teseleanu

IMAR

7. On the provable security against truncated impossible differential cryptanalysis for AES in the master-key setting

Xueping Yan; Lin Tan; Hong Xu; Wenfeng Qi

PLA Strategic Support Force Information Engineering University; PLA Strategic Support Force Information Engineering University; PLA Strategic Support Force Information Engineering University; PLA Strategic Support Force Information Engineering University

8. A Message Franking Channel

Lois Huguenin-Dumittan; Iraklis Leontiadis

EPFL; Inpher

9. A Simple Post-Quantum Non-Interactive Zero-Knowledge Proof from Garbled Circuits

Hongrui Cui; Kaiyi Zhang

Shanghai Jiao Tong University; Shanghai Jiao Tong University

10. A New Approach for finding Low-Weight Polynomial Multiples

Laila El Aimani

University of Cadi Ayyad - Morocco

11. Privacy Preserving OpenPGP Public Key Distribution with Spamming Resistance

Wenyuan Li; Wei Wang; Jingqiang Lin; Qiongxiao Wang; Wenjie Wang

State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; School of Cyber Security, University of Science and Technology of China; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences

12. Adaptive Side-Channel Analysis Model and Its Applications to White-Box Block Cipher Implementations

Yufeng Tang; Zheng Gong; Tao Sun; Jinhai Chen; Fan Zhang

School of Computer Science, South China Normal University; School of Computer Science, South China Normal University; School of Computer Science, South China Normal University; School of Computer Science, South China Normal University; College of Computer Science and Technology, Zhejiang University

13. Differential-Linear Cryptanalysis of the Lightweight Cryptographic Algorithm KNOT

Shichang Wang; Meicheng Liu; Dongdai Lin; Shiqi Hou

State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences

14. Collaborative Verifiable Delay Functions

Liam Medley; Elizabeth A. Quaglia

Royal Holloway, University of London; Royal Holloway, University of London

15. Revisit Two Memoryless State-Recovery Cryptanalysis Methods on A5/1

Mingxing Wang; Yonglin Hao

The 6th Research Institute of China Electronics Corporation, Beijing 100083, China; State Key Laboratory of Cryptology, P.O. Box 5159, Beijing 100878, China

16. Fully Secure Lattice-based ABE from Noisy Linear Functional Encryption

Geng Wang; Ming Wan; Zhen Liu; Dawu Gu

Shanghai Jiao Tong University; Shanghai Jiao Tong University; Shanghai Jiao Tong University; Shanghai Jiao Tong University

17. Revocable Identity-Based Encryption with Server-Aided Ciphertext Evolution from Lattices

Yanhua Zhang; Ximeng Liu; Yupu Hu; Huiwen Jia

Zhengzhou University of Light Industry; Fuzhou University; Xidian University; Guangzhou University

18. A Generic Construction of Fuzzy Signature

Jie Song; Yunhua Wen

School of Computer Science and Technology, Donghua University; School of Computer Science and Technology, Donghua University

19. Identity based Linkable Ring Signature with Logarithmic Size

Mohamed Nassurdine; Huang Zhang; Fangguo Zhang

Sun Yat-sen University; Changsha University of Science and Technology; Sun Yat-sen University

20. SparrowHawk: Memory Safety Flaw Detectionvia Data-driven Source Code Annotation

Yunlong Lyu; Wang Gao; Siqi Ma; Qibin Sun; Juanru Li

University of Science and Technology of China; Shanghai Jiao Tong University; The University of Queensland; University of Science and Technology of China; Shanghai Jiao Tong University

21. Improved Zero-Knowledge Argument of Encrypted Extended Permutation

Yi Liu; Qi Wang; Siu-Ming Yiu

Southern University of Science and Technology & The University of Hong Kong; Southern University of Science and Technology; The University of Hong Kong

22. More Accurate Division Property Propagations Based on Optimized Implementations of Linear Layers

Chunlei Hong; Shasha Zhang; Siwei Chen; Da Lin; Zejun Xiang

Faculty of Mathematics and Statistics, Hubei Key Laboratory of Applied Mathematics, Hubei University, Wuhan, China; Faculty of Mathematics and Statistics, Hubei Key Laboratory of Applied Mathematics, Hubei University, Wuhan, China; Faculty of Mathematics and Statistics, Hubei Key Laboratory of Applied Mathematics, Hubei University, Wuhan, China; Faculty of Mathematics and Statistics, Hubei Key Laboratory of Applied Mathematics, Hubei University, Wuhan, China; Faculty of Mathematics and Statistics, Hubei Key Laboratory of Applied Mathematics, Hubei University, Wuhan, China

23. Attacking ECDSA Leaking Discrete Bits with a More Efficient Lattice

Shuaigang Li; Shuqin Fan; Xianhui Lu

State Key Laboratory of Information Security, Institute of Information Engineering, CAS; State Key Laboratory of Cryptology, Beijing, China; State Key Laboratory of Information Security, Institute of Information Engineering, CAS

24. Elliptic Curve and Integer Factorization

Zhizhong Pan; Xiao Li

State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences

25. On the linear complexity of feedforward clock-controlled sequence

Yangpan Zhang; Maozhi Xu

Peking UniversitySchool of Mathematical Sciences; Peking UniversitySchool of Mathematical Sciences

26. Homomorphic Modular Reduction and Improved Bootstrapping for BGV Scheme

Ruiqi Li; Chunfu Jia

College of Cyber Science, Nankai University; College of Cyber Science, Nankai University

27. SMCOS: Fast and Parallel Modular Multiplication on ARM NEON Architecture for ECC

Wenjie Wang; Wei Wang; Jingqiang Lin; Yu Fu; Lingjia Meng; Qiongxiao Wang

State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; School of Cyber Security, University of Science and Technology of China; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences

28. Security Analysis of DGM and GM Group Signature Schemes Instantiated With XMSS-T

Mahmoud Yehia; Riham AlTawy; T. Aaron Gulliver

Department of Electrical and Computer Engineering, University of Victoria; Department of Electrical and Computer Engineering, University of Victoria; Department of Electrical and Computer Engineering, University of Victoria




Timezone: UTC +8 (dates may differ in your timezone)

Please click the following link to participate:

https://zoom.us/j/98672172446?pwd=MUZRMnRaa25FTngybmoraVR1YTZNdz09

Click here to download the preproceedings of Inscrypt 2021, and here for a pdf version of the program.

12   August 2021 (UTC +8)

08:45   - 09:00

Opening  Remarks

Time

Speaker

Title

Keynote   Lectures (I)

09:00   – 9:50

Shengli   Liu

Authenticated   Key Exchange: Tight Security & Explicit Authentication

9:50–   10:10

Coffee   Break

Session   1: Signatures

10:10   – 10:30

George   Teseleanu

Concurrent Signatures from a Variety of Keys

10:30   – 10:50

Jie   Song; Yunhua Wen

A Generic Construction of Fuzzy Signature

10:50   - 11:10

Mohamed   Nassurdine;
  Huang Zhang; Fangguo Zhang

Identity based Linkable Ring Signature with Logarithmic Size

11:10   – 11:30

Mahmoud   Yehia; Riham AlTawy;
  T. Aaron Gulliver

Security Analysis Of DGM and GM Group Signature Schemes   Instantiated With XMSS-T



Session   2: System Security

14:00-14:20

Geng   Li; Jianwei Liu;
  Zongyang Zhang; Yanting Zhang

UC-Secure Cryptographic Reverse Firewall--Guarding Corrupted   Systems with the Minimum Trusted Module

14:20-14:40

Lois   Huguenin-Dumittan;
  Iraklis Leontiadis

A Message Franking Channel

14:40-15:00

Yunlong   Lyu; Wang Gao;
  Siqi Ma; Qibin Sun; Juanru Li

SparrowHawk: Memory Safety Flaw Detectionvia Data-driven Source   Code Annotation

15:00-15:20

Coffee   Break

Session   3: Symmetric Cryptanalysis

15:20-15:40

Laila El Aimani

A New Approach for finding Low-Weight Polynomial Multiples

15:40-16:00

Shichang Wang; Meicheng Liu;   Dongdai Lin; Shiqi Hou

Differential-Linear Cryptanalysis of the Lightweight   Cryptographic Algorithm KNOT

16:00-16:20

Mingxing Wang; Yonglin Hao

Revisit Two Memoryless State-Recovery Cryptanalysis Methods on   A5/1

16:20-16:40

Chunlei Hong; Shasha Zhang;
  Siwei Chen; Da Lin; Zejun Xiang

More Accurate Division Property Propagations Based on Optimized   Implementations of Linear Layers

16:40-17:00

Coffee Break

Session 4: Asymmetric   Cryptanalysis

17:00-17:20

Yasuhiko Ikematsu;
  Shuhei Nakamura;  Bagus Santoso;   Takanori Yasuda

Security Analysis on an ElGamal-like Multivariate Encryption   Scheme Based on Isomorphism of Polynomials

17:20-17:40

Shuaigang Li; Shuqin Fan;
  Xianhui Lu

Attacking ECDSA Leaking Discrete Bits with a More Efficient   Lattice


13 August 2021

Keynote   Lectures (II)

09:00 - 09:50

Ran Canetti

Secure   Computation as a Societal Tool: Promise, Hurdles, and Dangers

09:50 - 10:00

Coffee   Break

Session   5: Cryptographic Protocols

10:00 - 10:20

Hongrui   Cui; Kaiyi Zhang

A   Simple Post-Quantum Non-Interactive Zero-Knowledge Proof from Garbled   Circuits

10:20 - 10:40

Yi   Liu; Qi Wang; Siu-Ming Yiu

Improved   Zero-Knowledge Argument of Encrypted Extended Permutation

10:40 - 11:00

Coffee   Break

Session   6: Mathematical Foundations

11:00 - 11:20

Wenhui Kong; Jianghua Zhong;   Dongdai Lin

Isomorphism and Equivalence of Galois Nonlinear Feedback Shift   Registers

11:20 - 11:40

Zhizhong Pan; Xiao Li

Elliptic Curve and Integer Factorization

11:40 - 12:00

Yangpan   Zhang; Maozhi Xu

On the linear complexity of feedforward clock-controlled   sequence



14 August 2021

Keynote   Lectures (III)

09:00 - 09:50

Sanjam Garg

A Survey on   Two-Round MPC

09:50 - 10:10

Coffee   Break

Session   7: Symmetric   Cryptography

10:10 - 10:30

Yu   Zhou; Yongzhuang Wei; Hailong Zhang; Luyang Li; Enes Pasalic; Wenling Wu

On   characterization of transparency order for (n,m)-functions

10:30 - 10:50

Qun-Xiong   Zheng; Yupeng Jiang; Dongdai Lin; Wen-Feng Qi

Binary   sequences derived from monomial permutation polynomials   over \mathrm{GF}(2^{p})

10:50 - 11:10

Xueping   Yan; Lin Tan; Hong Xu; Wenfeng Qi

On   the provable security against truncated impossible differential cryptanalysis   for AES in the master-key setting

11:10 - 11:30

Yufeng   Tang; Zheng Gong;
  Tao Sun; Jinhai Chen; Fan Zhang

Adaptive   Side-Channel Analysis Model and Its Applications to White-Box Block Cipher   Implementations


Keynote   Lectures (IV)

14:00 - 14:50

François-Xavier   Standaert

Towards and Open   Approach to Leakage-Resistant Authenticated Encryption

14:50 - 15:10

Coffee   Break

Session   8: Public Key Cryptography

15:10 -15:30

Geng   Wang; Ming Wan; Zhen Liu; Dawu Gu

Fully Secure Lattice-based ABE from Noisy Linear Functional   Encryption

15:30 - 15:50

Yanhua   Zhang; Ximeng Liu; Yupu Hu; Huiwen Jia

Revocable Identity-Based Encryption with Server-Aided Ciphertext   Evolution from Lattices

15:50 - 16:10

Ruiqi   Li; Chunfu Jia

Homomorphic Modular Reduction and Improved Bootstrapping for BGV   Scheme

16:10 - 16:30

Coffee   Break

Session   9: Real World Cryptography

16:30 - 16:50

Wenyuan   Li; Wei Wang; Jingqiang Lin; Qiongxiao Wang; Wenjie Wang

Privacy Preserving OpenPGP Public Key Distribution with Spamming   Resistance

16:50 - 17:10

Liam   Medley; Elizabeth A. Quaglia

Collaborative Verifiable Delay Functions

17:10 - 17:30

Wenjie   Wang; Wei Wang; Jingqiang Lin; Yu Fu; Lingjia Meng; Qiongxiao Wang

SMCOS: Fast and Parallel Modular Multiplication on ARM NEON   Architecture for ECC



Participation Guidelines

Inscrypt 2021 will be participated via Zoom. Participants shall register. As mentioned, please fill out the registration form registration form (PDF/DOC) and email the filled form to inscrypt2021@126.com with the subject title of your email “Inscrypt 2021 Registration for #NAME#” before August 10, and the Zoom link will be provided. Your participation is valuable and we encourage you to add to the discussion. Like a face-to-face conference, virtual conferences are only as good as the interactions that occur there.

While living with shortages, virtual conferences enjoy certain advantages, including a lack of space constraints and travel freeness.



Schedule Structure

The conference is organized over 3 days. Similarly to the normal offline conferences, sessions consist of live 15~18 minute presentations of the papers, which are grouped by topic, followed by a Q&A panel discussion with the speakers and session moderators.

Ways to Participate

We will be holding live Q&A panels over Zoom with authors multiple times daily. At these panels, attendees will be able to ask questions of authors about their work, or to encourage interesting conversation amongst authors.

Questions during the Session

Click Raise Hand  in the webinar controls. The host will be notified that you've raised your hand. If the host allows you to talk, you may be prompted to unmute yourself. While unmuted, your profile picture and name is displayed to the host and panelists. Only your name is displayed to other attendees. Click Raise Hand in the webinar controls to lower it, if needed. This will not mute yourself if you are unmuted. Instructions are available at https://support.zoom.us/hc/en-us/articles/205566129-Raising-your-hand-in-a-webinar.



Venue

Inscrypt 2021 will be held in

Grand Mercure Qingdao Nanshan Resort (Binhai Road, Wenquan 2nd Road, No. 46. Jimo District, Qingdao City, Shandong Province, China, 266207

Chinese: 青岛青航美爵酒店(即墨市)(原名:青岛南山美爵度假酒店),266207 山东省 即墨市 滨海大道温泉二路46号

See below for its appearance and its address in the map. We also recommand this hotel for accommodation. Rooms have been reserved and please see the registration page.



How to Reach

By Air

Unfortunately, there will be an airport shift during the conference date, and it is unclear if the airport will remain available.

The Qingdao Liuting International Airport (Chinese: 青岛流亭国际机场) is around 40 km away from the hotel. It provides accessibility to both domestic and international flights. The Airport is well-connected with the major cities of China including Beijing, Shanghai, Shenzhen, and most of the provincial capital cities. It takes about 1 hour to drive from the airport to the hotel.

By Rail

You may take the train to any of the following stations:

  1. Qingdao Railway Station (about 70km drive to the hotel. Chinese: 青岛站)

  2. Qingdaobei Railway Station (about 60km drive to the hotel. Chinese: 青岛北站)

  3. Jimobei Railway Station (about 30km to the hotel. Chinese: 即墨北站)

Though, the choices for trains to Jimobei might be severely limited, and the 2nd choice Qingdaobei Railway Station is thus recommended as the best balance.





Registration Information

Each full/short/poster paper must have ONE author registration. For each accepted paper, at least one of the authors is expected to complete the registration by July 30, 2021, and present the paper at the conference (either in Qingdao or online)

Important Note

Due to the pandemic, Inscrypt 2021 has to be fully virtual and there is no registration fee anymore.To register, just fill out the registration form registration form (PDF/DOC) and email the filled form to inscrypt2021@126.com with the subject title of your email “Inscrypt 2021 Registration for #NAME#”. The already paid fees will be waived. Registration shall be completed before August 10.


Registration Fee

Registration category Registration amount
Author Registration 4200 CNY / 660 USD
Full Registration 3600 CNY / 600 USD

Please email inscrypt2021@126.com for assistance when needed.


How to Register

  1. Fill out the registration form registration form (PDF/DOC) with all required details and email the filled form to inscrypt2021@126.com with the subject title of your email “Inscrypt 2021 Registration for #NAME#”. In this email please include a copy of the bank draft or bank wire receipt or Transaction ID of your registration fees payment.

  2. If you have any question about the registration, please email to inscrypt2021@126.com


Modes of Payment

Payment should be made by fund transfer or depositing registration fees in the Bank account provided below.

For Chinese Residents:

  1. 开户银行名称:中国银行济南历城支行

  2. 开户银行地址:中国济南花园路84号

  3. 账号:244206255768

  4. 户名:山东大学

  5. 开户银行行号:104451040267

  6. Swift代码:BKCHCNBJ51B

  7. 汇款备注信息:"inscrypt2021+姓名"


For Foreign Delegates:

  1. Name of the Bank: BANK OF CHINA LICHENG SUB-BRANCHJINAN

  2. Address of Branch: 84 HuayuanRoad, JinanChina

  3. Account No. : 244206255768

  4. Account Holder: Shandong University

  5. Address of Holder: 27 ShandaNanlu, Jinan, P.R.China

  6. Postcode of Holder: 250100

  7. ICICI MICR Code : 104451040267

  8. Swift Code:  BKCHCNBJ51B

  9. Note: please note "inscrypt2021+name" (all the paticipants should note their names)


Invitation Letter for Visa

If you need an invitation to apply for the visa, please contact Yunhan Wang, Email: WangYunhan8178@163.com