ASIACRYPT 2008 - PDF Preprint Papers

ASIACRYPT 2008 International Conference on Cryptology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ASIACRYPT-2008 Paper

click to vote

ASIACRYPT
2008
Springer

159views Cryptology» more ASIACRYPT 2008»

Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption

13 years 7 months ago

Download eprint.iacr.org

Recently Cash, Kiltz, and Shoup [20] showed a variant of the Cramer-Shoup (CS) public key encryption (PKE) scheme [21] whose chosen-ciphertext (CCA) security relies on the computa...

Goichiro Hanaoka, Kaoru Kurosawa

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	159	Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption	claim
2	152	Ambiguous Optimistic Fair Exchange	claim
3	146	Universally Composable Adaptive Oblivious Transfer	claim
4	143	A New Attack on the LEX Stream Cipher	claim
5	140	A Modular Security Analysis of the TLS Handshake Protocol	claim
6	133	Slide Attacks on a Class of Hash Functions	claim
7	133	Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems	claim
8	131	Chosen Ciphertext Security with Optimal Ciphertext Overhead	claim
9	126	Compact Proofs of Retrievability	claim
10	121	MPC vs. SFE : Unconditional and Computational Security	claim
11	116	Limits of Constructive Security Proofs	claim
12	116	Towards Robust Computation on Encrypted Data	claim
13	115	Graph Design for Secure Multiparty Computation over Non-Abelian Groups	claim
14	109	Generalized Identity Based and Broadcast Encryption Schemes	claim
15	106	Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits	claim
16	102	Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes	claim
17	101	Efficient Protocols for Set Membership and Range Proofs	claim
18	101	An Improved Impossible Differential Attack on MISTY1	claim
19	100	Hash Functions from Sigma Protocols and Improvements to VSH	claim
20	99	Speeding Up the Pollard Rho Method on Prime Fields	claim
21	87	On the Security of HB# against a Man-in-the-Middle Attack	claim
22	86	Twisted Edwards Curves Revisited	claim
23	85	Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers