| Title: | acquiring key privacy from data privacy |
| Author: | Zhang Rui
|
| Source: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
| Conference Name: | 6th China International Conference on Information Security and Cryptology, Inscrypt 2010
|
| Conference Date: | 20-Oct
|
| Issued Date: | 2011
|
| Conference Place: | Shanghai, China
|
| Keyword: | Public key cryptography
|
| Publish Place: | Germany
|
| Indexed Type: | EI
|
| ISSN: | 3029743
|
| ISBN: | 9783642215179
|
| Department: | (1) State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Research Center for Information Security (RCIS), National Institute of Advanced Industrial Science and Technology (AIST), Japan
|
| Sponsorship: | State Key Laboratory of Information Security; Chinese Academy of Sciences; Chinese Association for Cryptologic Research
|
| English Abstract: | A primary functionality of public key encryption schemes is data privacy, while in many cases key privacy (aka. anonymity of public keys) may also be important. Traditionally, one has to separately design/prove them, because data privacy and key privacy were shown to be independent from each other [5,40]. Existing constructions of anonymous public key encryption usually take either of the following two approaches: 1 Directly construct it from certain number theoretic assumptions. 2 Find a suitable anonymous encryption scheme with key privacy yet without chosen ciphertext security, then use some dedicated transforms to upgrade it to one with key privacy and chosen ciphertext security. While the first approach is intricate and a bit mysterious, the second approach is unnecessarily a real solution to the problem, namely, how to acquire key privacy. In this paper, we show how to build anonymous encryption schemes from a class of key encapsulation mechanisms with only weak data privacy, in the random oracle model. Instantiating our generic construction, we obtain many interesting anonymous public key encryption schemes. We note that some underlying schemes are based on gap assumptions or with bilinear pairings, which were previously well-known not anonymous. © 2011 Springer-Verlag. |
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/14369
|
| Appears in Collections: | 信息安全国家重点实验室_会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| acquiring key privacy from data privacy.pdf（246KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
Zhang Rui. acquiring key privacy from data privacy[C]. 见:6th China International Conference on Information Security and Cryptology, Inscrypt 2010. Shanghai, China. 20-Oct.
|
|
|
