Dominique Schröder

Orcid: 0000-0001-6943-8914

Affiliations:
  • TU Wien, Austria
  • TU Wien, Vienna, Austria
  • Friedrich-Alexander-Universität Erlangen-Nürnberg (former)
  • Saarland University, Germany (former)
  • University of Maryland, MD, USA (former)
  • Technische Universität Darmstadt, Germany (former)


According to our database1, Dominique Schröder authored at least 85 papers between 2006 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
SoK: Descriptive Statistics Under Local Differential Privacy.
Proc. Priv. Enhancing Technol., 2025

2024
Measuring Conditional Anonymity - A Global Study.
Proc. Priv. Enhancing Technol., 2024

Foundations of Adaptor Signatures.
IACR Cryptol. ePrint Arch., 2024

2023
Practical Schnorr Threshold Signatures Without the Algebraic Group Model.
IACR Cryptol. ePrint Arch., 2023

2022
Everlasting UC Commitments from Fully Malicious PUFs.
J. Cryptol., 2022

ROAST: Robust Asynchronous Schnorr Threshold Signatures.
IACR Cryptol. ePrint Arch., 2022

Inner Product Functional Commitments with Constant-Size Public Parameters and Openings.
IACR Cryptol. ePrint Arch., 2022

Verifiable Timed Linkable Ring Signatures for Scalable Payments for Monero.
Proceedings of the Computer Security - ESORICS 2022, 2022

2021
Foundations of Ring Sampling.
Proc. Priv. Enhancing Technol., 2021

OpenSquare: Decentralized Repeated Modular Squaring Service.
IACR Cryptol. ePrint Arch., 2021

A Security Framework for Distributed Ledgers.
IACR Cryptol. ePrint Arch., 2021

CoinJoin in the Wild - An Empirical Analysis in Dash.
Proceedings of the Computer Security - ESORICS 2021, 2021

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

PayMo: Payment Channels For Monero.
IACR Cryptol. ePrint Arch., 2020

Verifiable Timed Signatures Made Practical.
IACR Cryptol. ePrint Arch., 2020

Threshold Password-Hardened Encryption Services.
IACR Cryptol. ePrint Arch., 2020

The Patient as Genomic Data Manager - Evaluation of the PROMISE App.
Proceedings of the Digital Personalized Health and Medicine - Proceedings of MIE 2020, Medical Informatics Europe, Geneva, Switzerland, April 28, 2020

2019
My Genome Belongs to Me: Controlling Third Party Computation on Genomic Data.
Proc. Priv. Enhancing Technol., 2019

On Tight Security Proofs for Schnorr Signatures.
J. Cryptol., 2019

(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens.
J. Cryptol., 2019

Group ORAM for privacy and access control in outsourced personal records.
J. Comput. Secur., 2019

Omniring: Scaling Up Private Payments Without Trusted Setup - Formal Foundations and Constructions of Ring Confidential Transactions with Log-size Proofs.
IACR Cryptol. ePrint Arch., 2019

Arithmetic Garbling from Bilinear Maps.
IACR Cryptol. ePrint Arch., 2019

Efficient Invisible and Unlinkable Sanitizable Signatures.
IACR Cryptol. ePrint Arch., 2019

Omniring: Scaling Private Payments Without Trusted Setup.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Functional Credentials.
Proc. Priv. Enhancing Technol., 2018

Delegatable functional signatures.
IET Inf. Secur., 2018

Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys.
IET Inf. Secur., 2018

Burning Zerocoins for Fun and for Profit: A Cryptographic Denial-of-Spending Attack on the Zerocoin Protocol.
IACR Cryptol. ePrint Arch., 2018

Homomorphic Secret Sharing for Low Degree Polynomials.
IACR Cryptol. ePrint Arch., 2018

Simple Password-Hardened Encryption Services.
Proceedings of the 27th USENIX Security Symposium, 2018

(Short Paper) Burning Zerocoins for Fun and for Profit - A Cryptographic Denial-of-Spending Attack on the Zerocoin Protocol.
Proceedings of the Crypto Valley Conference on Blockchain Technology, 2018

2017
Security of Blind Signatures Revisited.
J. Cryptol., 2017

Maliciously Secure Multi-Client ORAM.
IACR Cryptol. ePrint Arch., 2017

Efficient Sanitizable Signatures without Random Oracles.
IACR Cryptol. ePrint Arch., 2017

Two-Message, Oblivious Evaluation of Cryptographic Functionalities.
IACR Cryptol. ePrint Arch., 2017

Phoenix: Rebirth of a Cryptographic Password-Hardening Service.
Proceedings of the 26th USENIX Security Symposium, 2017

On the Security of Frequency-Hiding Order-Preserving Encryption.
Proceedings of the Cryptology and Network Security - 16th International Conference, 2017

Subset Predicate Encryption and Its Applications.
Proceedings of the Cryptology and Network Security - 16th International Conference, 2017

Efficient Ring Signatures in the Standard Model.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Nearly Optimal Verifiable Data Streaming.
Proceedings of the Public-Key Cryptography - PKC 2016, 2016

Delegatable Functional Signatures.
Proceedings of the Public-Key Cryptography - PKC 2016, 2016

Efficient Cryptographic Password Hardening Services from Partially Oblivious Commitments.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Foundations of Reconfigurable PUFs (Full Version).
IACR Cryptol. ePrint Arch., 2015

Privacy and Access Control for Outsourced Personal Records.
IACR Cryptol. ePrint Arch., 2015

Nearly Optimal Verifiable Data Streaming (Full Version).
IACR Cryptol. ePrint Arch., 2015

Efficient Unlinkable Sanitizable Signatures from Signatures with Rerandomizable Keys.
IACR Cryptol. ePrint Arch., 2015

Efficient Pseudorandom Functions via On-the-Fly Adaptation.
IACR Cryptol. ePrint Arch., 2015

VeriStream - A Framework for Verifiable Data Streaming.
Proceedings of the Financial Cryptography and Data Security, 2015

Verifiably Encrypted Signatures: Security Revisited and a New Construction.
Proceedings of the Computer Security - ESORICS 2015, 2015

Liar, Liar, Coins on Fire!: Penalizing Equivocation By Loss of Bitcoins.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Foundations of Reconfigurable PUFs.
Proceedings of the Applied Cryptography and Network Security, 2015

2014
Operational Signature Schemes.
IACR Cryptol. ePrint Arch., 2014

Brief announcement: towards security and privacy for outsourced data in the multi-party setting.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Ubic: Bridging the Gap between Digital Cryptography and the Physical World.
Proceedings of the Computer Security - ESORICS 2014, 2014

POSTER: Enhancing Security and Privacy with Google Glass.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

WebTrust - A Comprehensive Authenticity and Integrity Framework for HTTP.
Proceedings of the Applied Cryptography and Network Security, 2014

2013
Verifiable Data Streaming.
IACR Cryptol. ePrint Arch., 2013

Aggregate and Verifiably Encrypted Signatures from Multilinear Maps Without Random Oracles.
IACR Cryptol. ePrint Arch., 2013

Unconditional Tightness Bounds for Generic Reductions: The Exact Security of Schnorr Signatures, Revisited.
IACR Cryptol. ePrint Arch., 2013

Highly Controlled, Fine-grained Delegation of Signing Capabilities.
IACR Cryptol. ePrint Arch., 2013

2012
Security of blind signatures under aborts and applications to adaptive oblivious transfer.
J. Math. Cryptol., 2012

2011
Round Optimal Blind Signatures.
IACR Cryptol. ePrint Arch., 2011

History-Free Sequential Aggregate Signatures.
IACR Cryptol. ePrint Arch., 2011

Impossibility of Blind Signatures from One-Way Permutations.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

How to Aggregate the CL Signature Scheme.
Proceedings of the Computer Security - ESORICS 2011, 2011

Expedient Non-malleability Notions for Hash Functions.
Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

Round Optimal Blind Signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010
On the complexity of blind signatures.
PhD thesis, 2010

Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs.
IACR Cryptol. ePrint Arch., 2010

Uniqueness is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations.
IACR Cryptol. ePrint Arch., 2010

CAPTCHAs: The Good, the Bad, and the Ugly.
Proceedings of the Sicherheit 2010: Sicherheit, 2010

History-Free Aggregate Message Authentication Codes.
Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

Unlinkability of Sanitizable Signatures.
Proceedings of the Public Key Cryptography, 2010

On the Impossibility of Three-Move Blind Signature Schemes.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Fair Partially Blind Signatures.
Proceedings of the Progress in Cryptology, 2010

Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions.
Proceedings of the Progress in Cryptology, 2010

Redactable Signatures for Tree-Structured Data: Definitions and Constructions.
Proceedings of the Applied Cryptography and Network Security, 8th International Conference, 2010

2009
Security of Verifiably Encrypted Signatures.
IACR Cryptol. ePrint Arch., 2009

Confidential Signatures and Deterministic Signcryption.
IACR Cryptol. ePrint Arch., 2009

Security of Blind Signatures under Aborts.
Proceedings of the Public Key Cryptography, 2009

Security of Sanitizable Signatures Revisited.
Proceedings of the Public Key Cryptography, 2009

Security of Verifiably Encrypted Signatures and a Construction without Random Oracles.
Proceedings of the Pairing-Based Cryptography, 2009

Santizable Signatures: How to Partially Delegate Control for Authenticated Data.
Proceedings of the BIOSIG 2009, 2009

2006
Mobi: Eine Infrastruktur für das Internet der Dinge.
Proceedings of the Informatiktage 2006, 2006


  Loading...