Karen Azari

Orcid: 0009-0009-9303-750X

Affiliations:
  • University of Vienna, Vienna, Austria


According to our database1, Karen Azari authored at least 28 papers between 2017 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
On Verifiable Delay Functions from Time-Lock Puzzles.
Proceedings of the Public-Key Cryptography - PKC 2026, 2026

Impossibility of VDFs in the ROM: The Complete Picture.
Proceedings of the Advances in Cryptology - EUROCRYPT 2026, 2026

Separating Verifiable Delay Functions and Time-Lock Puzzles.
Proceedings of the Advances in Cryptology - EUROCRYPT 2026, 2026

2025
Security Amplification of Threshold Signatures in the Standard Model.
Proceedings of the Theory of Cryptography - 23rd International Conference, 2025

Securely Instantiating 'Half Gates' Garbling in the Standard Model.
Proceedings of the Public-Key Cryptography - PKC 2025, 2025

On the Adaptive Security of Free-XOR-Based Garbling Schemes in the Plain Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Tighter Provable Security for TreeKEM.
Proceedings of the Applied Cryptography and Network Security, 2025

2024
Tighter Security for Group Key Agreement in the Random Oracle Model.
IACR Cryptol. ePrint Arch., 2024

DeCAF: Decentralizable CGKA with Fast Healing.
Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024

Compact Selective Opening Security from LWE.
Proceedings of the Public-Key Cryptography - PKC 2024, 2024

2023
Compact Lossy Trapdoor Functions and Selective Opening Security From LWE.
IACR Cryptol. ePrint Arch., 2023

The Power of Undirected Rewindings for Adaptive Security.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Coffee: Fast Healing Concurrent Continuous Group Key Agreement for Decentralized Group Messaging.
IACR Cryptol. ePrint Arch., 2022

CoCoA: Concurrent Continuous Group Key Agreement.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Practical Statistically-Sound Proofs of Exponentiation in Any Group.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

SNACKs: Leveraging Proofs of Sequential Work for Blockchain Light Clients.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
On the Cost of Adaptivity in Graph-Based Games.
IACR Cryptol. ePrint Arch., 2021

On Treewidth, Separators and Yao's Garbling.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

The Cost of Adaptivity in Security Games on Graphs.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Grafting Key Trees: Efficient Key Management for Overlapping Groups.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.
Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

Inverse-Sybil Attacks in Automated Contact Tracing.
Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

Limits on the Adaptive Security of Yao's Garbling.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2019
Keep the Dirt: Tainted TreeKEM, an Efficient and Provably Secure Continuous Group Key Agreement Protocol.
IACR Cryptol. ePrint Arch., 2019

Adaptively Secure Proxy Re-encryption.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

Reversible Proofs of Sequential Work.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018
On the Memory-Hardness of Data-Independent Password-Hashing Functions.
Proceedings of the 2018 on Asia Conference on Computer and Communications Security, 2018

2017
Be Adaptive, Avoid Overcommitting.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017


  Loading...