Advances in Cryptology — CRYPTO 2000 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540679073, 9783540445982

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Fast Correlation Attacks through Reconstruction of Linear Polynomials

Advances in Cryptology — CRYPTO 2000 - Lecture Notes in Computer Science ◽

10.1007/3-540-44598-6_19 ◽

2000 ◽

pp. 300-315 ◽

Cited By ~ 66

Author(s):

Thomas Johansson ◽

Fredrik Jönsson

Keyword(s):

Correlation Attacks ◽

Fast Correlation Attacks ◽

Linear Polynomials

Download Full-text

Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers

Advances in Cryptology — CRYPTO 2000 - Lecture Notes in Computer Science ◽

10.1007/3-540-44598-6_31 ◽

2000 ◽

pp. 501-514 ◽

Cited By ~ 15

Author(s):

Muxiang Zhang ◽

Agnes Chan

Keyword(s):

Correlation Analysis ◽

Stream Ciphers ◽

Maximum Correlation

Download Full-text

Nonlinearity Bounds and Constructions of Resilient Boolean Functions

Advances in Cryptology — CRYPTO 2000 - Lecture Notes in Computer Science ◽

10.1007/3-540-44598-6_32 ◽

2000 ◽

pp. 515-532 ◽

Cited By ~ 102

Author(s):

Palash Sarkar ◽

Subhamoy Maitra

Keyword(s):

Boolean Functions

Download Full-text

New Public-Key Cryptosystem Using Braid Groups

Advances in Cryptology — CRYPTO 2000 - Lecture Notes in Computer Science ◽

10.1007/3-540-44598-6_10 ◽

2000 ◽

pp. 166-183 ◽

Cited By ~ 113

Author(s):

Ki Hyoung Ko ◽

Sang Jin Lee ◽

Jung Hee Cheon ◽

Jae Woo Han ◽

Ju-sung Kang ◽

...

Keyword(s):

Braid Groups ◽

Public Key ◽

Public Key Cryptosystem ◽

New Public

Download Full-text

Improved Non-committing Encryption Schemes Based on a General Complexity Assumption

Advances in Cryptology — CRYPTO 2000 - Lecture Notes in Computer Science ◽

10.1007/3-540-44598-6_27 ◽

2000 ◽

pp. 432-450 ◽

Cited By ~ 87

Author(s):

Ivan Damgård ◽

Jesper Buus Nielsen

Keyword(s):

Encryption Schemes

Download Full-text

Timed Commitments

Advances in Cryptology — CRYPTO 2000 - Lecture Notes in Computer Science ◽

10.1007/3-540-44598-6_15 ◽

2000 ◽

pp. 236-254 ◽

Cited By ~ 114

Author(s):

Dan Boneh ◽

Moni Naor

Download Full-text

Privacy Preserving Data Mining

Advances in Cryptology — CRYPTO 2000 - Lecture Notes in Computer Science ◽

10.1007/3-540-44598-6_3 ◽

2000 ◽

pp. 36-54 ◽

Cited By ~ 369

Author(s):

Yehuda Lindell ◽

Benny Pinkas

Keyword(s):

Data Mining ◽

Privacy Preserving ◽

Privacy Preserving Data Mining

Download Full-text

On the Round Security of Symmetric-Key Cryptographic Primitives

Advances in Cryptology — CRYPTO 2000 - Lecture Notes in Computer Science ◽

10.1007/3-540-44598-6_24 ◽

2000 ◽

pp. 376-393 ◽

Cited By ~ 22

Author(s):

Zulfikar Ramzan ◽

Leonid Reyzin

Keyword(s):

Cryptographic Primitives ◽

Symmetric Key

Download Full-text

The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search

Advances in Cryptology — CRYPTO 2000 - Lecture Notes in Computer Science ◽

10.1007/3-540-44598-6_23 ◽

2000 ◽

pp. 359-375 ◽

Cited By ~ 31

Author(s):

Anand Desai

Download Full-text

Efficient Non-malleable Commitment Schemes

Advances in Cryptology — CRYPTO 2000 - Lecture Notes in Computer Science ◽

10.1007/3-540-44598-6_26 ◽

2000 ◽

pp. 413-431 ◽

Cited By ~ 46

Author(s):

Marc Fischlin ◽

Roger Fischlin

Keyword(s):

Commitment Schemes

Download Full-text

Advances in Cryptology — CRYPTO 2000 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Fast Correlation Attacks through Reconstruction of Linear Polynomials

Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers

Nonlinearity Bounds and Constructions of Resilient Boolean Functions

New Public-Key Cryptosystem Using Braid Groups

Improved Non-committing Encryption Schemes Based on a General Complexity Assumption

Timed Commitments

Privacy Preserving Data Mining

On the Round Security of Symmetric-Key Cryptographic Primitives

The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search

Efficient Non-malleable Commitment Schemes

Advances in Cryptology — CRYPTO 2000 - Lecture Notes in Computer Science
Latest Publications