2nd International Conference on
Security & Privacy
                     (ICSP 2021)    

November 16-17, 2021

Organized by
Department of Mathematics, National Institute of Technology Jamshedpur, India

About The Event

About ICSP 2021

2nd International Conference on Security & Privacy (ICSP 2021) will take place at National Institute of Technology Jamshedpur, India, during November 16-17, 2021 in virtual/online mode. The ICSP 2021 aims to bring together researchers and experts in the field of security and privacy to share ideas, techniques, tools and experiences.

Venue (Online Mode)

Department of Mathematics
National Institute of Technology Jamshedpur
(NIT Jamshedpur)
Jharkhand-831014, India

About ICSP 2020

To know about the previous conference in this series, ICSP 2020, please click here.

Important Dates

Important Dates

  • Submission Deadline: June 30, 2021 August 14, 2021
  • Acceptance Notification: September 5, 2021
  • Final Version Deadline: September 12, 2021
  • Registration Deadline: October 15, 2021
  • Conference Dates: November 16-17, 2021

Keynote Speakers

Speaker 1

Pantelimon Stanica

Associate Chair of Research, Naval Postgraduate School, USA

Title: Cryptographic Boolean functions and multiplicative differentials

Abstract: A substitution box or S-box is one of the basic components of symmetric key cryptography (block ciphers), which are chosen in such a way to counter linear and differential cryptanalysis. The S-boxes are just tuples of (Boolean) functions defined on a vector space of dimension n (either the space of tuples (F^n)_2, or the finite field F_(2^n) ) over the binary prime field F_2. They can be defined over non-binary environments and most concepts can be extended to odd characteristics. In this talk, we concentrate on several features on what constitutes a “good” Sbox, surely, not attempting to be exhaustive. We go through some recent characterizations, constructions and aspects of differentials of block ciphers, including c-differential uniformity and c-boomerang uniformity.

Personal Webpage: click here

Speaker 2

Mridul Nandi

Indian Statistical Institute, Kolkata,India

Title: Sponge based Authenticated Cipher

Abstract: Sponge based designs are widely used in symmetric key cryptography . Sponge mode used for hash function, MAC and even for authenticated encryption. In this talk, we will discuss some recent progress in this direction. In particular we discuss ISAP, a side channel resistant sponge mode, and its improvement. The improved design, known as FEASP, was selected as one of the finalist candidates in DSCI Lightweight Cipher Challenges. We also discuss hardware comparison with known similar designs.

Personal Webpage: click here

Speaker 3

Carmit Hazay

Deputy Director and the Head of the Scientific Committee of the Center for Research in Applied Cryptography and Cyber Security, Bar-Ilan University, Israel.

Title: ZK-PCPs from Leakage-Resilient Secret Sharing

Abstract: Zero-Knowledge PCPs (ZK-PCPs; Kilian, Petrank, and Tardos, STOC `97) are PCPs with the additional zero-knowledge guarantee that the view of any (possibly malicious) verifier making a bounded number of queries to the proof can be efficiently simulated up to a small statistical distance. Similarly, ZK-PCPs of Proximity (ZK-PCPPs; Ishai and Weiss, TCC `14) are PCPPs in which the view of an adversarial verifier can be efficiently simulated with few queries to the input. Previous ZK-PCP constructions obtained an exponential gap between the query complexity q of the honest verifier, and the bound q* on the queries of a malicious verifier (i.e., q=polylog(q*)), but required either exponential-time simulation, or adaptive honest verification. This should be contrasted with standard PCPs, that can be verified non-adaptively (i.e., with a single round of queries to the proof). The problem of constructing such ZK-PCPs, even when q*=q, has remained open since they were first introduced more than 2 decades ago. This question is also open for ZK-PCPPs, for which no construction with non-adaptive honest verification is known (not even with exponential-time simulation). We resolve this question by constructing the first ZK-PCPs and ZK-PCPPs which simultaneously achieve efficient zero-knowledge simulation and non-adaptive honest verification. Our schemes have a square-root query gap, namely q*/q=O(\sqrt{n}) where n is the input length. Our constructions combine the ``MPC-in-the-head'' technique (Ishai et al., STOC `07) with leakage-resilient secret sharing. Specifically, we use the MPC-in-the-head technique to construct a ZK-PCP variant over a large alphabet, then employ leakage-resilient secret sharing to design a new alphabet reduction for ZK-PCPs which preserves zero-knowledge.

Personal Webpage: click here

Speaker 4

Elette Boyle

Director FACT Research Center, Head of RRIS International Program, Efi Arazi School of Computer Science IDC Herzliya, Israel

Title: Zero-Knowledge Proofs on Distributed Data and Applications to Secure Computation

Abstract: Zero-knowledge proofs on distributed data (D-ZK) give a means for proving statements on data held distributedly in pieces or secret shared across multiple parties. Concretely, multiple verifiers each hold pieces of the input x, and zero knowledge must additionally guarantee that subsets of verifiers do not learn about x beyond their original knowledge. In this talk, we will introduce the notion of D-ZK proofs, briefly survey known constructions, and present recent developments using information-theoretic D-ZK machinery to achieve low-overhead compilers for attaining general secure computation with security against malicious adversaries.

Personal Webpage: click here

Speaker 5

Craig Costello

Microsoft Research, USA

Title: The Case for SIKE – a Decade of the Supersingular Isogeny Problem

Abstract: To mark the 10-year anniversary of supersingular isogeny Diffie-Hellman, I will touch on 10 points in defense and support of the SIKE protocol, including the rise of classical hardness, the fact that quantum computers do not seem to offer much help in solving the underlying problem, and the importance of concrete cryptanalytic clarity. The talk will be a summary of the white paper https://eprint.iacr.org/2021/543.pdf

Personal Webpage: click here

Speaker 6

Ronald Cramer

Head of the Cryptology Group, CWI
Mathematical Institute, Leiden University, The Netherlands

Title: Compressed Σ-Protocol Theory

Abstract: Σ-Protocols provide a well-understood basis for secure algorithmics. *Compressed* Σ-protocol theory (Attema & Cramer, CRYPTO 2020) has been introduced as a strengthening of the theory, yielding protocols with low communication complexity. It is built around basic Σ-protocols for proving that a compactly committed (long) vector satisfies a linear constraint. Using a recursive folding-technique, adapted from Bulletproofs (Bootle et al., EUROCRYPT 2016, and Bünz et al., S&P 2018), communication of these protocols is first compressed from linear down to logarithmic. This comes at the expense of logarithmic rounds, which can be rendered non-interactive using the Fiat-Shamir heuristic. Proving in ZK that the secret vector satisfies a given arbitrary constraint -- captured by a (non-linear) circuit -- is then by (blackbox) reduction to the linear case, via arithmetic secret-sharing techniques adapted from MPC. This abstract modular theory has been instantiated from a variety of cryptographic hardness assumptions, i.e., the discrete-logarithm, strong-RSA, knowledge-of-exponent assumption (the latter with *constant* communication). This has been recently been further extended to the bilinear circuit model (Attema, Cramer & Rambaud, ASIACRYPT 2021). In a separate work (Attema, Cramer & Kohl, CRYPTO 2021), it has been shown how to base the theory on the ring-SIS assumption. Thus for all these platforms compressed Σ-protocol theory yields circuit zero-knowledge protocols with (poly)-logarithmic communication. Finally, it has been shown to apply the theory to so-called partial proofs of knowledge (Attema, Cramer & Fehr, CRYPTO 2021), i.e., directly, without recourse to circuits.

Personal Webpage: click here

Speaker 7

Delaram Kahrobaei

University Dean for Research at the City University of New York, USA

Title: Mathematics of Cryptography in the Quantum Era

Abstract: In this talk I will cover various mathematical tools that can be used in secure computation and data analysis in the quantum era, with various applications from/in artificial intelligence in medical data.

Personal Webpage: click here

Call for Papers

Original papers offering novel research contributions on all aspects of Security and Privacy are solicited for submission to ICSP 2021. Areas of interest include, but are not limited to:

  • Cryptography
  • Secure cryptographic protocols
  • Post-quantum cryptography
  • Quantum cryptography
  • Blockchain and Cryptocurrency
  • IoT security and privacy
  • Cloud security
  • Privacy-preserving technologies
  • Biometric Security
  • Security and privacy of Big Data
  • Cloud and edge computing security
  • Access control
  • Steganography and steganalysis
  • Leakage-resilient cryptography
  • Cyber-physical security
  • Database security
  • Embedded systems security
  • Lightweight security
  • Authentication and authorization
  • Social networks security, privacy and trust
  • Wireless security
  • Distributed systems security
  • Cyber-physical systems security
  • Verification of security protocols
  • Machine Learning in Cybersecurity


Submissions must not substantially duplicate work that any of the authors has published elsewhere or has submitted in parallel to a journal or any other conference/workshop that has proceedings. All submissions should start with a title, an abstract and keywords, but must be anonymous (i.e. without author name(s), affiliation(s) and acknowledgements). Length of the submission should not exceed 14 pages including the bibliography and well-marked appendices, and supplementary material, and using at least 10 point fonts and reasonable margins. Submissions must be prepared in CCIS templates and submitted electronically in PDF format. Details on the CCIS templates can be found here. It is strongly recommended that submissions are processed in LaTeX. Authors are advised to check the plagiarism of their manuscripts before submission. It should not exceed 20%. Submissions not meeting these guidelines risk rejection without consideration of their merits. Submission of manuscripts does not guarantee acceptance. It will be decided by the Editors, Reviewers and the Organizing Committee.

Please note that at least one author of each accepted paper should register to the conference and give a presentation at the conference in virtual/online mode. Failure to register or absence from the presentation will eventually make your paper NOT being included in the conference proceedings.

CCIS Template: To download CCIS template click here.

Submission link: To submit* full length article click here.
*Submissions must be anonymous (i.e. without author name(s), affiliation(s) and acknowledgements).


It is planned to publish the peer reviewed and selected accepted papers of the conference as proceedings with Springer in their prestigious Communications in Computer and Information Science (CCIS) series, which is abstracted/indexed in Scopus, Mathematical Reviews, DBLP, Google Scholar, EI-Compendex, SCImago.

The 10 full papers were carefully reviewed and selected from 44 submissions for the Proceedings of ICSP 2021.

To see list of accepted papers, click here.

Organizing Committee

    Chief Patron

    • Prof. Karunesh Kumar Shukla
      Director, National Institute of Technology Jamshedpur


    • Dr. Sunil Kumar
      Head, Department of Mathematics, National Institute of Technology Jamshedpur


    • Dr. Sourav Das
      Department of Mathematics, National Institute of Technology Jamshedpur

    Convener & Organizing Secretary

    • Dr. Sumit Kumar Debnath
      Department of Mathematics, National Institute of Technology Jamshedpur


  • Prof. Tarni Mandal
  • Dr. Ramayan Singh
  • Dr. Sripati Jha
  • Dr. Hari Shankar Prasad
  • Dr. Mahendra Kumar Gupta
  • Dr. Raj Nandkeolyar
  • Dr. Rajat Tripathi
  • Dr. Ratnesh Kumar Mishra
  • Dr. Snehasis Kundu

Program Committee

General Chair

  • Pantelimon Stanica, Naval Post-Graduate School, USA

Program Chairs

  • Sihem Mesnager, University of Paris VIII, France
  • Sumit Kumar Debnath, NIT Jamshedpur, India

Technical Program Committee Members

  • Kouichi Sakurai, Kyushu University, Japan
  • Luca De Feo, IBM Research Zürich, Switzerland
  • Bimal Kumar Roy, ISI Kolkata, India
  • Jintai Ding, University of Cincinnati, USA
  • Tan Chik How, NUS, Singapore
  • Svetla Nikova, KU Leuven, Belgium
  • Carles Padro, Polytechnic University of Catalonia, Spain
  • Sihem Mesnager, University of Paris VIII, France
  • Pantelimon Stanica, Naval Post-Graduate School, USA
  • Pratish Datta, NTT Research, USA
  • Partha Sarathi Roy, University of Wollongong, Australia
  • Sabyasachi Dutta, University of Calgary, Canada
  • David Naccache, ENS, France
  • Sourav Sen Gupta, NTU, Singapore
  • Kunal Dey, NIT Jamshedpur, India
  • Avishek Adhikari, Presidency University, India
  • Carmit Hazay, Bar-Ilan University, Israel
  • Bernardo Magri, Aarhus University, Denmark
  • Satya Bagchi, NIT Durgapur, India
  • Shi-Feng Sun, Monash University, Australia
  • Jason LeGrow, The University of Auckland, New Zealand
  • Jean-Luc Danger, Telecom Paris, France
  • Pierrick Meaux, Université catholique de Louvain, Belgium
  • Junwei Wang, CryptoExperts, France
  • Maharage Nisansala Sevwandi Perera, ATR, Japan
  • Zhengchun Zhou, Southwest Jiaotong University, Chengdu, China
  • Jian Liu, Tianjin University, China
  • Sylvain Guilley, Telecom Paris, France
  • Matteo Campanelli, Aarhus University, Denmark
  • Luisa Siniscalchi, Aarhus University, Denmark
  • Tanmay Choudhury, NIT Jamshedpur, India
  • Divya Ravi, Aarhus University, Denmark
  • Mark Simkin, Aarhus University, Denmark
  • Dheerendra Mishra, MANIT Bhopal, India
  • Takashi Nishide, University of Tsukuba, Japan
  • Arthur van der Merwe, University of New England, Australia
  • Sumit Kumar Debnath, NIT Jamshedpur, India
  • Y Sreenivasa Rao, NIT Warangal, India
  • J. Srinivas, Jindal Global Business School, India
  • Dipanwita Roy Chowdhury, IIT Kharagpur, India
  • Saibal Kumar Pal, SAG LAB, DRDO, India
  • Subrata Dutta, NIT Jamshedpur, India
  • Kamalesh Acharya, IIT Kharagpur, India
  • Constanza Susana Riera, Western Norway University of Applied Sciences, Norway
  • Daniele Bartoli, University of Perugia, Italy
  • Chunlei Li, University of Bergen, Norway
  • Pinaki Mitra, IIT Guwahati, India
  • Chandrashekhar Azad, NIT Jamshedpur, India
  • Tapaswini Mohanty, NIT Jamshedpur, India
  • Prashant Kumar, NIT Jamshedpur, India
  • Asis Kumar Tripathy, VIT Vellore, India
  • Meiqin Wang, Shandong University, China
  • El Mamoun Souidi, Rabat Faculty of Sciences, Morocco
  • Sugata Gangopadhyay, IIT Roorkee, India
  • Nibedita Kundu, The LNMIIT Jaipur, India
  • Chinmoy Biswas, IIT Kharagpur, India
  • Amit Kumar Singh, IIT Kharagpur, India
  • Bimal Mandal, Telecom Paris, France
  • Arup Kumar Pal, IIT (ISM) Dhanbad, India
  • Yuji Suga, Internet Initiative Japan Inc., Japan
  • Arnab Patra, DRDO, India
  • Shoichi Hirose, University of Fukui, Japan
  • Vikas Srivastava, NIT Jamshedpur, India
  • Mario Larangeira, Tokyo Institute of Technology/IOHK, Japan
  • Ravi Anand, University of Hyogo, Japan
  • Dibyendu Roy, IIIT Vadodara, India
  • Jayakrushna Sahoo, IIIT Kottayam, India
  • Meenakshi Kansal, IIT Madras, India
  • Basudeba Behera, NIT Jamshedpur, India
  • Koushlendra Kumar Singh, NIT Jamshedpur, India
  • Alekha Kumar Mishra, NIT Jamshedpur, India
  • Ramprasad Sarkar, IIT Kharagpur, India
  • Tapas Pal, IIT Kharagpur, India
  • Stjepan Picek, Delft University, Netherlands
  • Claude Carlet, Universities of Paris 8, France and Bergen, Norway
  • Christina Boura, University of Versailles, France
  • Massimiliano Sala, University of Trento, Italy
  • Chunming Tang, West Normal University, China
  • Andrea Bracciali, University of Stirling, Scotland



Please read the following instructions carefully before submitting Online Registration Form.

  • Registration is compulsory for all participants.
  • No additional charge is required for publication (if accepted).
  • Please mention “ICSP 2021” in the place of remark/comment at the time of online transfer of the registration fee.
  • Transaction details (receipt of Online transfer/ bank transfer) should be sent to the Organizing Secretary by email (icsp@nitjsr.ac.in, conf.icsp@gmail.com).
  • Registration fee covers particiaption/ Paper Presentations (if accepted) in the sessions of the conference. E-Certificate will be provided after successful participation in this conference.
  • Registration Fee is NON-REFUNDABLE.
  • Partial payment of registraition fee is not accepted and money paid in excess will not be refunded.
  • Registration Fee has to be paid through direct fund transfer to the following bank account within due date.

Registration Fee Details
Category Registration Fee
Indian Participants (Author) Rs. 1200 (INR)
Indian Participants
(Only Attending)
Rs. 200 (INR)
Foreign Participants (Author) 20 USD
Foreign Participants
(Only Attending)
10 USD

Bank Account Details
Bank State Bank of India
Account No 33117999641
IFS Code SBIN0001882
Swift Code SBININBB761

How to Register

Event Schedule

To download schedule, click here.

Contact Us

For further information, please feel free to contact the Convener & Organizing Secretary, Dr. Sumit Kumar Debnath.


Department of Mathematics
National Institute of Technology Jamshedpur
Jamshedpur-831014, Jharkhand, India

Mobile Number

+91 7001672827