The SCEAS System
Navigation Menu

Search the dblp DataBase


Anna Lysyanskaya: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam Smith
    Mutually Independent Commitments. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2001, pp:385-401 [Conf]
  2. Anna Lysyanskaya, Chris Peikert
    Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2001, pp:331-350 [Conf]
  3. Christian Cachin, Klaus Kursawe, Anna Lysyanskaya, Reto Strobl
    Asynchronous verifiable secret sharing and proactive cryptosystems. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2002, pp:88-97 [Conf]
  4. Danfeng Yao, Nelly Fazio, Yevgeniy Dodis, Anna Lysyanskaya
    ID-based encryption for complex hierarchies with applications to forward security and broadcast encryption. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2004, pp:354-363 [Conf]
  5. Jan Camenisch, Susan Hohenberger, Markulf Kohlweiss, Anna Lysyanskaya, Mira Meyerovich
    How to win the clonewars: efficient periodic n-times anonymous authentication. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2006, pp:201-210 [Conf]
  6. Jan Camenisch, Anna Lysyanskaya
    Signature Schemes and Anonymous Credentials from Bilinear Maps. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:56-72 [Conf]
  7. Jan Camenisch, Anna Lysyanskaya
    Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:61-76 [Conf]
  8. Jan Camenisch, Anna Lysyanskaya
    A Formal Treatment of Onion Routing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2005, pp:169-187 [Conf]
  9. Jan Camenisch, Anna Lysyanskaya
    An Identity Escrow Scheme with Appointed Verifiers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:388-407 [Conf]
  10. Anna Lysyanskaya
    Unique Signatures and Verifiable Random Functions from the DH-DDH Separation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:597-612 [Conf]
  11. Melissa Chase, Anna Lysyanskaya
    On Signatures of Knowledge. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:78-96 [Conf]
  12. Anna Lysyanskaya, Nikos Triandopoulos
    Rationality and Adversarial Behavior in Multi-party Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:180-197 [Conf]
  13. Melissa Chase, Alexander Healy, Anna Lysyanskaya, Tal Malkin, Leonid Reyzin
    Mercurial Commitments with Applications to Zero-Knowledge Sets. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:422-439 [Conf]
  14. Jan Camenisch, Susan Hohenberger, Anna Lysyanskaya
    Compact E-Cash. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:302-321 [Conf]
  15. Jan Camenisch, Anna Lysyanskaya
    An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:93-118 [Conf]
  16. Stanislaw Jarecki, Anna Lysyanskaya
    Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:221-242 [Conf]
  17. Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Hovav Shacham
    Sequential Aggregate Signatures from Trapdoor Permutations. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:74-90 [Conf]
  18. Anna Lysyanskaya, Zulfikar Ramzan
    Group Blind Digital Signatures: A Scalable Solution to Electronic Cash. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 1998, pp:184-197 [Conf]
  19. Anna Lysyanskaya, Mira Meyerovich
    Provably Secure Steganography with Imperfect Sampling. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2006, pp:123-139 [Conf]
  20. Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
    Sequential composition of protocols without simultaneous termination. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:203-212 [Conf]
  21. Anna Lysyanskaya, Ronald L. Rivest, Amit Sahai, Stefan Wolf
    Pseudonym Systems. [Citation Graph (0, 0)][DBLP]
    Selected Areas in Cryptography, 1999, pp:184-199 [Conf]
  22. Jan Camenisch, Anna Lysyanskaya
    A Signature Scheme with Efficient Protocols. [Citation Graph (0, 0)][DBLP]
    SCN, 2002, pp:268-289 [Conf]
  23. Jan Camenisch, Susan Hohenberger, Anna Lysyanskaya
    Balancing Accountability and Privacy Using E-Cash (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SCN, 2006, pp:141-155 [Conf]
  24. Anna Lysyanskaya, Roberto Tamassia, Nikos Triandopoulos
    Multicast Authentication in Fully Adversarial Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2004, pp:241-0 [Conf]
  25. Jan Camenisch, Anna Lysyanskaya, Mira Meyerovich
    Endorsed E-Cash. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2007, pp:101-115 [Conf]
  26. Endre Bangerter, Jan Camenisch, Anna Lysyanskaya
    A Cryptographic Framework for the Controlled Release of Certified Data. [Citation Graph (0, 0)][DBLP]
    Security Protocols Workshop, 2004, pp:20-42 [Conf]
  27. Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
    On the composition of authenticated byzantine agreement. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:514-523 [Conf]
  28. Rosario Gennaro, Anna Lysyanskaya, Tal Malkin, Silvio Micali, Tal Rabin
    Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:258-277 [Conf]
  29. Susan Hohenberger, Anna Lysyanskaya
    How to Securely Outsource Cryptographic Computations. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:264-282 [Conf]
  30. Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
    On the composition of authenticated Byzantine Agreement. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:6, pp:881-917 [Journal]
  31. Melissa Chase, Anna Lysyanskaya
    Simulatable VRFs with Applications to Multi-theorem NIZK. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:303-322 [Conf]

  32. Randomizable Proofs and Delegatable Anonymous Credentials. [Citation Graph (, )][DBLP]

  33. Usable Optimistic Fair Exchange. [Citation Graph (, )][DBLP]

  34. Optimistic Fair Exchange with Multiple Arbiters. [Citation Graph (, )][DBLP]

  35. Brief announcement: impossibility results for optimistic fair exchange with multiple autonomous arbiters. [Citation Graph (, )][DBLP]

  36. Algorithmic Tamper-Proof Security under Probing Attacks. [Citation Graph (, )][DBLP]

  37. Incentivizing outsourced computation. [Citation Graph (, )][DBLP]

  38. P-signatures and Noninteractive Anonymous Credentials. [Citation Graph (, )][DBLP]

  39. Making p2p accountable without losing privacy. [Citation Graph (, )][DBLP]

  40. Compact E-Cash and Simulatable VRFs Revisited. [Citation Graph (, )][DBLP]

Search in 0.004secs, Finished in 0.006secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002