Theory of Cryptography - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540785231, 9783540785248

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Which Languages Have 4-Round Zero-Knowledge Proofs?

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78524-8_5 ◽

2008 ◽

pp. 73-88 ◽

Cited By ~ 12

Author(s):

Jonathan Katz

Keyword(s):

Zero Knowledge

Download Full-text

Cryptography and Game Theory: Designing Protocols for Exchanging Information

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78524-8_18 ◽

2008 ◽

pp. 320-339 ◽

Cited By ~ 88

Author(s):

Gillat Kol ◽

Moni Naor

Keyword(s):

Game Theory

Download Full-text

General Properties of Quantum Zero-Knowledge Proofs

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78524-8_7 ◽

2008 ◽

pp. 107-124 ◽

Cited By ~ 9

Author(s):

Hirotada Kobayashi

Keyword(s):

Zero Knowledge ◽

General Properties

Download Full-text

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78524-8_10 ◽

2008 ◽

pp. 155-175 ◽

Cited By ~ 119

Author(s):

Carmit Hazay ◽

Yehuda Lindell

Keyword(s):

Pattern Matching ◽

Set Intersection

Download Full-text

Perfectly-Secure MPC with Linear Communication Complexity

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78524-8_13 ◽

2008 ◽

pp. 213-230 ◽

Cited By ~ 75

Author(s):

Zuzana Beerliová-Trubíniová ◽

Martin Hirt

Keyword(s):

Communication Complexity

Download Full-text

How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78524-8_6 ◽

2008 ◽

pp. 89-106 ◽

Cited By ~ 3

Author(s):

Lior Malka

Keyword(s):

Perfect Simulation ◽

Zero Knowledge ◽

Complete Problem

Download Full-text

MPC vs. SFE: Perfect Security in a Unified Corruption Model

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78524-8_14 ◽

2008 ◽

pp. 231-250 ◽

Cited By ~ 8

Author(s):

Zuzana Beerliová-Trubíniová ◽

Matthias Fitzi ◽

Martin Hirt ◽

Ueli Maurer ◽

Vassilis Zikas

Keyword(s):

Perfect Security

Download Full-text

Equivocal Blind Signatures and Adaptive UC-Security

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78524-8_19 ◽

2008 ◽

pp. 340-355 ◽

Cited By ~ 13

Author(s):

Aggelos Kiayias ◽

Hong-Sheng Zhou

Keyword(s):

Blind Signatures

Download Full-text

A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78524-8_25 ◽

2008 ◽

pp. 445-464 ◽

Cited By ~ 4

Author(s):

Iftach Haitner ◽

Jonathan J. Hoch ◽

Gil Segev

Keyword(s):

Information Retrieval ◽

Lower Bound ◽

Private Information ◽

Communication Complexity ◽

Single Server ◽

Private Information Retrieval

Download Full-text

Bridging Game Theory and Cryptography: Recent Results and Future Directions

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78524-8_15 ◽

2008 ◽

pp. 251-272 ◽

Cited By ~ 57

Author(s):

Jonathan Katz

Keyword(s):

Game Theory ◽

Future Directions

Download Full-text

Theory of Cryptography - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Which Languages Have 4-Round Zero-Knowledge Proofs?

Cryptography and Game Theory: Designing Protocols for Exchanging Information

General Properties of Quantum Zero-Knowledge Proofs

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

Perfectly-Secure MPC with Linear Communication Complexity

How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge

MPC vs. SFE: Perfect Security in a Unified Corruption Model

Equivocal Blind Signatures and Adaptive UC-Security

A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval

Bridging Game Theory and Cryptography: Recent Results and Future Directions

Theory of Cryptography - Lecture Notes in Computer Science
Latest Publications