#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2008

2018

- This year (3)
- Last 5 years (21)
- Last 10 years (28)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Hao Chen, Ronald Cramer, Robbert de Haan, Ignacio Cascudo
- EUROCRYPT
- 2008

In this work we introduce a novel paradigm for the construction of ramp schemes with strong multiplication that allows the secret to be chosen in an extension field, whereas the shares lie in a base… (More)

- Ignacio Cascudo, Ronald Cramer, Chaoping Xing
- IEEE Transactions on Information Theory
- 2014

The Ihara limit (or constant) A(q) has been a central problem of study in the asymptotic theory of global function fields (or equivalently, algebraic curves over finite fields). It addresses global… (More)

- Ignacio Cascudo, Ronald Cramer, Chaoping Xing
- IEEE Transactions on Information Theory
- 2013

We consider the class of secret sharing schemes where there is no a priori bound on the number of players n but where each of the n share-spaces has fixed cardinality q. We show two fundamental lower… (More)

- Ignacio Cascudo, Bernardo Machado David
- IACR Cryptology ePrint Archive
- 2017

Uniform randomness beacons whose output can be publicly attested to be unbiased are required in several cryptographic protocols. A common approach to building such beacons is having a number parties… (More)

- Ignacio Cascudo, Ronald Cramer, Chaoping Xing, An Yang
- IEEE Transactions on Information Theory
- 2012

In 1986, D. V. Chudnovsky and G. V. Chudnovsky first employed algebraic curves over finite fields to construct bilinear multiplication algorithms implicitly through supercodes introduced by… (More)

- Ignacio Cascudo, Hao Chen, Ronald Cramer, Chaoping Xing
- CRYPTO
- 2009

This work deals with “MPC-friendly” linear secret sharing schemes (LSSS), a mathematical primitive upon which secure multi-party computation (MPC) can be based and which was introduced by Cramer,… (More)

- Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Gilles Zémor
- IEEE Transactions on Information Theory
- 2015

Given a linear code C, one can define the dth power of C as the span of all componentwise products of d elements of C. A power of C may quickly fill the whole space. Our purpose is to answer the… (More)

- Ignacio Cascudo, Ronald Cramer, Chaoping Xing
- IACR Cryptology ePrint Archive
- 2012

We consider the class of secret sharing schemes where there is no a priori bound on the number of players n but where each of the n share-spaces has xed cardinality q. We show two fundamental lower… (More)

- Ignacio Cascudo, Ronald Cramer, Chaoping Xing
- CRYPTO
- 2011

An (n, t, d, n−t)-arithmetic secret sharing scheme (with uniformity) for Fq over Fq is an Fq-linear secret sharing scheme where the secret is selected from Fq and each of the n shares is an element… (More)

- Ignacio Cascudo, Jaron Skovsted Gundersen, Diego Ruano
- IACR Cryptology ePrint Archive
- 2018

In this paper we consider linear secret sharing schemes over a finite field Fq, where the secret is a vector in Fq and each of the n shares is a single element of Fq. We obtain lower bounds on the… (More)