default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Geihs
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2018
[b1]Matthias Geihs:
Long-Term Protection of Integrity and Confidentiality - Security Foundations and System Constructions. Darmstadt University of Technology, Germany, 2018
Journal Articles
- 2021
- [j5]Matthias Geihs
, Oleg Nikiforov, Denise Demirel, Alexander Sauer, Denis Butin, Felix Günther, Gernot Alber, Thomas Walther, Johannes Buchmann:
The Status of Quantum-Key-Distribution-Based Long-Term Secure Internet Communication. IEEE Trans. Sustain. Comput. 6(1): 19-29 (2021) - 2020
- [j4]Philipp Muth, Matthias Geihs, Tolga Arul, Johannes Buchmann, Stefan Katzenbeisser:
ELSA: efficient long-term secure storage of large datasets (full version) ∗. EURASIP J. Inf. Secur. 2020: 9 (2020) - 2019
- [j3]Johannes Buchmann, Matthias Geihs, Kay Hamacher, Stefan Katzenbeisser, Sebastian Stammler:
Long-term integrity protection of genomic data. EURASIP J. Inf. Secur. 2019: 15 (2019) - 2018
- [j2]Rachid El Bansarkhani, Matthias Geihs, Johannes Buchmann:
PQChain: Strategic Design Decisions for Distributed Ledger Technologies against Future Threats. IEEE Secur. Priv. 16(4): 57-65 (2018) - 2015
- [j1]Matthias Geihs, Ying Yan, Klaudia Walter, Jie Huang, Yasin Memari, Josine L. Min, Daniel Mead, Tim J. P. Hubbard, Nicholas J. Timpson, Thomas A. Down, Nicole Soranzo:
An interactive genome browser of association results from the UK10K cohorts project. Bioinform. 31(24): 4029-4031 (2015)
Conference and Workshop Papers
- 2024
- [c11]Matthias Geihs, Hart Montgomery:
LaKey: Efficient Lattice-Based Distributed PRFs Enable Scalable Distributed Key Management. USENIX Security Symposium 2024 - 2019
- [c10]Matthias Geihs, Lucas Schabhüser, Johannes Buchmann:
Efficient Proactive Secret Sharing for Large Data via Concise Vector Commitments. C2SI 2019: 171-194 - 2018
- [c9]Matthias Geihs, Nikolaos P. Karvelas, Stefan Katzenbeisser, Johannes Buchmann:
PROPYLA: Privacy Preserving Long-Term Secure Storage. SCC@AsiaCCS 2018: 39-48 - [c8]Matthias Geihs, Johannes Buchmann:
\mathsf ELSA : Efficient Long-Term Secure Storage of Large Datasets. ICISC 2018: 269-286 - 2017
- [c7]Ahto Buldas, Matthias Geihs, Johannes Buchmann:
Long-Term Secure Commitments via Extractable-Binding Commitments. ACISP (1) 2017: 65-81 - [c6]Christian Weinert, Denise Demirel, Martín A. Gagliotti Vigil, Matthias Geihs, Johannes Buchmann:
MoPS: A Modular Protection Scheme for Long-Term Storage. AsiaCCS 2017: 436-448 - [c5]Johannes Braun, Johannes Buchmann, Denise Demirel, Matthias Geihs, Mikio Fujiwara, Shiho Moriai, Masahide Sasaki, Atsushi Waseda:
LINCOS: A Storage System Providing Long-Term Integrity, Authenticity, and Confidentiality. AsiaCCS 2017: 461-468 - [c4]Ahto Buldas, Matthias Geihs, Johannes Buchmann:
Long-Term Secure Time-Stamping Using Preimage-Aware Hash Functions - (Short Version). ProvSec 2017: 251-260 - 2016
- [c3]Matthias Geihs, Denise Demirel, Johannes Buchmann:
A security analysis of techniques for long-term integrity protection. PST 2016: 449-456 - 2015
- [c2]Matthias Geihs, Denise Demirel, Johannes Buchmann:
On the Security of Long-Lived Archiving Systems Based on the Evidence Record Syntax. C2SI 2015: 27-44 - 2014
- [c1]Matthias Geihs, Daniel Cabarcas:
Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms. LATINCRYPT 2014: 48-63
Informal and Other Publications
- 2024
- [i8]Matthias Geihs:
Great-LaKeys: An Improved Threshold-PRF and a Novel Exponent-VRF from LWR. IACR Cryptol. ePrint Arch. 2024: 996 (2024) - 2023
- [i7]Matthias Geihs, Hart Montgomery:
A Low-Round Distributed PRF from Lattices and its Application to Distributed Key Management. IACR Cryptol. ePrint Arch. 2023: 1254 (2023) - 2018
- [i6]Matthias Geihs, Johannes Buchmann:
ELSA: Efficient Long-Term Secure Storage of Large Datasets. CoRR abs/1810.11888 (2018) - 2017
- [i5]Christian Weinert, Denise Demirel, Martín A. Gagliotti Vigil, Matthias Geihs, Johannes Buchmann:
MoPS: A Modular Protection Scheme for Long-Term Storage. CoRR abs/1708.02091 (2017) - [i4]Matthias Geihs, Oleg Nikiforov, Denise Demirel, Alexander Sauer, Denis Butin, Felix Günther, Gernot Alber, Thomas Walther, Johannes Buchmann:
The Status of Quantum-Based Long-Term Secure Communication over the Internet. CoRR abs/1711.09793 (2017) - [i3]Matthias Geihs, Nikolaos P. Karvelas, Stefan Katzenbeisser, Johannes Buchmann:
PRoPyLA: Privacy Preserving Long-Term Secure Storage. CoRR abs/1711.09805 (2017) - [i2]Ahto Buldas, Matthias Geihs, Johannes Buchmann:
Long-Term Secure Time-Stamping using Preimage-Aware Hash Functions. IACR Cryptol. ePrint Arch. 2017: 754 (2017) - 2016
- [i1]Johannes Braun, Johannes Buchmann, Denise Demirel, Mikio Fujiwara, Matthias Geihs, Shiho Moriai, Masahide Sasaki, Atsushi Waseda:
LINCOS - A Storage System Providing Long-Term Integrity, Authenticity, and Confidentiality (Full Paper). IACR Cryptol. ePrint Arch. 2016: 742 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-23 21:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
