Topics in Cryptology – CT-RSA 2011 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642190735, 9783642190742

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Communication-Efficient 2-Round Group Key Establishment from Pairings

Topics in Cryptology – CT-RSA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19074-2_5 ◽

2011 ◽

pp. 65-76 ◽

Cited By ~ 4

Author(s):

Kashi Neupane ◽

Rainer Steinwandt

Keyword(s):

Key Establishment ◽

Group Key ◽

Group Key Establishment

Download Full-text

On Shortening Ciphertexts: New Constructions for Compact Public Key and Stateful Encryption Schemes

Topics in Cryptology – CT-RSA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19074-2_20 ◽

2011 ◽

pp. 302-318 ◽

Cited By ~ 3

Author(s):

Joonsang Baek ◽

Cheng-Kang Chu ◽

Jianying Zhou

Keyword(s):

Public Key ◽

Encryption Schemes

Download Full-text

A General, Flexible and Efficient Proof of Inclusion and Exclusion

Topics in Cryptology – CT-RSA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19074-2_3 ◽

2011 ◽

pp. 33-48 ◽

Cited By ~ 3

Author(s):

Kun Peng

Download Full-text

Designing Efficient Authenticated Key Exchange Resilient to Leakage of Ephemeral Secret Keys

Topics in Cryptology – CT-RSA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19074-2_10 ◽

2011 ◽

pp. 121-141 ◽

Cited By ~ 15

Author(s):

Atsushi Fujioka ◽

Koutarou Suzuki

Keyword(s):

Key Exchange ◽

Authenticated Key Exchange ◽

Secret Keys

Download Full-text

Defeating RSA Multiply-Always and Message Blinding Countermeasures

Topics in Cryptology – CT-RSA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19074-2_6 ◽

2011 ◽

pp. 77-88 ◽

Cited By ~ 36

Author(s):

Marc F. Witteman ◽

Jasper G. J. van Woudenberg ◽

Federico Menarini

Download Full-text

Better Key Sizes (and Attacks) for LWE-Based Encryption

Topics in Cryptology – CT-RSA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19074-2_21 ◽

2011 ◽

pp. 319-339 ◽

Cited By ~ 242

Author(s):

Richard Lindner ◽

Chris Peikert

Download Full-text

Beyond Provable Security Verifiable IND-CCA Security of OAEP

Topics in Cryptology – CT-RSA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19074-2_13 ◽

2011 ◽

pp. 180-196 ◽

Cited By ~ 13

Author(s):

Gilles Barthe ◽

Benjamin Grégoire ◽

Yassine Lakhnech ◽

Santiago Zanella Béguelin

Keyword(s):

Provable Security

Download Full-text

Meet-in-the-Middle Attacks on Reduced-Round XTEA

Topics in Cryptology – CT-RSA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19074-2_17 ◽

2011 ◽

pp. 250-267 ◽

Cited By ~ 15

Author(s):

Gautham Sekar ◽

Nicky Mouha ◽

Vesselin Velichkov ◽

Bart Preneel

Download Full-text

Expedient Non-malleability Notions for Hash Functions

Topics in Cryptology – CT-RSA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19074-2_18 ◽

2011 ◽

pp. 268-283 ◽

Cited By ~ 2

Author(s):

Paul Baecher ◽

Marc Fischlin ◽

Dominique Schröder

Keyword(s):

Hash Functions

Download Full-text

Improving Differential Power Analysis by Elastic Alignment

Topics in Cryptology – CT-RSA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19074-2_8 ◽

2011 ◽

pp. 104-119 ◽

Cited By ~ 46

Author(s):

Jasper G. J. van Woudenberg ◽

Marc F. Witteman ◽

Bram Bakker

Keyword(s):

Power Analysis ◽

Differential Power Analysis

Download Full-text

Topics in Cryptology – CT-RSA 2011 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Communication-Efficient 2-Round Group Key Establishment from Pairings

On Shortening Ciphertexts: New Constructions for Compact Public Key and Stateful Encryption Schemes

A General, Flexible and Efficient Proof of Inclusion and Exclusion

Designing Efficient Authenticated Key Exchange Resilient to Leakage of Ephemeral Secret Keys

Defeating RSA Multiply-Always and Message Blinding Countermeasures

Better Key Sizes (and Attacks) for LWE-Based Encryption

Beyond Provable Security Verifiable IND-CCA Security of OAEP

Meet-in-the-Middle Attacks on Reduced-Round XTEA

Expedient Non-malleability Notions for Hash Functions

Improving Differential Power Analysis by Elastic Alignment

Topics in Cryptology – CT-RSA 2011 - Lecture Notes in Computer Science
Latest Publications