Lecture Notes in Computer Science - Security and Cryptography for Networks
Latest Publications

TOTAL DOCUMENTS

31

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer International Publishing

9783319446172, 9783319446189

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Bounded Size-Hiding Private Set Intersection

Lecture Notes in Computer Science - Security and Cryptography for Networks ◽

10.1007/978-3-319-44618-9_24 ◽

2016 ◽

pp. 449-467 ◽

Author(s):

Tatiana Bradley ◽

Sky Faber ◽

Gene Tsudik

Keyword(s):

Set Intersection ◽

Private Set Intersection ◽

Download Full-text

Secret Sharing Schemes for Dense Forbidden Graphs

Lecture Notes in Computer Science - Security and Cryptography for Networks ◽

10.1007/978-3-319-44618-9_27 ◽

2016 ◽

pp. 509-528 ◽

Author(s):

Amos Beimel ◽

Oriol Farràs ◽

Naty Peter

Keyword(s):

Secret Sharing ◽

Secret Sharing Schemes

Download Full-text

Proactive Secret Sharing with a Dishonest Majority

Lecture Notes in Computer Science - Security and Cryptography for Networks ◽

10.1007/978-3-319-44618-9_28 ◽

2016 ◽

pp. 529-548 ◽

Author(s):

Shlomi Dolev ◽

Karim ElDefrawy ◽

Joshua Lampkins ◽

Rafail Ostrovsky ◽

Moti Yung

Keyword(s):

Secret Sharing ◽

Proactive Secret Sharing

Download Full-text

Pen and Paper Arguments for SIMON and SIMON-like Designs

Lecture Notes in Computer Science - Security and Cryptography for Networks ◽

10.1007/978-3-319-44618-9_23 ◽

2016 ◽

pp. 431-446 ◽

Author(s):

Christof Beierle

Download Full-text

High-Precision Secure Computation of Satellite Collision Probabilities

Lecture Notes in Computer Science - Security and Cryptography for Networks ◽

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

2016 ◽

pp. 169-187 ◽

Author(s):

Brett Hemenway ◽

Steve Lu ◽

Rafail Ostrovsky ◽

William Welser IV

Keyword(s):

High Precision ◽

Secure Computation

Download Full-text

Memory Erasability Amplification

Lecture Notes in Computer Science - Security and Cryptography for Networks ◽

10.1007/978-3-319-44618-9_6 ◽

2016 ◽

pp. 104-125 ◽

Author(s):

Jan Camenisch ◽

Robert R. Enderlein ◽

Ueli Maurer

Download Full-text

On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs

Lecture Notes in Computer Science - Security and Cryptography for Networks ◽

10.1007/978-3-319-44618-9_13 ◽

2016 ◽

pp. 237-253 ◽

Author(s):

Yi Deng ◽

Juan Garay ◽

San Ling ◽

Huaxiong Wang ◽

Moti Yung

Keyword(s):

Download Full-text

What Security Can We Achieve Within 4 Rounds?

Lecture Notes in Computer Science - Security and Cryptography for Networks ◽

10.1007/978-3-319-44618-9_26 ◽

2016 ◽

pp. 486-505 ◽

Author(s):

Carmit Hazay ◽

Muthuramakrishnan Venkitasubramaniam

Download Full-text

On Adaptively Secure Multiparty Computation with a Short CRS

Lecture Notes in Computer Science - Security and Cryptography for Networks ◽

10.1007/978-3-319-44618-9_7 ◽

2016 ◽

pp. 129-146 ◽

Author(s):

Ran Cohen ◽

Chris Peikert

Keyword(s):

Secure Multiparty Computation ◽

Multiparty Computation

Download Full-text

Bounded KDM Security from iO and OWF

Lecture Notes in Computer Science - Security and Cryptography for Networks ◽

10.1007/978-3-319-44618-9_30 ◽

2016 ◽

pp. 571-586 ◽

Author(s):

Antonio Marcedone ◽

Rafael Pass ◽

Abhi Shelat

Download Full-text