Ignacio Cascudo

Daniele Cozzo

Emanuele Giunta

IACR Cryptol. ePrint Arch., 2024

2023

Publicly Verifiable Secret Sharing over Class Groups and Applications to DKG and YOSO.

[BibT_eX]

[DOI]

Bernardo David

IACR Cryptol. ePrint Arch., 2023

On Sigma-Protocols and (packed) Black-Box Secret Sharing Schemes.

[BibT_eX]

[DOI]

Claudia Bartoli

IACR Cryptol. ePrint Arch., 2023

2022

YOLO YOSO: Fast and Simple Encryption and Secret Sharing in the YOSO Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Vector Commitments over Rings and Compressed Σ-Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Vector Commitments over Rings and Compressed $\varSigma $-Protocols.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 20th International Conference, 2022

2021

A note on secure multiparty computation via higher residue symbols.

[BibT_eX]

[DOI]

Reto Schnyder

J. Math. Cryptol., 2021

On Interactive Oracle Proofs for Boolean R1CS Statements.

[BibT_eX]

[DOI]

Emanuele Giunta

IACR Cryptol. ePrint Arch., 2021

Mt. Random: Multi-Tiered Randomness Beacons.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

2020

A Note on Secure Multiparty Computation via Higher Residue Symbol Techniques.

[BibT_eX]

[DOI]

Reto Schnyder

IACR Cryptol. ePrint Arch., 2020

A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing.

[BibT_eX]

[DOI]

Bernardo David

IACR Cryptol. ePrint Arch., 2020

Flexible and Efficient Verifiable Computation on Encrypted Data.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Squares of matrix-product codes.

[BibT_eX]

[DOI]

Diego Ruano

Finite Fields Their Appl., 2020

2019

Improved Bounds on the Threshold Gap in Ramp Secret Sharing.

[BibT_eX]

[DOI]

Diego Ruano

IEEE Trans. Inf. Theory, 2019

On Squares of Cyclic Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Privacy-Preserving Distributed Average Consensus based on Additive Secret Sharing.

[BibT_eX]

[DOI]

Qiongxiu Li

Mads Græsbøll Christensen

Proceedings of the 27th European Signal Processing Conference, 2019

Privacy Preserving Recursive Least Squares Solutions.

[BibT_eX]

[DOI]

Katrine Tjell

Rafael Wisniewski

Proceedings of the 17th European Control Conference, 2019

2018

Efficient UC Commitment Extension with Homomorphism for Free (and Applications).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Amortized Complexity of Information-Theoretically Secure MPC Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Actively Secure OT-Extension from q-ary Linear Codes.

[BibT_eX]

[DOI]

René Bødker Christensen

IACR Cryptol. ePrint Arch., 2018

2017

Resource-efficient OT combiners with active security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

SCRAPE: Scalable Randomness Attested by Public Entities.

[BibT_eX]

[DOI]

Bernardo David

IACR Cryptol. ePrint Arch., 2017

2016

Oblivious Transfer from Any Non-Trivial Elastic Noisy Channels via Secret Key Agreement.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Rate-1, Linear Time and Additively Homomorphic UC Commitments.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Secret Sharing Schemes with Algebraic Properties and Applications.

[BibT_eX]

[DOI]

Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015

Squares of Random Linear Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

On Secret Sharing with Nonlinear Product Reconstruction.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Powers of codes and applications to cryptography.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

2014

Torsion Limits and Riemann-Roch Systems for Function Fields and Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Server-Aided Two-Party Computation with Simultaneous Corruption.

[BibT_eX]

[DOI]

Ivan Damgård

Samuel Ranellucci

IACR Cryptol. ePrint Arch., 2014

Additively Homomorphic UC commitments with Optimal Amortized Overhead.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

On powers of codes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

2013

Bounds on the Threshold Gap in Secret Sharing and its Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

2012

Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields.

[BibT_eX]

[DOI]

An Yang

IEEE Trans. Inf. Theory, 2012

The Arithmetic Codex.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Bounds on the Threshold Gap in Secret Sharing over Small Fields.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

2011

The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2009

Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over <i>Any</i> Fixed Finite Field.

[BibT_eX]

[DOI]

Hao Chen

Proceedings of the Advances in Cryptology, 2009

2008

Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves.

[BibT_eX]

[DOI]

Hao Chen

Robbert de Haan