Indifferentiability for public key cryptosystems

Mark Zhandry, Cong Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We initiate the study of indifferentiability for public key encryption and other public key primitives. Our main results are definitions and constructions of public key cryptosystems that are indifferentiable from ideal cryptosystems, in the random oracle model. Cryptosystems include:Public key encryption;Digital signatures;Non-interactive key agreement. Our schemes are based on relatively standard public key assumptions. By being indifferentiable from an ideal object, our schemes automatically satisfy a wide range of security properties, including any property representable as a single-stage game, and can be composed to operate in higher-level protocols.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Proceedings
EditorsDaniele Micciancio, Thomas Ristenpart
PublisherSpringer
Pages63-93
Number of pages31
ISBN (Print)9783030567835
DOIs
StatePublished - 2020
Event40th Annual International Cryptology Conference, CRYPTO 2020 - Santa Barbara, United States
Duration: Aug 17 2020Aug 21 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12170 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference40th Annual International Cryptology Conference, CRYPTO 2020
CountryUnited States
CitySanta Barbara
Period8/17/208/21/20

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Keywords

  • Composition
  • Ideal cipher model
  • Indifferentiability
  • Public key encryption
  • Random oracle model

Fingerprint Dive into the research topics of 'Indifferentiability for public key cryptosystems'. Together they form a unique fingerprint.

Cite this