Advances in Cryptology - ASIACRYPT 2010 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642173721, 9783642173738

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model

Advances in Cryptology - ASIACRYPT 2010 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-17373-8_13 ◽

2010 ◽

pp. 213-231 ◽

Cited By ~ 72

Author(s):

Emiliano De Cristofaro ◽

Jihye Kim ◽

Gene Tsudik

Keyword(s):

Linear Complexity ◽

Set Intersection ◽

Malicious Model ◽

Private Set Intersection

Download Full-text

Conditional Differential Cryptanalysis of NLFSR-Based Cryptosystems

Advances in Cryptology - ASIACRYPT 2010 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-17373-8_8 ◽

2010 ◽

pp. 130-145 ◽

Cited By ~ 55

Author(s):

Simon Knellwolf ◽

Willi Meier ◽

María Naya-Plasencia

Keyword(s):

Differential Cryptanalysis

Download Full-text

Random Oracles with(out) Programmability

Advances in Cryptology - ASIACRYPT 2010 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-17373-8_18 ◽

2010 ◽

pp. 303-320 ◽

Cited By ~ 37

Author(s):

Marc Fischlin ◽

Anja Lehmann ◽

Thomas Ristenpart ◽

Thomas Shrimpton ◽

Martijn Stam ◽

...

Keyword(s):

Random Oracles

Download Full-text

The World Is Not Enough: Another Look on Second-Order DPA

Advances in Cryptology - ASIACRYPT 2010 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-17373-8_7 ◽

2010 ◽

pp. 112-129 ◽

Cited By ~ 105

Author(s):

François-Xavier Standaert ◽

Nicolas Veyrat-Charvillon ◽

Elisabeth Oswald ◽

Benedikt Gierlichs ◽

Marcel Medwed ◽

...

Keyword(s):

Second Order ◽

The World

Download Full-text

The Round Complexity of Verifiable Secret Sharing: The Statistical Case

Advances in Cryptology - ASIACRYPT 2010 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-17373-8_25 ◽

2010 ◽

pp. 431-447 ◽

Cited By ~ 18

Author(s):

Ranjit Kumaresan ◽

Arpita Patra ◽

C. Pandu Rangan

Keyword(s):

Secret Sharing ◽

Verifiable Secret Sharing ◽

Round Complexity

Download Full-text

Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2

Advances in Cryptology - ASIACRYPT 2010 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-17373-8_4 ◽

2010 ◽

pp. 56-75 ◽

Cited By ~ 44

Author(s):

Jian Guo ◽

San Ling ◽

Christian Rechberger ◽

Huaxiong Wang

Keyword(s):

First Results

Download Full-text

General Perfectly Secure Message Transmission Using Linear Codes

Advances in Cryptology - ASIACRYPT 2010 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-17373-8_26 ◽

2010 ◽

pp. 448-465 ◽

Cited By ~ 4

Author(s):

Qiushi Yang ◽

Yvo Desmedt

Keyword(s):

Linear Codes ◽

Message Transmission ◽

Secure Message Transmission

Download Full-text

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

Advances in Cryptology - ASIACRYPT 2010 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-17373-8_17 ◽

2010 ◽

pp. 283-302 ◽

Cited By ~ 7

Author(s):

Robert Granger

Keyword(s):

Elliptic Curves ◽

Diffie Hellman

Download Full-text

Computationally Secure Pattern Matching in the Presence of Malicious Adversaries

Advances in Cryptology - ASIACRYPT 2010 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-17373-8_12 ◽

2010 ◽

pp. 195-212 ◽

Cited By ~ 31

Author(s):

Carmit Hazay ◽

Tomas Toft

Keyword(s):

Pattern Matching

Download Full-text

The Degree of Regularity of HFE Systems

Advances in Cryptology - ASIACRYPT 2010 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-17373-8_32 ◽

2010 ◽

pp. 557-576 ◽

Cited By ~ 16

Author(s):

Vivien Dubois ◽

Nicolas Gama

Download Full-text

Advances in Cryptology - ASIACRYPT 2010 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model

Conditional Differential Cryptanalysis of NLFSR-Based Cryptosystems

Random Oracles with(out) Programmability

The World Is Not Enough: Another Look on Second-Order DPA

The Round Complexity of Verifiable Secret Sharing: The Statistical Case

Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2

General Perfectly Secure Message Transmission Using Linear Codes

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

Computationally Secure Pattern Matching in the Presence of Malicious Adversaries

The Degree of Regularity of HFE Systems

Advances in Cryptology - ASIACRYPT 2010 - Lecture Notes in Computer Science
Latest Publications