ASIACRYPT 2010 - PDF Preprint Papers

ASIACRYPT 2010 International Conference on Cryptology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ASIACRYPT-2010 Paper

click to vote

ASIACRYPT
2010
Springer

335views Cryptology» more ASIACRYPT 2010»

A Forward-Secure Symmetric-Key Derivation Protocol - How to Improve Classical DUKPT

13 years 2 months ago

Download www.spms.ntu.edu.sg

Eric Brier, Thomas Peyrin

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	335	A Forward-Secure Symmetric-Key Derivation Protocol - How to Improve Classical DUKPT	claim
2	249	Improved Single-Key Attacks on 8-Round AES-192 and AES-256	claim
3	240	Lattice-Based Blind Signatures	claim
4	210	Structured Encryption and Controlled Disclosure	claim
5	193	A Closer Look at Anonymity and Robustness in Encryption Schemes	claim
6	187	Generic Compilers for Authenticated Key Exchange	claim
7	170	Faster Fully Homomorphic Encryption	claim
8	163	Constant-Size Commitments to Polynomials and Their Applications	claim
9	160	Optimistic Concurrent Zero Knowledge	claim
10	158	The Round Complexity of Verifiable Secret Sharing: The Statistical Case	claim
11	152	Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2	claim
12	142	The Degree of Regularity of HFE Systems	claim
13	142	A Group Signature Scheme from Lattice Assumptions	claim
14	140	Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures	claim
15	138	Rotational Rebound Attacks on Reduced Skein	claim
16	137	Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions	claim
17	135	Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model	claim
18	134	Short Pairing-Based Non-interactive Zero-Knowledge Arguments	claim
19	132	The World Is Not Enough: Another Look on Second-Order DPA	claim
20	132	Short Non-interactive Zero-Knowledge Proofs	claim
21	131	Leakage Resilient ElGamal Encryption	claim
22	130	Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition	claim
23	129	Random Oracles with(out) Programmability	claim
24	127	General Perfectly Secure Message Transmission Using Linear Codes	claim
25	127	Collision Attacks against the Knudsen-Preneel Compression Functions	claim
26	124	The Semi-Generic Group Model and Applications to Pairing-Based Cryptography	claim
27	123	Efficient String-Commitment from Weak Bit-Commitment	claim
28	123	Finding Second Preimages of Short Messages for Hamsi-256	claim
29	113	Computationally Secure Pattern Matching in the Presence of Malicious Adversaries	claim
30	110	On Invertible Sampling and Adaptive Security	claim
31	105	On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields	claim
32	87	Efficient Public-Key Cryptography in the Presence of Key Leakage	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers