ASIACRYPT 2009 - PDF Preprint Papers

ASIACRYPT 2009 International Conference on Cryptology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ASIACRYPT-2009 Paper

click to vote

ASIACRYPT
2009
Springer

211views Cryptology» more ASIACRYPT 2009»

On the Analysis of Cryptographic Assumptions in the Generic Ring Model

14 years 7 months ago

Download eprint.iacr.org

At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...

Tibor Jager, Jörg Schwenk

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	211	On the Analysis of Cryptographic Assumptions in the Generic Ring Model	claim
2	187	Secure Multi-party Computation Minimizing Online Rounds	claim
3	184	Related-Key Cryptanalysis of the Full AES-192 and AES-256	claim
4	176	Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices	claim
5	171	Cascade Encryption Revisited	claim
6	170	Linearization Framework for Collision Attacks: Application to CubeHash and MD6	claim
7	169	Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures	claim
8	166	Improved Cryptanalysis of Skein	claim
9	166	Rebound Attack on the Full Lane Compression Function	claim
10	163	On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations	claim
11	157	Group Encryption: Non-interactive Realization in the Standard Model	claim
12	156	Improved Non-committing Encryption with Applications to Adaptively Secure Protocols	claim
13	150	Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions	claim
14	149	Hedged Public-Key Encryption: How to Protect against Bad Randomness	claim
15	145	A Framework for Universally Composable Non-committing Blind Signatures	claim
16	144	Proofs of Storage from Homomorphic Identification Protocols	claim
17	143	Secure Two-Party Computation Is Practical	claim
18	142	Security Bounds for the Design of Code-Based Cryptosystems	claim
19	142	PSS Is Secure against Random Fault Attacks	claim
20	139	Security Notions and Generic Constructions for Client Puzzles	claim
21	138	Quantum-Secure Coin-Flipping and Applications	claim
22	137	A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical	claim
23	137	MD5 Is Weaker Than Weak: Attacks on Concatenated Combiners	claim
24	135	Signature Schemes with Bounded Leakage Resilience	claim
25	124	Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?	claim
26	122	Simple Adaptive Oblivious Transfer without Random Oracle	claim
27	121	Efficient Public Key Encryption Based on Ideal Lattices	claim
28	120	Foundations of Non-malleable Hash and One-Way Functions	claim
29	118	On the Power of Two-Party Quantum Cryptography	claim
30	107	Preimages for Step-Reduced SHA-2	claim
31	82	Improved Generic Algorithms for 3-Collisions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers