Towards restricting plaintext space in public key encryption

Authors:
Yusuke Sakai;Keita Emura;Goichiro Hanaoka;Yutaka Kawai;Kazumasa Omote
Affiliations:
The University of Electro-Communications, Japan;Japan Advanced Institute of Science and Technology, Japan;National Institute of Advanced Industrial Science and Technology, Japan;The University of Tokyo, Japan;Japan Advanced Institute of Science and Technology, Japan
Venue:
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
Year:
2011

Citing 10
Cited 0

How to prove yourself: practical solutions to identification and signature problems

Proceedings on Advances in cryptology---CRYPTO '86
Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An Efficient Group Signature Scheme from Bilinear Maps

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups

Journal of Cryptology
Homomorphic Encryption and Signatures from Vector Decomposition

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Improving Cut-and-Choose in Verifiable Encryption and Fair Exchange Protocols Using Trusted Computing Technology

Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures

Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Efficient proofs that a committed number lies in an interval

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Evaluating 2-DNF formulas on ciphertexts

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Constant-size dynamic k-TAA

SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates methods that allow a third-party authority to control contents transmitted using a public key infrastructure. Since public key encryption schemes are normally designed not to leak even partial information of plaintext, traditional public key encryption schemes do not allow such controlling by an authority. In the proposed schemes, an authority specifies some set of forbidden messages, and anyone can detect a ciphertext that encrypts one of the forbidden messages. The syntax of public key encryption with such a functionality (restrictive public key encryption), formal definitions of security requirement for restrictive public key encryption schemes, and an efficient construction of restrictive public key encryption are given. In principle, restrictive public key encryption schemes can be constructed by adding an NIZK proof that proves whether the encrypted messages are not prohibited. However if one uses the general NIZK technique to construct such a noninteractive proof, the scheme becomes extremely inefficient. In order to avoid such an inefficient construction, the construction given in this paper uses techniques of Teranishi et al., Boudot, and Nakanishi et al. One of the possible applications of restrictive public key encryption is protecting a public key infrastructure from abuse by terrorists by disallowing encryption of crime-related keywords. Another example is to perform format-check of a ballot in an electronic voting, by disallowing encryption of irregular format voting.