Daniel Lieman (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

5 William D. Banks, Daniel Lieman, Igor Shparlinski: An Extremely Small and Efficient Identification Scheme. ACISP 2000: 378-384

4 William D. Banks, Daniel Lieman, Igor Shparlinski, Van Thuong To: Cryptographic Applications of Sparse Polynomials over Finite Rings. ICISC 2000: 206-220

3 William D. Banks, Daniel Lieman, Igor Shparlinski: An Identification Scheme Based on Sparse Polynomials. Public Key Cryptography 2000: 68-74

2 William D. Banks, Frances Griffin, Daniel Lieman, Igor Shparlinski: Non-linear Complexity of the Naor-Reingold Pseudo-random Function. ICISC 1999: 53-59

1 John Friedlander, Michael Larsen, Daniel Lieman, Igor Shparlinski: On The Correlation of Binary Sequences. Des. Codes Cryptography 16(3): 249-256 (1999)

Selection of 5 from 5 records - Daniel Lieman has 6 coauthors

5		William D. Banks, Daniel Lieman, Igor Shparlinski: An Extremely Small and Efficient Identification Scheme. ACISP 2000: 378-384
4		William D. Banks, Daniel Lieman, Igor Shparlinski, Van Thuong To: Cryptographic Applications of Sparse Polynomials over Finite Rings. ICISC 2000: 206-220
3		William D. Banks, Daniel Lieman, Igor Shparlinski: An Identification Scheme Based on Sparse Polynomials. Public Key Cryptography 2000: 68-74
2		William D. Banks, Frances Griffin, Daniel Lieman, Igor Shparlinski: Non-linear Complexity of the Naor-Reingold Pseudo-random Function. ICISC 1999: 53-59
1		John Friedlander, Michael Larsen, Daniel Lieman, Igor Shparlinski: On The Correlation of Binary Sequences. Des. Codes Cryptography 16(3): 249-256 (1999)