Website Search
Find information on spaces, staff, and services.
Catalog Search
Books
Applied cryptography and network security : 18th International Conference, ACNS 2020, Rome, Italy, October 19-22, 2020, Proceedings, Part I
- Author / Creator
- Conferences
- ACNS (Conference) (18th : 2020 : Rome, Italy)
- Available as
- Online
- Summary
-
The two-volume set of LNCS 12146 and 12147 constitutes the refereed proceedings of the 18th International Conference on Applied Cryptography and Network Security, ACNS 2020, held in Rome, Italy, in...
The two-volume set of LNCS 12146 and 12147 constitutes the refereed proceedings of the 18th International Conference on Applied Cryptography and Network Security, ACNS 2020, held in Rome, Italy, in October 2020. The conference was held virtually due to the COVID-19 pandemic. The 46 revised full papers presented were carefully reviewed and selected from 214 submissions. The papers were organized in topical sections named: cryptographic protocols cryptographic primitives, attacks on cryptographic primitives, encryption and signature, blockchain and cryptocurrency, secure multi-party computation, post-quantum cryptography.
Details
- Creator
- edited by Mauro Conti, Jianying Zhou, Emiliano Casalicchio, Angelo Spognardi (Eds.)
- Format
- Books
- Language
- English
- Contributors
- Publication
-
- Cham : Springer International Publishing, 2020
- ©2020
- Physical Details
-
- 1 online resource (xix, 512 pages) : illustrations
- data file
- ISBNs
- 9783030578084, 9783030578077, 9783030578091, 3030578089
- OCLC
- on1193115644
- Includes bibliographical references and author index.
- Intro -- Preface -- Organization -- Contents -- Part I -- I Cryptographic Protocols -- Communication-Efficient Proactive Secret Sharing for Dynamic Groups with Dishonest Majorities -- 1 Introduction -- 2 Preliminaries -- 2.1 Mixed Adversaries -- 2.2 Security Properties -- 2.3 Definitions for Verifiable, Proactive, and Dynamic PSS -- 2.4 Homomorphic Commitments and VSS -- 2.5 Bivariate Polynomials -- 3 Batched PSS for a Static Group with a Dishonest Majority -- 3.1 The Issue with the Number of Shared Secrets -- 3.2 Batched Gradual Secret Sharing Against Mixed Adversaries
- 4 Efficient Batched PSS Using Bivariate Polynomials -- 4.1 The Share Protocol -- 4.2 The Recover Protocol -- 4.3 The Reconstruct Protocol -- 4.4 The Refresh Protocol -- References -- Random Walks and Concurrent Zero-Knowledge -- 1 Introduction -- 1.1 Our Contribution -- 1.2 Related Work -- 2 Preliminaries -- 2.1 Optimistic Concurrent Zero-Knowledge -- 2.2 Random Walks in One Dimension -- 2.3 Azuma's Inequality -- 2.4 Canonical Protocol and Slots -- 3 Modeling the Network -- 3.1 Optimal Termination and the 1-Slot Model -- 4 Random Walks with Reflection at the Origin
- 4.1 Concentration Bounds for Positive Movements -- 5 Analysis of Rosen-Shelat Protocol -- 5.1 Bounding Optimal Sessions -- 5.2 Markov Chain Approach -- 6 Our Protocol and Simulator -- 6.1 Bounding Optimal Sessions for Our Protocol -- 7 Experimental Simulations -- References -- Secure and Efficient Delegation of Elliptic-Curve Pairing -- 1 Introduction -- 2 Notations and Definitions -- 2.1 Pairings -- 2.2 Delegation Protocols: Definitions -- 3 Delegating Pairings with One Offline Input -- 3.1 Protocol Scenario: (A Public Online, B Public Offline)
- 3.2 Protocol Scenario: (A Private Online, B Public Offline) -- 3.3 Protocol Scenario: (A Private Online, B Private Offline) -- 4 Delegating Pairings with Online Inputs -- 5 Conclusions -- References -- I Cryptographic Primitives -- Tweaking Key-Alternating Feistel Block Ciphers -- 1 Introduction -- 2 Preliminaries -- 2.1 Notation and General Definitions -- 2.2 Security Definitions -- 2.3 H-Coefficient Technique -- 3 Approach Overview -- 4 Birthday-Bound Security for Four Rounds -- 5 Beyond-Birthday-Bound Security for Ten Rounds -- 6 Conclusion and Open Discussions -- References
- Lesamnta-LW Revisited: Improved Security Analysis of Primitive and New PRF Mode -- 1 Introduction -- 2 Searching for Truncated Differentials with MILP -- 3 Security Analysis of Lesamnta-LW-BC -- 3.1 Improved Bounds of the Number of Active S-boxes -- 3.2 Security Analysis of Shuffle Operation -- 4 New PRF Mode Based on Lesamnta-LW-BC -- 4.1 Description of Mode -- 4.2 Security in the Standard Model -- 4.3 Security in the Ideal Model -- 5 Discussion and Conclusion -- 5.1 Related-Key Security of Lesamnta-LW-BC -- 5.2 Insecurity of Similar Constructions as Our Mode -- 5.3 Concluding Remarks