 | 2011 |
|---|
| 18 |       | Tolga Acar,
Lan Nguyen:
Revocation for Delegatable Anonymous Credentials.
Public Key Cryptography 2011: 423-440 |
| 2007 |
|---|
| 17 | | Lan Nguyen:
Privacy-Protecting Coupon System Revisited.
IACR Cryptology ePrint Archive 2007: 5 (2007) |
| 16 | | Lan Nguyen:
Efficient Dynamic k-Times Anonymous Authentication.
IACR Cryptology ePrint Archive 2007: 6 (2007) |
| 2006 |
|---|
| 15 | | Lan Nguyen:
Privacy-Protecting Coupon System Revisited.
Financial Cryptography 2006: 266-280 |
| 14 | | Lan Nguyen:
Efficient Dynamic k-Times Anonymous Authentication.
VIETCRYPT 2006: 81-98 |
| 13 | | Lan Nguyen,
Reihaneh Safavi-Naini,
Kaoru Kurosawa:
Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security.
Int. J. Inf. Sec. 5(4): 241-255 (2006) |
| 2005 |
|---|
| 12 | | Lan Nguyen,
Reihaneh Safavi-Naini:
Dynamic k-Times Anonymous Authentication.
ACNS 2005: 318-333 |
| 11 | | Lan Nguyen:
Accumulators from Bilinear Pairings and Applications.
CT-RSA 2005: 275-292 |
| 10 | | Lan Nguyen:
Accumulators from Bilinear Pairings and Applications to ID-based Ring Signatures and Group Membership Revocation.
IACR Cryptology ePrint Archive 2005: 123 (2005) |
| 9 | | Lan Nguyen,
Reihaneh Safavi-Naini,
Kaoru Kurosawa:
A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem.
IACR Cryptology ePrint Archive 2005: 162 (2005) |
| 8 | | Lan Nguyen,
Reihaneh Safavi-Naini:
Dynamic k-Times Anonymous Authentication.
IACR Cryptology ePrint Archive 2005: 168 (2005) |
| 7 | | Lan Nguyen,
Reihaneh Safavi-Naini,
Kaoru Kurosawa:
Verifiable Shuffles: A Formal Model and a Paillier-based 3-Round Construction with Provable Security.
IACR Cryptology ePrint Archive 2005: 199 (2005) |
| 6 | | Lan Nguyen,
Reihaneh Safavi-Naini,
Kaoru Kurosawa:
A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem.
J. UCS 11(6): 986-1010 (2005) |
| 2004 |
|---|
| 5 | | Lan Nguyen,
Reihaneh Safavi-Naini,
Kaoru Kurosawa:
Verifiable Shuffles: A Formal Model and a Paillier-Based Efficient Construction with Provable Security.
ACNS 2004: 61-75 |
| 4 | | Lan Nguyen,
Reihaneh Safavi-Naini:
Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings.
ASIACRYPT 2004: 372-386 |
| 3 |  | Lan Nguyen,
Reihaneh Safavi-Naini:
An Efficient Verifiable Shuffle with Perfect Zero-knowledge Proof System.
Cryptographic Algorithms and their Uses 2004: 40-56 |
| 2 | | Lan Nguyen,
Reihaneh Safavi-Naini:
Efficient and Provably Secure Trapdoor-free Group Signature Schemes from Bilinear Pairings.
IACR Cryptology ePrint Archive 2004: 104 (2004) |
| 2003 |
|---|
| 1 | | Lan Nguyen,
Reihaneh Safavi-Naini:
Breaking and Mending Resilient Mix-Nets.
Privacy Enhancing Technologies 2003: 66-80 |
Data released under the ODC-BY 1.0 license — See also our legal information page