Carsten Baum

James Hsin-yu Chiang

IACR Cryptol. ePrint Arch., 2023

Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures From VOLE-in-the-Head.

[BibT_eX]

[DOI]

Cyprien Delpech de Saint Guilhem

IACR Cryptol. ePrint Arch., 2023

CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2023, 2023

2022

Efficient protocols for oblivious linear function evaluation from ring-LWE.

[BibT_eX]

[DOI]

Daniel Escudero

Alberto Pedrouzo-Ulloa

Juan Ramón Troncoso-Pastoriza

J. Comput. Secur., 2022

Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Eagle: Efficient Privacy Preserving Smart Contracts.

[BibT_eX]

[DOI]

James Hsin-yu Chiang

IACR Cryptol. ePrint Arch., 2022

Mozℤ2karella: Efficient Vector-OLE and Zero-Knowledge Proofs Over ℤ2k.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

(Public) Verifiability for Composable Protocols Without Adaptivity or Zero-Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Provable and Practical Security, 2022

Moz$\mathbb {Z}_{2^k}$arella: Efficient Vector-OLE and Zero-Knowledge Proofs over $\mathbb {Z}_{2^k}$.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

Banquet: Short and Fast Signatures from AES.

[BibT_eX]

[DOI]

Cyprien Delpech de Saint Guilhem

IACR Cryptol. ePrint Arch., 2021

P2DEX: Privacy-Preserving Decentralized Cryptocurrency Exchange.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

SoK: Mitigation of Front-running in Decentralized Finance.

[BibT_eX]

[DOI]

James Hsin-yu Chiang

Lorenzo Gentile

IACR Cryptol. ePrint Arch., 2021

Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and ℤ2k.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Lattice-Based Proof of Shuffle and Applications to Electronic Voting.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

TARDIS: A Foundation of Time-Lock Puzzles in UC.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k.

[BibT_eX]

[DOI]

Benoît Razet

Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

Fairness in the Eyes of the Data: Certifying Machine-Learning Models.

[BibT_eX]

[DOI]

Proceedings of the AIES '21: AAAI/ACM Conference on AI, 2021

2020

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability.

[BibT_eX]

[DOI]

Emmanuela Orsini

Eduardo Soria-Vazquez

IACR Cryptol. ePrint Arch., 2020

Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

CRAFT: Composable Randomness and Almost Fairness from Time.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

TARDIS: Time And Relative Delays In Simulation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

A Framework for Universally Composable Publicly Verifiable Cryptographic Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Insured MPC: Efficient Secure Computation with Financial Penalties.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2020

2019

Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography.

[BibT_eX]

[DOI]

Ariel Nof

IACR Cryptol. ePrint Arch., 2019

PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server.

[BibT_eX]

[DOI]

Julia Hesse

Anja Lehmann

Avishay Yanai

IACR Cryptol. ePrint Arch., 2019

Using TopGear in Overdrive: A more efficient ZKPoK for SPDZ.

[BibT_eX]

[DOI]

Daniele Cozzo

Nigel P. Smart

IACR Cryptol. ePrint Arch., 2019

2018

Towards Practical Lattice-Based One-Time Linkable Ring Signatures.

[BibT_eX]

[DOI]

Huang Lin

Sabine Oechsner

IACR Cryptol. ePrint Arch., 2018

Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooring.

[BibT_eX]

[DOI]

Proceedings of the 27th USENIX Security Symposium, 2018

More Efficient Commitments from Structured Lattice Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

2017

Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings.

[BibT_eX]

[DOI]

Vadim Lyubashevsky

IACR Cryptol. ePrint Arch., 2017

2016

Efficient Secure Multiparty Computation with Identifiable Abort.

[BibT_eX]

[DOI]

Emmanuela Orsini

IACR Cryptol. ePrint Arch., 2016

Better Preprocessing for Secure Multiparty Computation.

[BibT_eX]

[DOI]

Ivan Damgård

Tomas Toft

Rasmus Winther Zakarias

IACR Cryptol. ePrint Arch., 2016

Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

How to prove knowledge of small secrets.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

On Garbling Schemes With And Without Privacy.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

2014

Publicly Auditable Secure Multi-Party Computation.

[BibT_eX]

[DOI]