Search the dblp DataBase
Anna Lysyanskaya :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Moses Liskov , Anna Lysyanskaya , Silvio Micali , Leonid Reyzin , Adam Smith Mutually Independent Commitments. [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 2001, pp:385-401 [Conf ] 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 ] 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 ] 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 ] 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 ] Jan Camenisch , Anna Lysyanskaya Signature Schemes and Anonymous Credentials from Bilinear Maps. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2004, pp:56-72 [Conf ] 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 ] Jan Camenisch , Anna Lysyanskaya A Formal Treatment of Onion Routing. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2005, pp:169-187 [Conf ] Jan Camenisch , Anna Lysyanskaya An Identity Escrow Scheme with Appointed Verifiers. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2001, pp:388-407 [Conf ] Anna Lysyanskaya Unique Signatures and Verifiable Random Functions from the DH-DDH Separation. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2002, pp:597-612 [Conf ] Melissa Chase , Anna Lysyanskaya On Signatures of Knowledge. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:78-96 [Conf ] Anna Lysyanskaya , Nikos Triandopoulos Rationality and Adversarial Behavior in Multi-party Computation. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:180-197 [Conf ] 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 ] Jan Camenisch , Susan Hohenberger , Anna Lysyanskaya Compact E-Cash. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2005, pp:302-321 [Conf ] 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 ] Stanislaw Jarecki , Anna Lysyanskaya Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2000, pp:221-242 [Conf ] 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 ] 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 ] Anna Lysyanskaya , Mira Meyerovich Provably Secure Steganography with Imperfect Sampling. [Citation Graph (0, 0)][DBLP ] Public Key Cryptography, 2006, pp:123-139 [Conf ] Yehuda Lindell , Anna Lysyanskaya , Tal Rabin Sequential composition of protocols without simultaneous termination. [Citation Graph (0, 0)][DBLP ] PODC, 2002, pp:203-212 [Conf ] 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 ] Jan Camenisch , Anna Lysyanskaya A Signature Scheme with Efficient Protocols. [Citation Graph (0, 0)][DBLP ] SCN, 2002, pp:268-289 [Conf ] 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 ] 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 ] 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 ] 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 ] Yehuda Lindell , Anna Lysyanskaya , Tal Rabin On the composition of authenticated byzantine agreement. [Citation Graph (0, 0)][DBLP ] STOC, 2002, pp:514-523 [Conf ] 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 ] Susan Hohenberger , Anna Lysyanskaya How to Securely Outsource Cryptographic Computations. [Citation Graph (0, 0)][DBLP ] TCC, 2005, pp:264-282 [Conf ] 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 ] Melissa Chase , Anna Lysyanskaya Simulatable VRFs with Applications to Multi-theorem NIZK. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2007, pp:303-322 [Conf ] Randomizable Proofs and Delegatable Anonymous Credentials. [Citation Graph (, )][DBLP ] Usable Optimistic Fair Exchange. [Citation Graph (, )][DBLP ] Optimistic Fair Exchange with Multiple Arbiters. [Citation Graph (, )][DBLP ] Brief announcement: impossibility results for optimistic fair exchange with multiple autonomous arbiters. [Citation Graph (, )][DBLP ] Algorithmic Tamper-Proof Security under Probing Attacks. [Citation Graph (, )][DBLP ] Incentivizing outsourced computation. [Citation Graph (, )][DBLP ] P-signatures and Noninteractive Anonymous Credentials. [Citation Graph (, )][DBLP ] Making p2p accountable without losing privacy. [Citation Graph (, )][DBLP ] Compact E-Cash and Simulatable VRFs Revisited. [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.006secs