Plaintext checkable encryption with designated checker

Angsuman Das, Avishek Adhikari, Kouichi Sakurai

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

This paper introduces a new public-key primitive called designated plaintext checkable encryption (DPCE) in which given a ciphertext, a delegated checker can determine whether the ciphertext decrypts under the same public key to a plaintext chosen by himself. Motivated by various applications, two types of DPCE (of Type-I and II) are defined, depending upon whether the user delegates the plaintext checking right at his will to a delegated checker (Type-I) or the user is required to provide this plaintext checking right to a designated checker (Type-II). We propose several generic random-oracle and standard model constructions for DPCE of both the types based on arbitrary probabilistic or deterministic encryption schemes.

Original languageEnglish
Pages (from-to)37-53
Number of pages17
JournalAdvances in Mathematics of Communications
Volume9
Issue number1
DOIs
Publication statusPublished - Jan 1 2015

Fingerprint

Encryption
Cryptography
Public key
Random Oracle Model
Standard Model
Arbitrary

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory
  • Computer Networks and Communications
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

Plaintext checkable encryption with designated checker. / Das, Angsuman; Adhikari, Avishek; Sakurai, Kouichi.

In: Advances in Mathematics of Communications, Vol. 9, No. 1, 01.01.2015, p. 37-53.

Research output: Contribution to journalArticle

Das, Angsuman ; Adhikari, Avishek ; Sakurai, Kouichi. / Plaintext checkable encryption with designated checker. In: Advances in Mathematics of Communications. 2015 ; Vol. 9, No. 1. pp. 37-53.
@article{63cef16c27a2475d80bd65a41be7c746,
title = "Plaintext checkable encryption with designated checker",
abstract = "This paper introduces a new public-key primitive called designated plaintext checkable encryption (DPCE) in which given a ciphertext, a delegated checker can determine whether the ciphertext decrypts under the same public key to a plaintext chosen by himself. Motivated by various applications, two types of DPCE (of Type-I and II) are defined, depending upon whether the user delegates the plaintext checking right at his will to a delegated checker (Type-I) or the user is required to provide this plaintext checking right to a designated checker (Type-II). We propose several generic random-oracle and standard model constructions for DPCE of both the types based on arbitrary probabilistic or deterministic encryption schemes.",
author = "Angsuman Das and Avishek Adhikari and Kouichi Sakurai",
year = "2015",
month = "1",
day = "1",
doi = "10.3934/amc.2015.9.37",
language = "English",
volume = "9",
pages = "37--53",
journal = "Advances in Mathematics of Communications",
issn = "1930-5346",
publisher = "American Institute of Mathematical Sciences",
number = "1",

}

TY - JOUR

T1 - Plaintext checkable encryption with designated checker

AU - Das, Angsuman

AU - Adhikari, Avishek

AU - Sakurai, Kouichi

PY - 2015/1/1

Y1 - 2015/1/1

N2 - This paper introduces a new public-key primitive called designated plaintext checkable encryption (DPCE) in which given a ciphertext, a delegated checker can determine whether the ciphertext decrypts under the same public key to a plaintext chosen by himself. Motivated by various applications, two types of DPCE (of Type-I and II) are defined, depending upon whether the user delegates the plaintext checking right at his will to a delegated checker (Type-I) or the user is required to provide this plaintext checking right to a designated checker (Type-II). We propose several generic random-oracle and standard model constructions for DPCE of both the types based on arbitrary probabilistic or deterministic encryption schemes.

AB - This paper introduces a new public-key primitive called designated plaintext checkable encryption (DPCE) in which given a ciphertext, a delegated checker can determine whether the ciphertext decrypts under the same public key to a plaintext chosen by himself. Motivated by various applications, two types of DPCE (of Type-I and II) are defined, depending upon whether the user delegates the plaintext checking right at his will to a delegated checker (Type-I) or the user is required to provide this plaintext checking right to a designated checker (Type-II). We propose several generic random-oracle and standard model constructions for DPCE of both the types based on arbitrary probabilistic or deterministic encryption schemes.

UR - http://www.scopus.com/inward/record.url?scp=84923190817&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84923190817&partnerID=8YFLogxK

U2 - 10.3934/amc.2015.9.37

DO - 10.3934/amc.2015.9.37

M3 - Article

VL - 9

SP - 37

EP - 53

JO - Advances in Mathematics of Communications

JF - Advances in Mathematics of Communications

SN - 1930-5346

IS - 1

ER -