Doreen Riepel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Doreen Riepel has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Eike Kiltz
Ruhr University Bochum
5 shared publications - Mihir Bellare
University of California San Diego
5 shared publications - Jiaxin Pan
University of Kassel, Kassel, Germany
3 shared publications - Jonas Meers
Ruhr University Bochum
3 shared publications - Sabrina Kunzweiler
Institut de Mathématiques de Bordeaux, Université de Bordeaux, 351, Cours de la Libération, F-33405 Talence, France
3 shared publications - Dominik Hartmann
Ruhr-Universität Bochum
2 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2865-2879
A Qualitative Study on Ethics Perspectives in Cryptography Research
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2865-2879
Open AccessA Qualitative Study on Ethics Perspectives in Cryptography Research
- Open Access
- 13 August 2026
- Published by Springer Nature
- p. 168-199
Lattice-Based Updatable KEM for Group Messaging
- 13 August 2026
- Published by Springer Nature
- p. 168-199
Open AccessLattice-Based Updatable KEM for Group Messaging
- 12 August 2026
- Published by Springer Nature
- p. 361-393
Just-in-Time-OPRFs and a Modular Framework for Fast Private Set Intersection
- 12 August 2026
- Published by Springer Nature
- p. 361-393
Just-in-Time-OPRFs and a Modular Framework for Fast Private Set Intersection
- 7 May 2026
- Published by Springer Nature
- p. 604-635
The Algebraic Isogeny Model: A General Model with Applications to SQIsign and Key Exchanges
- 7 May 2026
- Published by Springer Nature
- p. 604-635
The Algebraic Isogeny Model: A General Model with Applications to SQIsign and Key Exchanges
- 7 May 2026
- Published by Springer Nature
- p. 66-96
Secure Cloud Storage: Modularization, Network Adversaries and Adaptive Corruptions
- 7 May 2026
- Published by Springer Nature
- p. 66-96
Secure Cloud Storage: Modularization, Network Adversaries and Adaptive Corruptions
- Open Access
- 5 September 2025
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Cryptographic Hardware and Embedded Systems
- Vol. 2025 (4) , 544-587
ABE Cubed: Advanced Benchmarking Extensions for ABE Squared
Since attribute-based encryption (ABE) was proposed in 2005, it has established itself as a valuable tool in the enforcement of access control. For practice, it is important that ABE satisfies many desirable properties such as multi-authority and negations support. Nowadays, we can attain these properties simultaneously, but none of these schemes have been implemented. Furthermore, although simpler schemes have been optimized extensively on a structural level, there is still much room for improvement for these more advanced schemes. However, even if we had schemes with such structural improvements, we would not have a way to benchmark and compare them fairly to measure the effect of such improvements. The only framework that aims to achieve this goal, ABE Squared (TCHES ’22), was designed with simpler schemes in mind.In this work, we propose the ABE Cubed framework, which provides advanced benchmarking extensions for ABE Squared. To motivate our framework, we first apply structural improvements to the decentralized ciphertext-policy ABE scheme supporting negations presented by Riepel, Venema and Verma (ACM CCS ’24), which results in five new schemes with the same properties. We use these schemes to uncover and bridge the gaps in the ABE Squared framework. In particular, we observe that advanced schemes depend on more “variables” that affect the schemes’ efficiency in different dimensions. Whereas ABE Squared only considered one dimension (as was sufficient for the schemes considered there), we devise a benchmarking strategy that allows us to analyze the schemes in multiple dimensions. As a result, we obtain a more complete overview on the computational efficiency of the schemes, and ultimately, this allows us to make better-founded choices about which schemes provide the best efficiency trade-offs for practice.
- 5 September 2025
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Cryptographic Hardware and Embedded Systems
- Vol. 2025 (4) , 544-587
Open AccessABE Cubed: Advanced Benchmarking Extensions for ABE Squared
Since attribute-based encryption (ABE) was proposed in 2005, it has established itself as a valuable tool in the enforcement of access control. For practice, it is important that ABE satisfies many desirable properties such as multi-authority and negations support. Nowadays, we can attain these properties simultaneously, but none of these schemes have been implemented. Furthermore, although simpler schemes have been optimized extensively on a structural level, there is still much room for improvement for these more advanced schemes. However, even if we had schemes with such structural improvements, we would not have a way to benchmark and compare them fairly to measure the effect of such improvements. The only framework that aims to achieve this goal, ABE Squared (TCHES ’22), was designed with simpler schemes in mind.In this work, we propose the ABE Cubed framework, which provides advanced benchmarking extensions for ABE Squared. To motivate our framework, we first apply structural improvements to the decentralized ciphertext-policy ABE scheme supporting negations presented by Riepel, Venema and Verma (ACM CCS ’24), which results in five new schemes with the same properties. We use these schemes to uncover and bridge the gaps in the ABE Squared framework. In particular, we observe that advanced schemes depend on more “variables” that affect the schemes’ efficiency in different dimensions. Whereas ABE Squared only considered one dimension (as was sufficient for the schemes considered there), we devise a benchmarking strategy that allows us to analyze the schemes in multiple dimensions. As a result, we obtain a more complete overview on the computational efficiency of the schemes, and ultimately, this allows us to make better-founded choices about which schemes provide the best efficiency trade-offs for practice.
- 5 May 2025
- Published by Springer Nature
- p. 179-213
Public-Algorithm Substitution Attacks: Subverting Hashing and Verification
- 5 May 2025
- Published by Springer Nature
- p. 179-213
Public-Algorithm Substitution Attacks: Subverting Hashing and Verification
- 5 May 2025
- Published by Springer Nature
- p. 145-178
Intermundium-DL: Assessing the Resilience of Current Schemes to Discrete-Log-Computation Attacks on Public Parameters
- 5 May 2025
- Published by Springer Nature
- p. 145-178
Intermundium-DL: Assessing the Resilience of Current Schemes to Discrete-Log-Computation Attacks on Public Parameters
- 12 December 2024
- Published by Springer Nature
- p. 328-362
The Concrete Security of Two-Party Computation: Simple Definitions, and Tight Proofs for PSI and OPRFs
- 12 December 2024
- Published by Springer Nature
- p. 328-362
The Concrete Security of Two-Party Computation: Simple Definitions, and Tight Proofs for PSI and OPRFs
- 11 December 2024
- Published by Springer Nature
- p. 326-360
Count Corruptions, Not Users: Improved Tightness for Signatures, Encryption and Authenticated Key Exchange
- 11 December 2024
- Published by Springer Nature
- p. 326-360
Count Corruptions, Not Users: Improved Tightness for Signatures, Encryption and Authenticated Key Exchange