ASIACRYPT 2005 - PDF Preprint Papers

ASIACRYPT 2005 International Conference on Cryptology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ASIACRYPT-2005 Paper

click to vote

ASIACRYPT
2005
Springer

174views Cryptology» more ASIACRYPT 2005»

Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application

14 years 5 months ago

Download eprint.iacr.org

In this paper, we discuss non-interactive updating of decryption keys in identity-based encryption (IBE). IBE is a public key cryptosystem where a public key is an arbitrary strin...

Yumiko Hanaoka, Goichiro Hanaoka, Junji Shikata, H...

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	174	Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application	claim
2	131	Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation	claim
3	130	A Failure-Friendly Design Principle for Hash Functions	claim
4	126	An Analysis of the XSL Algorithm	claim
5	125	A Near-Practical Attack Against B Mode of HBB	claim
6	118	Fast Computation of Large Distributions and Its Cryptographic Applications	claim
7	117	A Related-Key Rectangle Attack on the Full KASUMI	claim
8	117	Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation	claim
9	116	A Practical Attack on the Fixed RC4 in the WEP Mode	claim
10	115	Universally Convertible Directed Signatures	claim
11	109	Modular Security Proofs for Key Agreement Protocols	claim
12	108	Universally Anonymizable Public-Key Encryption	claim
13	108	Adapting Density Attacks to Low-Weight Knapsacks	claim
14	105	Updatable Zero-Knowledge Databases	claim
15	103	Errors in Computational Complexity Proofs for Protocols	claim
16	100	Revealing Additional Information in Two-Party Computations	claim
17	100	Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?	claim
18	98	Privacy-Preserving Graph Algorithms in the Semi-honest Model	claim
19	93	Spreading Alerts Quietly and the Subgroup Escape Problem	claim
20	92	Simple and Tight Bounds for Information Reconciliation and Privacy Amplification	claim
21	91	A Simple Threshold Authenticated Key Exchange from Short Secrets	claim
22	88	Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log	claim
23	82	Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes	claim
24	74	Examining Indistinguishability-Based Proof Models for Key Establishment Protocols	claim
25	69	Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations	claim
26	61	Quantum Anonymous Transmissions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers