default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLucas Schabhüser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[b2]Lucas Schabhüser:
Information-Theoretic Privacy in Verifiable Outsourced Computation. Darmstadt University of Technology, Germany, 2019- [c8]Lucas Schabhüser, Denis Butin, Johannes Buchmann:
Function-Dependent Commitments from Homomorphic Authenticators. ACISP 2019: 399-418 - [c7]Matthias Geihs, Lucas Schabhüser, Johannes Buchmann:
Efficient Proactive Secret Sharing for Large Data via Concise Vector Commitments. C2SI 2019: 171-194 - [c6]Lucas Schabhüser, Denis Butin, Johannes Buchmann:
Context Hiding Multi-key Linearly Homomorphic Authenticators. CT-RSA 2019: 493-513 - [i7]Lucas Schabhüser, Denis Butin, Johannes Buchmann:
Function-Dependent Commitments from Homomorphic Authenticators. IACR Cryptol. ePrint Arch. 2019: 250 (2019) - 2018
- [c5]Lucas Schabhüser, Denis Butin
, Johannes Buchmann:
CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case. ISPEC 2018: 213-228 - [c4]Lucas Schabhüser, Denis Butin, Denise Demirel, Johannes Buchmann:
Function-Dependent Commitments for Verifiable Multi-party Computation. ISC 2018: 289-307 - [i6]Lucas Schabhüser, Johannes Buchmann, Patrick Struck:
A Linearly Homomorphic Signature Scheme From Weaker Assumptions. IACR Cryptol. ePrint Arch. 2018: 35 (2018) - [i5]Lucas Schabhüser, Denis Butin, Johannes Buchmann:
CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case. IACR Cryptol. ePrint Arch. 2018: 599 (2018) - [i4]Lucas Schabhüser, Denis Butin, Johannes Buchmann:
Context Hiding Multi-Key Linearly Homomorphic Authenticators. IACR Cryptol. ePrint Arch. 2018: 629 (2018) - [i3]Lucas Schabhüser, Denis Butin, Denise Demirel, Johannes Buchmann:
Function-Dependent Commitments for Verifiable Multi-Party Computation. IACR Cryptol. ePrint Arch. 2018: 639 (2018) - 2017
- [b1]Denise Demirel, Lucas Schabhüser, Johannes Buchmann:
Privately and Publicly Verifiable Computing Techniques - A Survey. Springer Briefs in Computer Science, Springer 2017, ISBN 978-3-319-53797-9, pp. 1-58 - [c3]Patrick Struck, Lucas Schabhüser, Denise Demirel, Johannes Buchmann:
Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability. C2SI 2017: 142-160 - [c2]Lucas Schabhüser, Johannes Buchmann, Patrick Struck:
A Linearly Homomorphic Signature Scheme from Weaker Assumptions. IMACC 2017: 261-279 - [i2]Johannes Buchmann, Denise Demirel, Lucas Schabhüser, Patrick Struck:
Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability. IACR Cryptol. ePrint Arch. 2017: 700 (2017) - 2016
- [c1]Lucas Schabhüser, Denise Demirel, Johannes Buchmann:
An unconditionally hiding auditing procedure for computations over distributed data. CNS 2016: 552-560 - [i1]Lucas Schabhüser, Denise Demirel, Johannes Buchmann:
An Unconditionally Hiding Auditing Procedure for Multi-Party Computations. IACR Cryptol. ePrint Arch. 2016: 546 (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-08-05 21:18 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:
