Advances in Cryptology – EUROCRYPT 2018 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319783802, 9783319783819

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing

Advances in Cryptology – EUROCRYPT 2018 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78381-9_22 ◽

2018 ◽

pp. 597-621 ◽

Cited By ~ 3

Author(s):

Oriol Farràs ◽

Tarik Kaced ◽

Sebastià Martín ◽

Carles Padró

Keyword(s):

Linear Programming ◽

Lower Bounds ◽

Secret Sharing ◽

Programming Technique ◽

Linear Programming Technique

Download Full-text

Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation

Advances in Cryptology – EUROCRYPT 2018 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78381-9_10 ◽

2018 ◽

pp. 259-279 ◽

Cited By ~ 5

Author(s):

Ilan Komargodski ◽

Eylon Yogev

Keyword(s):

Random Oracles

Download Full-text

Homomorphic Lower Digits Removal and Improved FHE Bootstrapping

Advances in Cryptology – EUROCRYPT 2018 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78381-9_12 ◽

2018 ◽

pp. 315-337 ◽

Cited By ~ 9

Author(s):

Hao Chen ◽

Kyoohyung Han

Download Full-text

Towards Breaking the Exponential Barrier for General Secret Sharing

Advances in Cryptology – EUROCRYPT 2018 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78381-9_21 ◽

2018 ◽

pp. 567-596 ◽

Cited By ~ 6

Author(s):

Tianren Liu ◽

Vinod Vaikuntanathan ◽

Hoeteck Wee

Keyword(s):

Secret Sharing

Download Full-text

Bootstrapping for Approximate Homomorphic Encryption

Advances in Cryptology – EUROCRYPT 2018 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78381-9_14 ◽

2018 ◽

pp. 360-384 ◽

Cited By ~ 22

Author(s):

Jung Hee Cheon ◽

Kyoohyung Han ◽

Andrey Kim ◽

Miran Kim ◽

Yongsoo Song

Keyword(s):

Homomorphic Encryption

Download Full-text

Full Indifferentiable Security of the Xor of Two or More Random Permutations Using the $$\chi ^2$$ Method

Advances in Cryptology – EUROCRYPT 2018 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78381-9_15 ◽

2018 ◽

pp. 387-412 ◽

Cited By ~ 5

Author(s):

Srimanta Bhattacharya ◽

Mridul Nandi

Keyword(s):

Random Permutations

Download Full-text

Random Oracles and Non-uniformity

Advances in Cryptology – EUROCRYPT 2018 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78381-9_9 ◽

2018 ◽

pp. 227-258 ◽

Cited By ~ 14

Author(s):

Sandro Coretti ◽

Yevgeniy Dodis ◽

Siyao Guo ◽

John Steinberger

Keyword(s):

Random Oracles

Download Full-text

On the Bit Security of Cryptographic Primitives

Advances in Cryptology – EUROCRYPT 2018 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78381-9_1 ◽

2018 ◽

pp. 3-28 ◽

Cited By ~ 8

Author(s):

Daniele Micciancio ◽

Michael Walter

Keyword(s):

Cryptographic Primitives

Download Full-text

An Improved Affine Equivalence Algorithm for Random Permutations

Advances in Cryptology – EUROCRYPT 2018 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78381-9_16 ◽

2018 ◽

pp. 413-442 ◽

Cited By ~ 2

Author(s):

Itai Dinur

Keyword(s):

Random Permutations ◽

Affine Equivalence

Download Full-text

Unbounded ABE via Bilinear Entropy Expansion, Revisited

Advances in Cryptology – EUROCRYPT 2018 - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78381-9_19 ◽

2018 ◽

pp. 503-534 ◽

Cited By ~ 18

Author(s):

Jie Chen ◽

Junqing Gong ◽

Lucas Kowalczyk ◽

Hoeteck Wee

Download Full-text

Advances in Cryptology – EUROCRYPT 2018 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing

Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation

Homomorphic Lower Digits Removal and Improved FHE Bootstrapping

Towards Breaking the Exponential Barrier for General Secret Sharing

Bootstrapping for Approximate Homomorphic Encryption

Full Indifferentiable Security of the Xor of Two or More Random Permutations Using the $$\chi ^2$$ Method

Random Oracles and Non-uniformity

On the Bit Security of Cryptographic Primitives

An Improved Affine Equivalence Algorithm for Random Permutations

Unbounded ABE via Bilinear Entropy Expansion, Revisited

Advances in Cryptology – EUROCRYPT 2018 - Lecture Notes in Computer Science
Latest Publications