Anna Lysyanskaya

Orcid: 0000-0002-3567-3550

Affiliations:
  • Brown University, Providence, RI, USA


According to our database1, Anna Lysyanskaya authored at least 89 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
RSA-Based Dynamic Accumulator without Hashing into Primes.
IACR Cryptol. ePrint Arch., 2024

2023
Aggregate Signatures with Versatile Randomization and Issuer-Hiding Multi-Authority Anonymous Credentials.
IACR Cryptol. ePrint Arch., 2023

Lattice-based Commit-Transferrable Signatures and Applications to Anonymous Credentials.
IACR Cryptol. ePrint Arch., 2023

PACIFIC: Privacy-preserving automated contact tracing scheme featuring integrity against cloning.
IACR Cryptol. ePrint Arch., 2023

2022
Efficient and Universally Composable Non-Interactive Zero-Knowledge Proofs of Knowledge with Security Against Adaptive Corruptions.
IACR Cryptol. ePrint Arch., 2022

Universally Composable Sigma-protocols in the Global Random-Oracle Model.
IACR Cryptol. ePrint Arch., 2022

Security Analysis of RSA-BSSA.
IACR Cryptol. ePrint Arch., 2022

Privacy-Preserving Blueprints.
IACR Cryptol. ePrint Arch., 2022

Compact Cut-and-Choose: Boosting the Security of Blind Signature Schemes, Compactly.
IACR Cryptol. ePrint Arch., 2022

Poly Onions: Achieving Anonymity in the Presence of Churn.
IACR Cryptol. ePrint Arch., 2022

Universally Composable $\varSigma $-protocols in the Global Random-Oracle Model.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

PI-Cut-Choo and Friends: Compact Blind Signatures via Parallel Instance Cut-and-Choose and More.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Mercurial Signatures for Variable-Length Messages.
Proc. Priv. Enhancing Technol., 2021

Safepaths: Vaccine Diary Protocol and Decentralized Vaccine Coordination System using a Privacy Preserving User Centric Experience.
CoRR, 2021

On the Complexity of Anonymous Communication Through Public Networks.
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020
Feasibility and Infeasibility of Secure Computation with Malicious PUFs.
J. Cryptol., 2020

Privacy-Preserving Automated Exposure Notification.
IACR Cryptol. ePrint Arch., 2020

Cryptographic Shallots: A Formal Treatment of Repliable Onion Encryption.
IACR Cryptol. ePrint Arch., 2020

2019
Fully Homomorphic NIZK and NIWI Proofs.
IACR Cryptol. ePrint Arch., 2019

Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042).
Dagstuhl Reports, 2019

2018
Delegatable Anonymous Credentials from Mercurial Signatures.
IACR Cryptol. ePrint Arch., 2018

Practical and Provably Secure Onion Routing.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Accumulators with Applications to Anonymity-Preserving Revocation.
IACR Cryptol. ePrint Arch., 2017

Scalable and Provably Secure P2P Communication Protocols.
CoRR, 2017

2015
Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of an HMAC Assumption.
IACR Cryptol. ePrint Arch., 2015

A Single Password for Everything?
ERCIM News, 2015

2014
Memento: How to Reconstruct your Secrets from a Single Password in a Hostile Environment.
IACR Cryptol. ePrint Arch., 2014

Malleable Signatures: New Definitions and Delegatable Anonymous Credentials.
Proceedings of the IEEE 27th Computer Security Foundations Symposium, 2014

2013
Mercurial Commitments with Applications to Zero-Knowledge Sets.
J. Cryptol., 2013

Malleable Signatures: Complex Unary Transformations and Delegatable Anonymous Credentials.
IACR Cryptol. ePrint Arch., 2013

Incentivizing Outsourced Computation.
IACR Cryptol. ePrint Arch., 2013

Efficient E-Cash in Practice: NFC-Based Payments for Public Transportation Systems.
Proceedings of the Privacy Enhancing Technologies - 13th International Symposium, 2013

2012
ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash.
IACR Cryptol. ePrint Arch., 2012

Tamper and Leakage Resilience in the Split-State Model.
IACR Cryptol. ePrint Arch., 2012

Verifiable Elections That Scale for Free.
IACR Cryptol. ePrint Arch., 2012

Succinct Malleable NIZKs and an Application to Compact Shuffles.
IACR Cryptol. ePrint Arch., 2012

Malleable Proof Systems and Applications.
IACR Cryptol. ePrint Arch., 2012

Practical Yet Universally Composable Two-Server Password-Authenticated Secret Sharing.
IACR Cryptol. ePrint Arch., 2012

Anonymous Credentials Light.
IACR Cryptol. ePrint Arch., 2012

On The Security of One-Witness Blind Signature Schemes.
IACR Cryptol. ePrint Arch., 2012

Usable optimistic fair exchange.
Comput. Networks, 2012

2011
Public-Key Cryptography (Dagstuhl Seminar 11391).
Dagstuhl Reports, 2011

2010
Authenticated error-correcting codes with applications to multicast authentication.
ACM Trans. Inf. Syst. Secur., 2010

Rational Secret Sharing with Side Information in Point-to-Point Networks via Time-Delayed Encryption.
IACR Cryptol. ePrint Arch., 2010

Algorithmic Tamper-Proof Security under Probing Attacks.
Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

2009
Forward-Secure Hierarchical IBE with Applications to Broadcast Encryption.
Proceedings of the Identity-Based Cryptography, 2009

Optimistic Fair Exchange with Multiple Arbiters.
IACR Cryptol. ePrint Arch., 2009

Compact E-Cash and Simulatable VRFs Revisited.
IACR Cryptol. ePrint Arch., 2009

Brief announcement: impossibility results for optimistic fair exchange with multiple autonomous arbiters.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Randomizable Proofs and Delegatable Anonymous Credentials.
Proceedings of the Advances in Cryptology, 2009

2008
Delegatable Anonymous Credentials.
IACR Cryptol. ePrint Arch., 2008

P-signatures and Noninteractive Anonymous Credentials.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

2007
Authentication without Identification.
IEEE Secur. Priv., 2007

Non-Interactive Anonymous Credentials.
IACR Cryptol. ePrint Arch., 2007

Making p2p accountable without losing privacy.
Proceedings of the 2007 ACM Workshop on Privacy in the Electronic Society, 2007

Endorsed E-Cash.
Proceedings of the 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007

Simulatable VRFs with Applications to Multi-theorem NIZK.
Proceedings of the Advances in Cryptology, 2007

2006
On the composition of authenticated Byzantine Agreement.
J. ACM, 2006

On Signatures of Knowledge.
IACR Cryptol. ePrint Arch., 2006

How to Win the Clone Wars: Efficient Periodic n-Times Anonymous Authentication.
IACR Cryptol. ePrint Arch., 2006

Balancing Accountability and Privacy Using E-Cash (Extended Abstract).
Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006

Provably Secure Steganography with Imperfect Sampling.
Proceedings of the Public Key Cryptography, 2006

Rationality and Adversarial Behavior in Multi-party Computation.
Proceedings of the Advances in Cryptology, 2006

How to win the clonewars: efficient periodic n-times anonymous authentication.
Proceedings of the 13th ACM Conference on Computer and Communications Security, 2006

2005
Steganography with Imperfect Samplers.
IACR Cryptol. ePrint Arch., 2005

Compact E-Cash.
IACR Cryptol. ePrint Arch., 2005

How to Securely Outsource Cryptographic Computations.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

A Formal Treatment of Onion Routing.
Proceedings of the Advances in Cryptology, 2005

2004
ID-Based Encryption for Complex Hierarchies with Applications to Forward Security and Broadcast Encryption.
IACR Cryptol. ePrint Arch., 2004

Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

A Cryptographic Framework for the Controlled Release of Certified Data.
Proceedings of the Security Protocols, 2004

Multicast Authentication in Fully Adversarial Networks.
Proceedings of the 2004 IEEE Symposium on Security and Privacy (S&P 2004), 2004

Signature Schemes and Anonymous Credentials from Bilinear Maps.
Proceedings of the Advances in Cryptology, 2004

2003
Sequential Aggregate Signatures from Trapdoor Permutations.
IACR Cryptol. ePrint Arch., 2003

2002
Signature schemes and applications to cryptographic protocol design.
PhD thesis, 2002

Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems.
IACR Cryptol. ePrint Arch., 2002

A Signature Scheme with Efficient Protocols.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

Sequential composition of protocols without simultaneous termination.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Unique Signatures and Verifiable Random Functions from the DH-DDH Separation.
Proceedings of the Advances in Cryptology, 2002

Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials.
Proceedings of the Advances in Cryptology, 2002

2001
Efficient Revocation of Anonymous Group Membership.
IACR Cryptol. ePrint Arch., 2001

An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation.
IACR Cryptol. ePrint Arch., 2001

An Identity Escrow Scheme with Appointed Verifiers.
Proceedings of the Advances in Cryptology, 2001

Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes.
Proceedings of the Advances in Cryptology, 2001

Mutually Independent Commitments.
Proceedings of the Advances in Cryptology, 2001

2000
Threshold Cryptography Secure Against the Adaptive Adversary, Concurrently.
IACR Cryptol. ePrint Arch., 2000

Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures.
Proceedings of the Advances in Cryptology, 2000

1999
Pseudonym Systems.
Proceedings of the Selected Areas in Cryptography, 6th Annual International Workshop, 1999

1998
Group Blind Digital Signatures: A Scalable Solution to Electronic Cash.
Proceedings of the Financial Cryptography, 1998


  Loading...