AAECC 2006 - PDF Preprint Papers

AAECC 2006 Int. Conference/Symposium on Applied Algebra

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed AAECC-2006 Paper

click to vote

AAECC
2006
Springer

135views Algorithms» more AAECC 2006»

Applying Fujisaki-Okamoto to Identity-Based Encryption

13 years 10 months ago

Download grouper.ieee.org

The Fujisaki-Okamoto (FO) conversion is widely known to be able to generically convert a weak public key encryption scheme, say one-way against chosen plaintext attacks (OW-CPA), t...

Peng Yang 0002, Takashi Kitagawa, Goichiro Hanaoka...

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	135	Applying Fujisaki-Okamoto to Identity-Based Encryption	claim
2	135	Computing Hypergeometric Solutions of Linear Recurrence Equations	claim
3	133	The Berlekamp-Massey Algorithm revisited	claim
4	133	On the low hamming weight discrete logarithm problem for nonadjacent representations	claim
5	132	The Conjugacy Search Problem in Public Key Cryptography: Unnecessary and Insufficient	claim
6	125	Combinatorial Group Theory and Public Key Cryptography	claim
7	122	Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping	claim
8	120	Continued fraction for formal laurent series and the lattice structure of sequences	claim
9	117	Quantum Period Reconstruction of Binary Sequences	claim
10	114	Traitor Tracing Against Powerful Attacks Using Combinatorial Designs	claim
11	109	Cryptosystems using Linear Groups	claim
12	107	On the Feng-Rao Bound for Generalized Hamming Weights	claim
13	105	LDPC Codes for Fading Channels: Two Strategies	claim
14	102	Cryptographic implications of Hess' generalized GHS attack	claim
15	102	An effective proof of the well-foundedness of the multiset path ordering	claim
16	100	The Merit Factor Problem for Binary Sequences	claim
17	100	On Doubly-Cyclic Convolutional Codes	claim
18	90	Apparent singularities of linear difference equations with polynomial coefficients	claim
19	79	New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems	claim
20	77	Protecting against key-exposure: strongly key-insulated encryption with optimal threshold	claim
21	74	Nested Codes for Constrained Memory and for Dirty Paper	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers