We are happy to announce that our paper “How To Make Delegated Payments on Bitcoin: A Question for the AI Agentic Future” has been accepted to Financial Cryptography 2026.

Abstract:

AI agents and custodial services are increasingly being entrusted as intermediaries to conduct transactions on behalf of institutions. The stakes are high: The digital asset market is projected to exceed...

We are happy to announce that our paper “Fully-Adaptive Two-Round Threshold Schnorr Signatures from DDH” has been accepted to EUROCRYPT 2026.

Abstract:

Threshold Schnorr signatures enable t-out-of-n parties to collaboratively produce signatures that are indistinguishable from standard Schnorr signatures, ensuring compatibility with existing verification systems. While static-secure...

We are pleased to announce our latest publication, “Password-Hardened Encryption Revisited”, which will be presented at ASIACRYPT'25.

Abstract:

Passwords remain the dominant form of authentication on the Internet. The rise of single sign-on (SSO) services has centralized password storage, increasing the devastating impact of potential attacks and underscoring the need for secure...

We are pleased to announce our latest publication, “Universally Composable and Round-Optimal Password-Hardened Encryption”, which will be presented at ASIACRYPT'25.

Abstract:

We propose the first UC model for Threshold Password-Hardened Encryption (TPHE), unifying and strengthening its security definitions. Along the way, we found a flaw in the security proof of the original TPHE...

We are pleased to announce our latest publication, “Universally Composable SNARKs with Transparent Setup without Programmable Random Oracle”, which was presented at CRYPTO'25.

Abstract:

Non-interactive zero-knowledge (NIZK) proofs enable a prover to convince a verifier of an NP statement’s validity using a single message, without disclosing any additional information. These...

We are pleased to announce our latest publication, “A Fully-Adaptive Threshold Partially-Oblivious PRF”, which will be presented at CRYPTO'25.

Abstract:

Oblivious Pseudorandom Functions (OPRFs) are fundamental cryptographic primitives essential for privacy-enhancing technologies such as private set intersection, oblivious keyword search, and password-based authentication protocols. We...

We are pleased to announce our latest publication, “Automated Analysis and Synthesis of Message Authentication Codes”, which was presented at CSF'25.

Abstract:

Message Authentication Codes (MACs) represent a fundamental symmetric key primitive, serving to ensure the authenticity and integrity of transmitted data.As a building block in authenticated encryption and in numerous deployed...

Our article “Increasing the Resilience of Secure Multiparty Computation using Security Modules” has just been published in the top journal IEEE “Transactions on Dependable and Secure Computing”!

Abstract:

We investigate the problem of Secure Multiparty Computation (SMC) in a synchronous system with Byzantine failures where processes have access to trusted hardware. While previous...

We’re excited to launch the new website for the Privacy Enhancing Technologies Group at the Vienna University of Technology! Explore our research, projects and events all in one place. Stay connected and discover the latest in Privacy Enhancing Technologies.

We are pleased to announce our latest publication, “SoK: Descriptive Statistics Under Local Differential Privacy”, which will be presented at PETS'25. This work provides a comprehensive survey and systematization of existing techniques for performing descriptive statistical analysis while preserving privacy under Local Differential Privacy (LDP).

Our study delves into the strengths and...

We are pleased to announce the publication of our paper Measuring Conditional Anonymity - A Global Study at PETS'24.

Our research examines the real-world effectiveness of pseudonymization in health applications, focusing on two major applications in 39 countries. Key findings show that users of a popular menstruation tracking app can be de-anonymized to groups of as few as five people in 97% of...