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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319765808, 9783319765815

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Attribute-Based Signatures for Unbounded Circuits in the ROM and Efficient Instantiations from Lattices

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

10.1007/978-3-319-76581-5_4 ◽

2018 ◽

pp. 89-119 ◽

Cited By ~ 9

Author(s):

Ali El Kaafarani ◽

Shuichi Katsumata

Download Full-text

Learning with Errors and Extrapolated Dihedral Cosets

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

10.1007/978-3-319-76581-5_24 ◽

2018 ◽

pp. 702-727 ◽

Cited By ~ 2

Author(s):

Zvika Brakerski ◽

Elena Kirshanova ◽

Damien Stehlé ◽

Weiqiang Wen

Keyword(s):

Learning With Errors

Download Full-text

Local Non-malleable Codes in the Bounded Retrieval Model

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

10.1007/978-3-319-76581-5_10 ◽

2018 ◽

pp. 281-311 ◽

Cited By ~ 1

Author(s):

Dana Dachman-Soled ◽

Mukul Kulkarni ◽

Aria Shahverdi

Keyword(s):

Retrieval Model ◽

Bounded Retrieval Model

Download Full-text

Non-malleability vs. CCA-Security: The Case of Commitments

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

10.1007/978-3-319-76581-5_11 ◽

2018 ◽

pp. 312-337 ◽

Cited By ~ 2

Author(s):

Brandon Broadnax ◽

Valerie Fetzer ◽

Jörn Müller-Quade ◽

Andy Rupp

Download Full-text

Hash Proof Systems over Lattices Revisited

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

10.1007/978-3-319-76581-5_22 ◽

2018 ◽

pp. 644-674 ◽

Cited By ~ 12

Author(s):

Fabrice Benhamouda ◽

Olivier Blazy ◽

Léo Ducas ◽

Willy Quach

Keyword(s):

Proof Systems

Download Full-text

Rounded Gaussians

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

10.1007/978-3-319-76581-5_25 ◽

2018 ◽

pp. 728-757 ◽

Cited By ~ 5

Author(s):

Andreas Hülsing ◽

Tanja Lange ◽

Kit Smeets

Download Full-text

Compact Zero-Knowledge Proofs of Small Hamming Weight

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

10.1007/978-3-319-76581-5_18 ◽

2018 ◽

pp. 530-560 ◽

Cited By ~ 4

Author(s):

Ivan Damgård ◽

Ji Luo ◽

Sabine Oechsner ◽

Peter Scholl ◽

Mark Simkin

Keyword(s):

Hamming Weight ◽

Zero Knowledge

Download Full-text

Full-Hiding (Unbounded) Multi-input Inner Product Functional Encryption from the k-Linear Assumption

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

10.1007/978-3-319-76581-5_9 ◽

2018 ◽

pp. 245-277 ◽

Cited By ~ 14

Author(s):

Pratish Datta ◽

Tatsuaki Okamoto ◽

Junichi Tomida

Keyword(s):

Inner Product ◽

Functional Encryption

Download Full-text

Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials

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

10.1007/978-3-319-76581-5_19 ◽

2018 ◽

pp. 561-588 ◽

Cited By ~ 7

Author(s):

Jonathan Bootle ◽

Jens Groth

Keyword(s):

Zero Knowledge ◽

Low Degree ◽

Low Degree Polynomials

Download Full-text

Simple and Generic Constructions of Succinct Functional Encryption

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

10.1007/978-3-319-76581-5_7 ◽

2018 ◽

pp. 187-217 ◽

Cited By ~ 4

Author(s):

Fuyuki Kitagawa ◽

Ryo Nishimaki ◽

Keisuke Tanaka

Keyword(s):

Functional Encryption

Download Full-text

Public-Key Cryptography – PKC 2018 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Attribute-Based Signatures for Unbounded Circuits in the ROM and Efficient Instantiations from Lattices

Learning with Errors and Extrapolated Dihedral Cosets

Local Non-malleable Codes in the Bounded Retrieval Model

Non-malleability vs. CCA-Security: The Case of Commitments

Hash Proof Systems over Lattices Revisited

Rounded Gaussians

Compact Zero-Knowledge Proofs of Small Hamming Weight

Full-Hiding (Unbounded) Multi-input Inner Product Functional Encryption from the k-Linear Assumption

Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials

Simple and Generic Constructions of Succinct Functional Encryption

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