2008 - Fellow of Alfred P. Sloan Foundation
The scientist’s investigation covers issues in Computer security, Cryptography, Theoretical computer science, Random oracle and Credential. Group signature and Strong RSA assumption are the core of her Computer security study. Her research integrates issues of Encryption, Ring signature and Blind signature in her study of Cryptography.
Her study focuses on the intersection of Theoretical computer science and fields such as Proof of knowledge with connections in the field of Hash function, Accumulator and Revocation. Her Random oracle research integrates issues from Algorithm and Signature. Her Credential research is multidisciplinary, incorporating elements of Scheme, Security parameter, Authentication and Anonymity.
Anna Lysyanskaya spends much of her time researching Computer security, Cryptography, Theoretical computer science, Random oracle and Credential. Anna Lysyanskaya usually deals with Computer security and limits it to topics linked to Scheme and Identity. Her Cryptography research is multidisciplinary, relying on both Discrete logarithm, Adversary, Verifiable secret sharing and Blind signature.
Her Theoretical computer science research incorporates elements of Signature, Mathematical proof, Digital signature, Proof of knowledge and Strong RSA assumption. Her Random oracle research incorporates themes from Algorithm and Security parameter. Anna Lysyanskaya has included themes like Accumulator, Revocation, Internet privacy and Delegate in her Credential study.
Her primary areas of investigation include Computer security, Encryption, Adversary, Computer network and Credential. Her Identification research extends to the thematically linked field of Computer security. Her research investigates the connection with Adversary and areas like Stateless protocol which intersect with concerns in Line, Random oracle, Distributed computing and Oblivious transfer.
Anna Lysyanskaya combines subjects such as Scheme and Scalability with her study of Computer network. Her Credential course of study focuses on Delegate and Generic group model. Her study in Cryptography is interdisciplinary in nature, drawing from both Modular design, Communication complexity, Anonymity, Accumulator and Revocation.
Her primary scientific interests are in Computer security, Identification, Cryptography, Hash-based message authentication code and DUAL. Her research in Computer security intersects with topics in Signature, Mathematical proof and Theoretical computer science. Anna Lysyanskaya has researched Identification in several fields, including Scheme, Focus and Component.
Her Cryptography research includes elements of Communication complexity, Anonymity, Accumulator, Revocation and Credential. Her Hash-based message authentication code research is classified as research in Algorithm.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Dynamic accumulators and application to efficient revocation of anonymous credentials
Jan Camenisch;Anna Lysyanskaya.
Lecture Notes in Computer Science (2002)
Dynamic accumulators and application to efficient revocation of anonymous credentials
Jan Camenisch;Anna Lysyanskaya.
Lecture Notes in Computer Science (2002)
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation.
Jan Camenisch;Anna Lysyanskaya.
IACR Cryptology ePrint Archive (2001)
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation.
Jan Camenisch;Anna Lysyanskaya.
IACR Cryptology ePrint Archive (2001)
A signature scheme with efficient protocols
Jan Camenisch;Anna Lysyanskaya.
Lecture Notes in Computer Science (2003)
A signature scheme with efficient protocols
Jan Camenisch;Anna Lysyanskaya.
Lecture Notes in Computer Science (2003)
Signature schemes and anonymous credentials from bilinear maps
Jan Camenisch;Anna Lysyanskaya.
Lecture Notes in Computer Science (2004)
Signature schemes and anonymous credentials from bilinear maps
Jan Camenisch;Anna Lysyanskaya.
Lecture Notes in Computer Science (2004)
Pseudonym Systems
Anna Lysyanskaya;Ronald L. Rivest;Amit Sahai;Stefan Wolf.
selected areas in cryptography (1999)
Pseudonym Systems
Anna Lysyanskaya;Ronald L. Rivest;Amit Sahai;Stefan Wolf.
selected areas in cryptography (1999)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
DFINITY
University of Edinburgh
Johns Hopkins University
Boston University
The University of Texas at Austin
University of Bern
IBM (United States)
MIT
Columbia University
Virginia Tech
Columbia University
Northwestern University
University of Catania
JSR (Japan)
North Carolina State University
Duke University
University of Concepción
Towson University
University of Strasbourg
University of Virginia
University of Colorado Denver
University of Rochester
University of California, Los Angeles
University of California, Davis
University of Ulm
University of Illinois at Chicago