Plaintext checkable encryption with designated checker
Author(s) -
Angsuman Das,
Avishek Adhikari,
Kouichi Sakurai
Publication year - 2015
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2015.9.37
Subject(s) - plaintext , ciphertext , plaintext aware encryption , encryption , random oracle , ciphertext indistinguishability , key (lock) , theoretical computer science , malleability , deterministic encryption , mathematics , computer science , oracle , public key cryptography , type (biology) , computer security , programming language , ecology , biology
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom