Public-key cryptography -- PKC 2020 : Part I / 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4-7, 2020 proceedings. Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, Vassilis Zikas (eds.).

The two-volume set LNCS 12110 and 12111 constitutes the refereed proceedings of the 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, PKC 2020, held in Edinburgh, UK, in May 2020. The 44 full papers presented were carefully reviewed and selected from 180 submi...

Full description

Saved in:
Bibliographic Details
Corporate Author: International Workshop on Practice and Theory in Public Key Cryptography Edinburgh, Scotland
Other Authors: Kiayias, Aggelos, Kohlweiss, Markuff, Wallden, Petros, Zikas, Vassilis
Format: eBook
Language:English
Published: Cham : Springer, 2020.
Series:Lecture notes in computer science ; 12110.
LNCS sublibrary. Security and cryptology.
Subjects:
Online Access:Click for online access
Table of Contents:
  • Intro
  • Preface
  • Organization
  • How Low Can We Go? (Invited Talk)
  • Contents
  • Part I
  • Contents
  • Part II
  • Functional Encryption
  • Fast, Compact, and Expressive Attribute-Based Encryption
  • 1 Introduction
  • 1.1 Our Contribution
  • 1.2 Design of Our ABE Schemes
  • 1.3 Our Main Technique
  • 1.4 Other Techniques
  • 1.5 Implementation and Evaluation
  • 2 Preliminaries
  • 2.1 Notation
  • 2.2 Basic Tools
  • 2.3 Attribute-Based Encryption
  • 2.4 Piecewise Guessing Framework
  • 2.5 Pebbling Strategy for Boolean Formula
  • 3 Our KP-ABE Scheme
  • 3.1 Linear Secret Sharing for Boolean Formulae
  • 3.2 Construction
  • 3.3 Security
  • 4 Adaptive Security for Core Component
  • 5 Implementation and Evaluation
  • References
  • Adaptive Simulation Security for Inner Product Functional Encryption
  • 1 Introduction
  • 2 Preliminaries
  • 2.1 Useful Lemmas
  • 2.2 Functional Encryption
  • 2.3 Security
  • 2.4 Hardness Assumptions
  • 3 Adaptive Simulation-Based Security from DDH
  • 4 Adaptive Simulation-Based Security for Inner Products over Z from DCR
  • 5 Adaptive Simulation-Based Security for Inner Products Mod P from LWE
  • 5.1 Construction
  • 5.2 Proof of Security for AdSimIPFE
  • References
  • Verifiable Inner Product Encryption Scheme
  • 1 Introduction
  • 1.1 Our Results and Applications
  • 1.2 Technical Overview
  • 1.3 Related Work and Comparison
  • 2 Preliminaries
  • 2.1 Building Blocks
  • 2.2 Hardness Assumptions
  • 3 Our Perfectly Correct Inner-Product Encryption
  • 3.1 Security Reduction to DLin and DBDH
  • 4 Verifiable Inner-Product Encryption
  • 4.1 Our Construction
  • 5 NIWI Proofs and Verification Algorithms
  • 5.1 How to Handle Generalized or Statements
  • 5.2 OR Proof in the General Case
  • 5.3 Master Public Key Verification
  • 5.4 Token Verification Algorithms
  • 5.5 NIWIenc=""426830A Penc, Venc""526930B : NIWI-Proof for Encryption Algorithm
  • 6 Conclusion
  • References
  • A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials
  • 1 Introduction
  • 2 Preliminaries
  • 2.1 Notations
  • 2.2 Pairing Groups
  • 2.3 Functional Encryption
  • 2.4 Quasi-Adaptive Non-Interactive Zero-Knowledge
  • 3 Quadratic FE from Inner-Product FE
  • 3.1 Partially Function-Hiding Inner-Product FE
  • 3.2 Quadratic FE from Partially Function-Hiding Inner-Product FE
  • 4 Partially-Hiding Inner Product FE
  • References
  • Identity-Based Encryption
  • Master-Key KDM-Secure IBE from Pairings
  • 1 Introduction
  • 1.1 Our Contributions and Open Problems
  • 1.2 General Overview of Our Construction
  • 1.3 First Attempt: Dual System Encryption
  • 1.4 Final Attempt: Handling Many Challenge Ciphertexts
  • 2 Preliminaries
  • 2.1 Pairing Groups
  • 2.2 Entropy Extraction
  • 2.3 Identity Based Encryption
  • 3 KDM-Secure IBE from Pairings
  • 3.1 Ingredients of Our Construction
  • 3.2 KDM-Secure IBE Construction
  • 3.3 Concrete Instantiations
  • References