Lecture Notes in Computer Science - Public-Key Cryptography – PKC 2017
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783662543641, 9783662543658

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Improved Algorithms for the Approximate k-List Problem in Euclidean Norm

Lecture Notes in Computer Science - Public-Key Cryptography – PKC 2017 ◽

10.1007/978-3-662-54365-8_2 ◽

2017 ◽

pp. 16-40 ◽

Cited By ~ 11

Author(s):

Gottfried Herold ◽

Elena Kirshanova

Keyword(s):

Euclidean Norm

Download Full-text

Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes

Lecture Notes in Computer Science - Public-Key Cryptography – PKC 2017 ◽

10.1007/978-3-662-54365-8_13 ◽

2017 ◽

pp. 310-332 ◽

Cited By ~ 10

Author(s):

Dana Dachman-Soled ◽

Mukul Kulkarni ◽

Aria Shahverdi

Keyword(s):

Lower Bounds ◽

Upper And Lower Bounds ◽

Leakage Resilient ◽

Locally Decodable

Download Full-text

Provably Secure NTRU Instances over Prime Cyclotomic Rings

Lecture Notes in Computer Science - Public-Key Cryptography – PKC 2017 ◽

10.1007/978-3-662-54365-8_17 ◽

2017 ◽

pp. 409-434 ◽

Cited By ~ 2

Author(s):

Yang Yu ◽

Guangwu Xu ◽

Xiaoyun Wang

Keyword(s):

Provably Secure

Download Full-text

Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash

Lecture Notes in Computer Science - Public-Key Cryptography – PKC 2017 ◽

10.1007/978-3-662-54365-8_4 ◽

2017 ◽

pp. 61-90 ◽

Cited By ~ 1

Author(s):

David Pointcheval ◽

Olivier Sanders ◽

Jacques Traoré

Download Full-text

Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree

Lecture Notes in Computer Science - Public-Key Cryptography – PKC 2017 ◽

10.1007/978-3-662-54365-8_16 ◽

2017 ◽

pp. 388-408 ◽

Cited By ~ 13

Author(s):

Taechan Kim ◽

Jinhyuck Jeong

Keyword(s):

Number Field ◽

Finite Fields ◽

Number Field Sieve ◽

Extension Degree

Download Full-text

Zeroizing Attacks on Indistinguishability Obfuscation over CLT13

Lecture Notes in Computer Science - Public-Key Cryptography – PKC 2017 ◽

10.1007/978-3-662-54365-8_3 ◽

2017 ◽

pp. 41-58 ◽

Cited By ~ 24

Author(s):

Jean-Sébastien Coron ◽

Moon Sung Lee ◽

Tancrède Lepoint ◽

Mehdi Tibouchi

Keyword(s):

Indistinguishability Obfuscation

Download Full-text

Fully Leakage-Resilient Codes

Lecture Notes in Computer Science - Public-Key Cryptography – PKC 2017 ◽

10.1007/978-3-662-54365-8_14 ◽

2017 ◽

pp. 333-358 ◽

Cited By ~ 1

Author(s):

Antonio Faonio ◽

Jesper Buus Nielsen

Keyword(s):

Leakage Resilient

Download Full-text

Separating IND-CPA and Circular Security for Unbounded Length Key Cycles

Lecture Notes in Computer Science - Public-Key Cryptography – PKC 2017 ◽

10.1007/978-3-662-54365-8_10 ◽

2017 ◽

pp. 232-246 ◽

Cited By ~ 3

Author(s):

Rishab Goyal ◽

Venkata Koppula ◽

Brent Waters

Keyword(s):

Circular Security

Download Full-text

Tightly Secure IBE Under Constant-Size Master Public Key

Lecture Notes in Computer Science - Public-Key Cryptography – PKC 2017 ◽

10.1007/978-3-662-54365-8_9 ◽

2017 ◽

pp. 207-231 ◽

Cited By ~ 11

Author(s):

Jie Chen ◽

Junqing Gong ◽

Jian Weng

Keyword(s):

Public Key ◽

Constant Size

Download Full-text

Asymptotically Tight Bounds for Composing ORAM with PIR

Lecture Notes in Computer Science - Public-Key Cryptography – PKC 2017 ◽

10.1007/978-3-662-54365-8_5 ◽

2017 ◽

pp. 91-120 ◽

Cited By ~ 13

Author(s):

Ittai Abraham ◽

Christopher W. Fletcher ◽

Kartik Nayak ◽

Benny Pinkas ◽

Ling Ren

Download Full-text

Lecture Notes in Computer Science - Public-Key Cryptography – PKC 2017Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Improved Algorithms for the Approximate k-List Problem in Euclidean Norm

Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes

Provably Secure NTRU Instances over Prime Cyclotomic Rings

Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash

Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree

Zeroizing Attacks on Indistinguishability Obfuscation over CLT13

Fully Leakage-Resilient Codes

Separating IND-CPA and Circular Security for Unbounded Length Key Cycles

Tightly Secure IBE Under Constant-Size Master Public Key

Asymptotically Tight Bounds for Composing ORAM with PIR

Lecture Notes in Computer Science - Public-Key Cryptography – PKC 2017
Latest Publications