rev'ed pref w.avg status watch
3
(3.3)
1.
On Obfuscating Point Functions
1
(5.7)
2.
Logcrypt: Forward Security and Public Verification for Secure Audit Logs
1
(1.1)
3.
Cryptanalysis of Hiji-bij-bij (HBB)
2
(4.2)
4.
Benes and Butterfly schemes revisited
2
(4)
5.
A sufficient condition for key-privacy
2
(3.9)
6.
A Metric on the Set of Elliptic Curves over ${mathbf F}_p$.
3
(*)
7.
The Misuse of RC4 in Microsoft Word and Excel
3
(4.6)
8.
Comments on "Distributed Symmetric Key Management for Mobile Ad hoc Networks" from INFOCOM 2004
2
(5)
9.
Mixing properties of triangular feedback shift registers
2
(3.7)
10.
Update on SHA-1
2
(2.1)
11.
An Improved Elegant Method to Re-initialize Hash Chains
2
(5.1)
12.
Efficient Certificateless Public Key Encryption
3
(5.5)
13.
Comments: Insider attack on Cheng et al.s pairing-based tripartite key agreement protocols
3
(3.3)
14.
A Chosen Ciphertext Attack on a Public Key Cryptosystem Based on Lyndon Words
3
(3.9)
15.
Hierarchical Identity Based Encryption with Constant Size Ciphertext
3
(4.1)
16.
Narrow T-functions
2
(2.6)
17.
Side Channel Attacks on Implementations of Curve-Based Cryptographic Primitives
2
(3.4)
18.
Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys
1
(5.4)
19.
The Full Abstraction of the UC Framework
1
(4)
20.
(De)Compositions of Cryptographic Schemes and their Applications to Protocols
3
(3.2)
21.
Partial Hiding in Public-Key Cryptography
1
(3.4)
22.
An Improved and Efficient Countermeasure against Power Analysis Attacks
3
(2.3)
23.
A Construction of Public-Key Cryptosystem Using Algebraic Coding on the Basis of Superimposition and Randomness
2
(3.1)
24.
On the Diffie-Hellman problem over $GL_{n}$
2
(4.1)
25.
Analysis of Affinely Equivalent Boolean Functions
3
(5.2)
26.
Techniques for random maskin in hardware
4
(4.8)
27.
Tag-KEM/DEM: A New Framework for Hybrid Encryption
3
(4.1)
28.
Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage
3
(3.5)
29.
A model and architecture for pseudo-random generation with applications to /dev/random
3
(2.9)
30.
Weak keys of pairing based Diffie Hellman schemes on elliptic curves
3
(4.1)
31.
The Vector Decomposition Problem for Elliptic and Hyperelliptic Curves
3
(2.7)
32.
On the Notion of Statistical Security in Simulatability Definitions
3
(2.8)
33.
A Flexible Framework for Secret Handshakes
3
(3.2)
34.
An Efficient CDH-based Signature Scheme With a Tight Security Reduction
3
(3.8)
35.
Concurrent Composition of Secure Protocols in the Timing Model
3
(4)
36.
Improving Secure Server Performance by Re-balancing SSL/TLS Handshakes
4
(3.1)
37.
Distinguishing Stream Ciphers with Convolutional Filters
3
(3.2)
38.
Unfairness of a protocol for certified delivery
3
(4.2)
39.
On the Security of a Group Signature Scheme with Strong Separability
3
(4.7)
40.
Polyhedrons over Finite Abelian Groups and Their Cryptographic Applications
3
(2.6)
41.
An Efficient Solution to The Millionaires Problem Based on Homomorphic Encryption
3
(3.8)
42.
On the affine classification of cubic bent functions
2
(4.5)
43.
Choosing Parameter Sets for NTRUEncrypt with NAEP and SVES-3
2
(3.2)
44.
New Approaches for Deniable Authentication
2
(4.7)
45.
Cryptanalysis of an anonymous wireless authentication and conference key distribution scheme
2
(5.4)
46.
Cryptanalysis of two identification schemes based on an ID-based cryptosystem
2
(4.5)
47.
Adversarial Model for Radio Frequency Identification
2
(3.1)
48.
David Chaum's Voter Verification using Encrypted Paper Receipts
2
(1.5)
49.
A Note on Shor's Quantum Algorithm for Prime Factorization
1
(2.6)
50.
Picking Virtual Pockets using Relay Attacks on Contactless Smartcard Systems
3
(3.7)
51.
An Approach Towards Rebalanced RSA-CRT with Short Public Exponent
4
(4.3)
53.
Untraceability of Two Group Signature Schemes
5
(4)
54.
Key Derivation and Randomness Extraction
3
(2.6)
101.
A sufficient condition for key-privacy