Ahto Buldas

Dirk Draheim

SN Comput. Sci., November, 2023

2022

An Ultra-Scalable Blockchain Platform for Universal Asset Tokenization: Design and Implementation.

[BibT_eX]

[DOI]

IEEE Access, 2022

Secure and Efficient Implementation of Electronic Money.

[BibT_eX]

[DOI]

Dirk Draheim

Proceedings of the Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications, 2022

Towards a Foundation of Web3.

[BibT_eX]

[DOI]

Proceedings of the Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications, 2022

2020

Verified Security of BLT Signature Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Attribute evaluation on attack trees with incomplete information.

[BibT_eX]

[DOI]

Rolando Trujillo-Rasua

Comput. Secur., 2020

Blockchain Technology: Intrinsic Technological and Socio-Economic Barriers - FDSE'2020 Keynote.

[BibT_eX]

[DOI]

Proceedings of the Future Data and Security Engineering - 7th International Conference, 2020

2019

A Blockchain-Assisted Hash-Based Signature Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

A Server-Assisted Hash-Based Signature Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

A New Approach to Constructing Digital Signature Schemes (Extended Paper).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

A New Approach to Constructing Digital Signature Schemes - (Short Paper).

[BibT_eX]

[DOI]

Proceedings of the Advances in Information and Computer Security, 2019

2017

Keyless signature infrastructure and PKI: hash-tree signatures in pre- and post-quantum world.

[BibT_eX]

[DOI]

Int. J. Serv. Technol. Manag., 2017

Long-Term Secure Time-Stamping using Preimage-Aware Hash Functions.

[BibT_eX]

[DOI]

Matthias Geihs

Johannes Buchmann

IACR Cryptol. ePrint Arch., 2017

Long-Term Secure Time-Stamping Using Preimage-Aware Hash Functions - (Short Version).

[BibT_eX]

[DOI]

Matthias Geihs

Johannes Buchmann

Proceedings of the Provable Security, 2017

Simple Infeasibility Certificates for Attack Trees.

[BibT_eX]

[DOI]

Proceedings of the Advances in Information and Computer Security, 2017

Are the Current System Engineering Practices Sufficient to Meet Cyber Crime?

[BibT_eX]

[DOI]

Proceedings of the Human Aspects of Information Security, Privacy and Trust, 2017

Server-Supported RSA Signatures for Mobile Devices.

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2017, 2017

Long-Term Secure Commitments via Extractable-Binding Commitments.

[BibT_eX]

[DOI]

Matthias Geihs

Johannes Buchmann

Proceedings of the Information Security and Privacy - 22nd Australasian Conference, 2017

2014

Efficient Record-Level Keyless Signatures for Audit Logs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Security Proofs for the BLT Signature Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Efficient Implementation of Keyless Signatures with Hash Sequence Authentication.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Efficient Quantum-Immune Keyless Signatures with Identity.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Bounded Pre-Image Awareness and the Security of Hash-Tree Keyless Signatures.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Limiting Adversarial Budget in Quantitative Security Assessment.

[BibT_eX]

[DOI]

Aleksandr Lenin

Proceedings of the Decision and Game Theory for Security - 5th International Conference, 2014

2013

Keyless Signatures' Infrastructure: How to Build Global Distributed Hash-Trees.

[BibT_eX]

[DOI]

Andres Kroonmaa

IACR Cryptol. ePrint Arch., 2013

High-Performance Qualified Digital Signatures for X-Road.

[BibT_eX]

[DOI]

Proceedings of the Secure IT Systems - 18th Nordic Conference, 2013

New Efficient Utility Upper Bounds for the Fully Adaptive Model of Attack Trees.

[BibT_eX]

[DOI]

Aleksandr Lenin

Proceedings of the Decision and Game Theory for Security - 4th International Conference, 2013

Protecting a Federated Database Infrastructure against Denial-of-Service Attacks.

[BibT_eX]

[DOI]

Proceedings of the Critical Information Infrastructures Security, 2013

Black-Box Separations and Their Adaptability to the Non-uniform Model.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 18th Australasian Conference, 2013

Security Proofs for Hash Tree Time-Stamping Using Hash Functions with Small Output Size.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 18th Australasian Conference, 2013

2012

Upper Bounds for Adversaries' Utility in Attack Trees.

[BibT_eX]

[DOI]

Roman Stepanenko

Proceedings of the Decision and Game Theory for Security - Third International Conference, 2012

2010

Optimally Tight Security Proofs for Hash-Then-Publish Time-Stamping.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 15th Australasian Conference, 2010

2009

Oracle Separation in the Non-uniform Model.

[BibT_eX]

[DOI]

Proceedings of the Provable Security, Third International Conference, 2009

Efficiency Bounds for Adversary Constructions in Black-Box Reductions.

[BibT_eX]

[DOI]

Aivo Jürgenson

Proceedings of the Information Security and Privacy, 14th Australasian Conference, 2009

2008

Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?.

[BibT_eX]

[DOI]

Proceedings of the Provable Security, Second International Conference, 2008

2007

Knowledge-Binding Commitments with Applications in Time-Stamping (Full Version).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Does Secure Time-Stamping Imply Collision-Free Hash Functions?

[BibT_eX]

[DOI]

Aivo Jürgenson

Proceedings of the Provable Security, 2007

Knowledge-Binding Commitments with Applications in Time-Stamping.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2007

Practical Security Analysis of E-Voting Systems.

[BibT_eX]

[DOI]

Triinu Mägi

Proceedings of the Advances in Information and Computer Security, 2007

2006

Rational Choice of Security Measures Via Multi-parameter Attack Trees.

[BibT_eX]

[DOI]

Proceedings of the Critical Information Infrastructures Security, 2006

Do Broken Hash Functions Affect the Security of Time-Stamping Schemes?

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 4th International Conference, 2006

2005

Universally Composable Time-Stamping Schemes with Audit.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

2004

On Provably Secure Time-Stamping Schemes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2004

2003

Scalable and Efficient PKI for Inter-Organizational Communication.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Computer Security Applications Conference (ACSAC 2003), 2003

2002

Eliminating Counterevidence with Applications to Accountable Certificate Management.

[BibT_eX]

[DOI]

Peeter Laud

Helger Lipmaa

J. Comput. Secur., 2002

Undeniable Replies for Database Queries.

[BibT_eX]

Meelis Roos

Jan Willemson

Proceedings of the Baltic Conference, 2002

2001

Efficient Long-Term Validation of Digital Signatures.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2001

Improving the Availability of Time-Stamping Services.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy, 6th Australasian Conference, 2001

2000

Accountable Certificate Management using Undeniable Attestations.

[BibT_eX]

[DOI]

Peeter Laud

Helger Lipmaa

IACR Cryptol. ePrint Arch., 2000

Optimally Efficient Accountable Time-Stamping.

[BibT_eX]

[DOI]

Helger Lipmaa

Berry Schoenmakers

Proceedings of the Public Key Cryptography, 2000

1998

New linking schemes for digital time-stamping.

[BibT_eX]