Goichiro Hanaoka and Hideki Imai  Home/Search
Context
Related
| iacr.org/2006/408.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2006/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we propose a generic construction of chosen-ciphertext secure cryptosystems against adversaries with a bounded number of decrytion queries from arbitrary semantically secure encryption in a black box manner. Our construction is not only an alternative to the previously known technique, i.e. the Naor-Yung paradigm [37, 19, 42], but also has some interesting properties. Especially, (1) it does not require non-interactive zero-knowledge proof, and (2) its component ciphertexts... (Update)
Active bibliography (related documents): More All
1.1: A Note on Bounded Chosen Ciphertext Security from.. - Cramer, Hofheinz, Kiltz (2006) (Correct)
0.6: Direct Chosen-Ciphertext Secure Identity-Based Key.. - Kiltz, Galindo (2006) (Correct)
0.4: This is the merged full version of two independent.. - Direct.. (2006) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ and-generic,
author = "Goichiro Hanaoka And",
title = "A Generic Construction of CCA-Secure Cryptosystems without NIZKP for a
Bounded Number of Decryption Queries",
url = "citeseer.ist.psu.edu/761590.html" }
Citations (may not include all citations):659 Random oracles are practical: a paradigm for designing e#cie.. - Bellare, Rogaway - 1993
601 A public key cryptosystem and a signature scheme based on di.. (context) - Elgamal - 1985 ACM DBLP
501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988 ACM DBLP
337 Identity-based encryption from the Weil pairing - Boneh, Franklin - 2001 ACM DBLP
326 Non-malleable cryptography - Dolev, Dwork et al. - 1991 ACM
278 Probabilistic encryption (context) - Goldwasser, Micali - 1984
260 Relations among notions of security for public-key encryptio.. (context) - Bellare, Desai et al. - 1998 ACM DBLP
254 A practical public key cryptosystem provably secure against .. - Cramer, Shoup - 1998 ACM DBLP
208 Universal one-way hash functions and their cryptographic app.. - Naor, Yung - 1989
201 Identity-based cryptosystems and signature schemes (context) - Shamir - 1985 ACM DBLP
189 Universally composable security: a new paradigm for cryptogr.. - Canetti - 2001
177 Public-key cryptosystems provably secure against chosen ciph.. - Naor, Yung - 1990 ACM DBLP
173 How to construct pseudorandom permutations from pseudorandom.. (context) - Luby, Racko - 1988
167 Pseudo-random generation from one-way functions (context) - Impagliazzo, Levin et al. - 1989
165 Optimal asymmetric encryption - Bellare, Rogaway - 1994 DBLP
162 Public-key cryptosystems based on composite degree residuosi.. - Paillier - 1999 DBLP
131 Non-interactive zero-knowledge proof of knowledge and chosen.. (context) - Racko, Simon - 1991
122 How to recycle random bits - Impagliazzo, Zuckerman - 1989
108 Secure integration of asymmetric and symmetric encryption sc.. - Fujisaki, Okamoto - 1999
85 Authenticated encryption: relations among notions and analys.. (context) - Bellare, Namprempre - 2000 DBLP
77 Non-interactive zero-knowledge and its applications (context) - Blum, Feldman et al. - 1988 ACM
70 Families of finite sets in which no sets is covered by the u.. (context) - Erdos, Frankl et al. - 1982
70 Families of finite sets in which no sets is covered by the u.. (context) - Erdos, Frankl et al. - 1985
54 Non-malleable non-interactive zero knowledge and adaptive ch.. - Sahai - 1999
53 One-way functions are necessary and su#cient for secure sign.. (context) - Rompel - 1990
48 Universal hash proofs and a paradigm for adaptive chosen cip.. - Cramer, Shoup - 2002 ACM DBLP
46 the security of joint signature and encryption - An, Dodis et al. - 2002
42 A forward-secure public-key encryption scheme - Canetti, Halevi et al. - 2003
39 Using hash functions as a hedge against chosen ciphertext at.. - Shoup - 2000 DBLP
37 Chosen-ciphertext security from identity-based encryption - Canetti, Halevi et al. - 2004
19 The random oracle methodology, revisited - Canetti, Goldreich et al. - 1998 ACM
17 A tweakable enciphering mode - Halevi, Rogaway - 2003
14 A new paradigm of hybrid encryption scheme (context) - Kurosawa, Desmedt - 2004
5 Improved e#ciency for CCA-secure cryptosystems built using i.. (context) - Boneh, Katz - 2005
4 Direct chosen ciphertext security from identity-based techni.. - Boyen, Mei et al. - 2005
3 Chosen-ciphertext security from tag-based encryption (context) - Kiltz - 2006
2 Bounded-CCA secure non-malleable encryption (context) - Pass, shelat et al.
2 Towards a separation of semantic and CCA security for public.. (context) - Gertner, Malkin et al.
1 A note on bounded chosen ciphertext security from black-box .. - Cramer, Hofheinz et al.
1 the limitations of the spread of an IBE-to-PKE transformatio.. (context) - Kiltz - 2006
1 The Kurosawa-Desmedt key encapsulation is not chosencipherte.. (context) - Herranz, Hofheinz et al. - 2006
1 A simpler construction of CCA2-secure public-key encryption .. (context) - Lindell - 2003
1 Stateful public-key cryptosystems: how to encrypt with one 1.. (context) - Bellare, Kohno et al.
Documents on the same site (http://eprint.iacr.org/2006/): More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006) (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006) (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC