Lecture Notes in Computer Science - Advances in Cryptology – ASIACRYPT 2011
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642253843, 9783642253850

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Cryptography Secure against Related-Key Attacks and Tampering

Lecture Notes in Computer Science - Advances in Cryptology – ASIACRYPT 2011 ◽

10.1007/978-3-642-25385-0_26 ◽

2011 ◽

pp. 486-503 ◽

Cited By ~ 63

Author(s):

Mihir Bellare ◽

David Cash ◽

Rachel Miller

Download Full-text

Computational Verifiable Secret Sharing Revisited

Lecture Notes in Computer Science - Advances in Cryptology – ASIACRYPT 2011 ◽

10.1007/978-3-642-25385-0_32 ◽

2011 ◽

pp. 590-609 ◽

Cited By ~ 19

Author(s):

Michael Backes ◽

Aniket Kate ◽

Arpita Patra

Keyword(s):

Secret Sharing ◽

Verifiable Secret Sharing

Download Full-text

Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$

Lecture Notes in Computer Science - Advances in Cryptology – ASIACRYPT 2011 ◽

10.1007/978-3-642-25385-0_6 ◽

2011 ◽

pp. 107-124 ◽

Cited By ~ 64

Author(s):

Alexander May ◽

Alexander Meurer ◽

Enrico Thomae

Keyword(s):

Linear Codes

Download Full-text

Counting Points on Genus 2 Curves with Real Multiplication

Lecture Notes in Computer Science - Advances in Cryptology – ASIACRYPT 2011 ◽

10.1007/978-3-642-25385-0_27 ◽

2011 ◽

pp. 504-519 ◽

Cited By ~ 13

Author(s):

Pierrick Gaudry ◽

David Kohel ◽

Benjamin Smith

Keyword(s):

Real Multiplication ◽

Genus 2 ◽

Genus 2 Curves ◽

Counting Points

Download Full-text

Two Provers in Isolation

Lecture Notes in Computer Science - Advances in Cryptology – ASIACRYPT 2011 ◽

10.1007/978-3-642-25385-0_22 ◽

2011 ◽

pp. 407-430 ◽

Cited By ~ 12

Author(s):

Claude Crépeau ◽

Louis Salvail ◽

Jean-Raymond Simard ◽

Alain Tapp

Download Full-text

Finding SHA-2 Characteristics: Searching through a Minefield of Contradictions

Lecture Notes in Computer Science - Advances in Cryptology – ASIACRYPT 2011 ◽

10.1007/978-3-642-25385-0_16 ◽

2011 ◽

pp. 288-307 ◽

Cited By ~ 32

Author(s):

Florian Mendel ◽

Tomislav Nad ◽

Martin Schläffer

Download Full-text

Natural Generalizations of Threshold Secret Sharing

Lecture Notes in Computer Science - Advances in Cryptology – ASIACRYPT 2011 ◽

10.1007/978-3-642-25385-0_33 ◽

2011 ◽

pp. 610-627 ◽

Cited By ~ 4

Author(s):

Oriol Farràs ◽

Carles Padró ◽

Chaoping Xing ◽

An Yang

Keyword(s):

Secret Sharing ◽

Threshold Secret Sharing

Download Full-text

Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments

Lecture Notes in Computer Science - Advances in Cryptology – ASIACRYPT 2011 ◽

10.1007/978-3-642-25385-0_23 ◽

2011 ◽

pp. 431-448 ◽

Cited By ~ 16

Author(s):

Jens Groth

Keyword(s):

Zero Knowledge

Download Full-text

Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security

Lecture Notes in Computer Science - Advances in Cryptology – ASIACRYPT 2011 ◽

10.1007/978-3-642-25385-0_4 ◽

2011 ◽

pp. 70-88 ◽

Cited By ~ 60

Author(s):

Brett Hemenway ◽

Benoît Libert ◽

Rafail Ostrovsky ◽

Damien Vergnaud

Keyword(s):

Chosen Ciphertext Security

Download Full-text

Lower and Upper Bounds for Deniable Public-Key Encryption

Lecture Notes in Computer Science - Advances in Cryptology – ASIACRYPT 2011 ◽

10.1007/978-3-642-25385-0_7 ◽

2011 ◽

pp. 125-142 ◽

Cited By ~ 11

Author(s):

Rikke Bendlin ◽

Jesper Buus Nielsen ◽

Peter Sebastian Nordholt ◽

Claudio Orlandi

Keyword(s):

Upper Bounds ◽

Public Key ◽

Public Key Encryption ◽

Lower And Upper Bounds

Download Full-text

Lecture Notes in Computer Science - Advances in Cryptology – ASIACRYPT 2011Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Cryptography Secure against Related-Key Attacks and Tampering

Computational Verifiable Secret Sharing Revisited

Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$

Counting Points on Genus 2 Curves with Real Multiplication

Two Provers in Isolation

Finding SHA-2 Characteristics: Searching through a Minefield of Contradictions

Natural Generalizations of Threshold Secret Sharing

Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments

Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security

Lower and Upper Bounds for Deniable Public-Key Encryption

Lecture Notes in Computer Science - Advances in Cryptology – ASIACRYPT 2011
Latest Publications