Andy Rupp

Orcid: 0000-0003-0439-3633

Affiliations:
  • University of Trier, Department of Computer Science, Germany


According to our database1, Andy Rupp authored at least 40 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Why Privacy-Preserving Protocols Are Sometimes Not Enough: A Case Study of the Brisbane Toll Collection Infrastructure.
Proc. Priv. Enhancing Technol., January, 2024

EROR: Efficient Repliable Onion Routing with Strong Provable Privacy.
IACR Cryptol. ePrint Arch., 2024

2023
A Survey on Privacy-Preserving Electronic Toll Collection Schemes for Intelligent Transportation Systems.
IEEE Trans. Intell. Transp. Syst., September, 2023

Universally Composable Auditable Surveillance.
IACR Cryptol. ePrint Arch., 2023

2022
PUBA: Privacy-Preserving User-Data Bookkeeping and Analytics.
Proc. Priv. Enhancing Technol., 2022

Security Against Honorific Adversaries: Efficient MPC with Server-aided Public Verifiability.
IACR Cryptol. ePrint Arch., 2022

2021
Onion Routing with Replies.
IACR Cryptol. ePrint Arch., 2021

2020
P4TC - Provably-Secure yet Practical Privacy-Preserving Toll Collection.
Proc. Priv. Enhancing Technol., 2020

Black-Box Wallets: Fast Anonymous Two-Way Payments for Constrained Devices.
Proc. Priv. Enhancing Technol., 2020

2019
(R)CCA Secure Updatable Encryption with Integrity Protection.
IACR Cryptol. ePrint Arch., 2019

Efficient zero-knowledge arguments in the discrete log setting, revisited.
IACR Cryptol. ePrint Arch., 2019

P6V2G: a privacy-preserving V2G scheme for two-way payments and reputation.
Energy Inform., 2019

2017
New Techniques for Structural Batch Verification in Bilinear Groups with Applications to Groth-Sahai Proofs.
IACR Cryptol. ePrint Arch., 2017

Non-Malleability vs. CCA-Security: The Case of Commitments.
IACR Cryptol. ePrint Arch., 2017

BBA+: Improving the Security and Applicability of Privacy-Preserving Point Collection.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way.
Proc. Priv. Enhancing Technol., 2016

Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts.
IACR Cryptol. ePrint Arch., 2016

Fault-Tolerant Aggregate Signatures.
IACR Cryptol. ePrint Arch., 2016

2015
Cryptographic Theory Meets Practice: Efficient and Privacy-Preserving Payments for Public Transport.
ACM Trans. Inf. Syst. Secur., 2015

Reconfigurable Cryptography: A flexible approach to long-term security.
IACR Cryptol. ePrint Arch., 2015

2014
Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations.
IACR Cryptol. ePrint Arch., 2014

Standard versus Selective Opening Security: Separation and Equivalence Results.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

2013
P4R: Privacy-Preserving Pre-Payments with Refunds for Transportation Systems.
Proceedings of the Financial Cryptography and Data Security, 2013

2012
Efficient Threshold Zero-Knowledge with Applications to User-Centric Protocols.
IACR Cryptol. ePrint Arch., 2012

2011
Hardware SLE solvers: Efficient building blocks for cryptographic and cryptanalyticapplications.
Integr., 2011

2010
The Semi-Generic Group Model and Applications to Pairing-Based Cryptography.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
Computational aspects of cryptography and cryptanalysis.
PhD thesis, 2009

2008
Cryptanalysis with COPACOBANA.
IEEE Trans. Computers, 2008

A Real-World Attack Breaking A5/1 within Hours.
IACR Cryptol. ePrint Arch., 2008

Time-Area Optimized Public-Key Engines: MQ-Cryptosystems as Replacement for Elliptic Curves?
IACR Cryptol. ePrint Arch., 2008

On Black-Box Ring Extraction and Integer Factorization.
IACR Cryptol. ePrint Arch., 2008

Fast Multivariate Signature Generation in Hardware: The Case of Rainbow.
Proceedings of the 16th IEEE International Symposium on Field-Programmable Custom Computing Machines, 2008

Time-Area Optimized Public-Key Engines: -Cryptosystems as Replacement for Elliptic Curves?.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2008

2007
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems.
IACR Cryptol. ePrint Arch., 2007

Faster Multi-Exponentiation through Caching: Accelerating (EC)DSA Signature Verification.
IACR Cryptol. ePrint Arch., 2007

Cryptanalytic Time-Memory Tradeoffs on COPACOBANA.
Proceedings of the 37. Jahrestagung der Gesellschaft für Informatik, 2007

A Hardware-Assisted Realtime Attack on A5/2 Without Precomputations.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2007

2006
A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2).
Proceedings of the 14th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2006), 2006

On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms.
Proceedings of the Advances in Cryptology, 2006

2004
Packet trace manipulation rramework for test labs.
Proceedings of the 4th ACM SIGCOMM Internet Measurement Conference, 2004


  Loading...