Financial Cryptography - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540224204, 9783540278092

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Practical Anonymity for the Masses with MorphMix

Financial Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27809-2_24 ◽

2004 ◽

pp. 233-250 ◽

Cited By ~ 29

Author(s):

Marc Rennhard ◽

Bernhard Plattner

Keyword(s):

The Masses

Download Full-text

An Efficient and Usable Multi-show Non-transferable Anonymous Credential System

Financial Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27809-2_21 ◽

2004 ◽

pp. 196-211 ◽

Cited By ~ 24

Author(s):

Giuseppe Persiano ◽

Ivan Visconti

Keyword(s):

Anonymous Credential

Download Full-text

Visualization Tools for Security Administrators

Financial Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27809-2_13 ◽

2004 ◽

pp. 112-113

Author(s):

William Yurick

Keyword(s):

Visualization Tools

Download Full-text

Timing Attacks in Low-Latency Mix Systems

Financial Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27809-2_25 ◽

2004 ◽

pp. 251-265 ◽

Cited By ~ 145

Author(s):

Brian N. Levine ◽

Michael K. Reiter ◽

Chenxi Wang ◽

Matthew Wright

Keyword(s):

Low Latency ◽

Timing Attacks

Download Full-text

Identity-Based Chameleon Hash and Applications

Financial Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27809-2_19 ◽

2004 ◽

pp. 164-180 ◽

Cited By ~ 60

Author(s):

Giuseppe Ateniese ◽

Breno de Medeiros

Keyword(s):

Identity Based ◽

Chameleon Hash

Download Full-text

The Ephemeral Pairing Problem

Financial Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27809-2_22 ◽

2004 ◽

pp. 212-226 ◽

Cited By ~ 34

Author(s):

Jaap-Henk Hoepman

Keyword(s):

Pairing Problem

Download Full-text

Call Center Customer Verification by Query-Directed Passwords

Financial Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27809-2_6 ◽

2004 ◽

pp. 54-67 ◽

Cited By ~ 9

Author(s):

Lawrence O’Gorman ◽

Amit Bagga ◽

Jon Bentley

Keyword(s):

Call Center

Download Full-text

Provable Unlinkability against Traffic Analysis

Financial Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27809-2_26 ◽

2004 ◽

pp. 266-280 ◽

Cited By ~ 19

Author(s):

Ron Berman ◽

Amos Fiat ◽

Amnon Ta-Shma

Keyword(s):

Traffic Analysis

Download Full-text

Selecting Correlated Random Actions

Financial Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27809-2_20 ◽

2004 ◽

pp. 181-195 ◽

Cited By ~ 4

Author(s):

Vanessa Teague

Download Full-text

Electronic National Lotteries

Financial Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27809-2_18 ◽

2004 ◽

pp. 147-163 ◽

Cited By ~ 7

Author(s):

Elisavet Konstantinou ◽

Vasiliki Liagkou ◽

Paul Spirakis ◽

Yannis C. Stamatiou ◽

Moti Yung

Download Full-text

Financial Cryptography - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Practical Anonymity for the Masses with MorphMix

An Efficient and Usable Multi-show Non-transferable Anonymous Credential System

Visualization Tools for Security Administrators

Timing Attacks in Low-Latency Mix Systems

Identity-Based Chameleon Hash and Applications

The Ephemeral Pairing Problem

Call Center Customer Verification by Query-Directed Passwords

Provable Unlinkability against Traffic Analysis

Selecting Correlated Random Actions

Electronic National Lotteries

Financial Cryptography - Lecture Notes in Computer Science
Latest Publications