An unconditionally hiding auditing procedure for computations over distributed data. - Lucas Schabhüser; Denise Demirel; Johannes Buchmann 001 (CNS, 2016)

An Unconditionally Hiding Auditing Procedure for Multi-Party Computations. - Lucas Schabhüser; Denise Demirel; Johannes Buchmann 001 (IACR Cryptol. ePrint Arch., 2016)

Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability. - Johannes Buchmann 001; Denise Demirel; Lucas Schabhüser; Patrick Struck (IACR Cryptol. ePrint Arch., 2017)

Privately and Publicly Verifiable Computing Techniques - A Survey - Denise Demirel; Lucas Schabhüser; Johannes Buchmann 001 (Springer, 2017)

A Linearly Homomorphic Signature Scheme From Weaker Assumptions. - Lucas Schabhüser; Johannes Buchmann 001; Patrick Struck (IACR Cryptol. ePrint Arch., 2018)

CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case. - Lucas Schabhüser; Denis Butin; Johannes Buchmann 001 (IACR Cryptol. ePrint Arch., 2018)

Context Hiding Multi-Key Linearly Homomorphic Authenticators. - Lucas Schabhüser; Denis Butin; Johannes Buchmann 001 (IACR Cryptol. ePrint Arch., 2018)

Function-Dependent Commitments for Verifiable Multi-Party Computation. - Lucas Schabhüser; Denis Butin; Denise Demirel; Johannes Buchmann 001 (IACR Cryptol. ePrint Arch., 2018)

Efficient Proactive Secret Sharing for Large Data via Concise Vector Commitments. - Matthias Geihs; Lucas Schabhüser; Johannes Buchmann 001 (C2SI, 2019)

Function-Dependent Commitments from Homomorphic Authenticators. - Lucas Schabhüser; Denis Butin; Johannes Buchmann 001 (IACR Cryptol. ePrint Arch., 2019)

Information-Theoretic Privacy in Verifiable Outsourced Computation. - Lucas Schabhüser (2019)