default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgnacio Cascudo
Person information
- affiliation: CWI Amsterdam
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c26]Ignacio Cascudo
, Daniele Cozzo, Emanuele Giunta:
Verifiable Secret Sharing from Symmetric Key Cryptography with Improved Optimistic Complexity. ASIACRYPT (7) 2024: 100-128- [c25]Ignacio Cascudo, Bernardo David:
Publicly Verifiable Secret Sharing Over Class Groups and Applications to DKG and YOSO. EUROCRYPT (5) 2024: 216-248 - [c24]Claudia Bartoli, Ignacio Cascudo:
On Sigma-Protocols and (Packed) Black-Box Secret Sharing Schemes. Public Key Cryptography (2) 2024: 426-457 - [i30]Ignacio Cascudo, Daniele Cozzo, Emanuele Giunta:
Verifiable Secret Sharing from Symmetric Key Cryptography with Improved Optimistic Complexity. IACR Cryptol. ePrint Arch. 2024: 838 (2024) - 2023
- [c23]Ignacio Cascudo, Bernardo David, Omer Shlomovits, Denis Varlakov:
Mt. Random: Multi-tiered Randomness Beacons. ACNS 2023: 645-674 - [i29]Ignacio Cascudo, Bernardo David:
Publicly Verifiable Secret Sharing over Class Groups and Applications to DKG and YOSO. IACR Cryptol. ePrint Arch. 2023: 1651 (2023) - [i28]Claudia Bartoli, Ignacio Cascudo:
On Sigma-Protocols and (packed) Black-Box Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2023: 1652 (2023) - 2022
- [c22]Ignacio Cascudo, Bernardo David, Lydia Garms, Anders Konring:
YOLO YOSO: Fast and Simple Encryption and Secret Sharing in the YOSO Model. ASIACRYPT (1) 2022: 651-680 - [c21]Ignacio Cascudo, Emanuele Giunta:
On Interactive Oracle Proofs for Boolean R1CS Statements. Financial Cryptography 2022: 230-247 - [c20]Thomas Attema, Ignacio Cascudo, Ronald Cramer, Ivan Damgård, Daniel Escudero:
Vector Commitments over Rings and Compressed $\varSigma $-Protocols. TCC (1) 2022: 173-202 - [i27]Thomas Attema, Ignacio Cascudo, Ronald Cramer, Ivan Bjerre Damgård, Daniel Escudero:
Vector Commitments over Rings and Compressed Σ-Protocols. IACR Cryptol. ePrint Arch. 2022: 181 (2022) - [i26]Ignacio Cascudo, Bernardo David, Lydia Garms, Anders Konring:
YOLO YOSO: Fast and Simple Encryption and Secret Sharing in the YOSO Model. IACR Cryptol. ePrint Arch. 2022: 242 (2022) - 2021
- [j9]Ignacio Cascudo, Reto Schnyder:
A note on secure multiparty computation via higher residue symbols. J. Math. Cryptol. 15(1): 284-297 (2021) - [c19]Alexandre Bois, Ignacio Cascudo, Dario Fiore, Dongwoo Kim:
Flexible and Efficient Verifiable Computation on Encrypted Data. Public Key Cryptography (2) 2021: 528-558 - [i25]Ignacio Cascudo, Emanuele Giunta:
On Interactive Oracle Proofs for Boolean R1CS Statements. IACR Cryptol. ePrint Arch. 2021: 694 (2021) - [i24]Ignacio Cascudo, Bernardo David, Omer Shlomovits, Denis Varlakov:
Mt. Random: Multi-Tiered Randomness Beacons. IACR Cryptol. ePrint Arch. 2021: 1096 (2021) - 2020
- [j8]Ignacio Cascudo, Jaron Skovsted Gundersen, Diego Ruano:
Squares of matrix-product codes. Finite Fields Their Appl. 62: 101606 (2020) - [c18]Ignacio Cascudo, Bernardo David:
ALBATROSS: Publicly AttestabLe BATched Randomness Based On Secret Sharing. ASIACRYPT (3) 2020: 311-341 - [c17]Ignacio Cascudo, Jaron Skovsted Gundersen:
A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity. TCC (2) 2020: 652-682 - [i23]Ignacio Cascudo, Jaron Skovsted Gundersen:
A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity. IACR Cryptol. ePrint Arch. 2020: 162 (2020) - [i22]Ignacio Cascudo, Reto Schnyder:
A Note on Secure Multiparty Computation via Higher Residue Symbol Techniques. IACR Cryptol. ePrint Arch. 2020: 183 (2020) - [i21]Ignacio Cascudo, Bernardo David:
ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing. IACR Cryptol. ePrint Arch. 2020: 644 (2020) - [i20]Alexandre Bois, Ignacio Cascudo, Dario Fiore, Dongwoo Kim:
Flexible and Efficient Verifiable Computation on Encrypted Data. IACR Cryptol. ePrint Arch. 2020: 1526 (2020)
2010 – 2019
- 2019
- [j7]Ignacio Cascudo:
On Squares of Cyclic Codes. IEEE Trans. Inf. Theory 65(2): 1034-1047 (2019) - [j6]Ignacio Cascudo, Jaron Skovsted Gundersen, Diego Ruano:
Improved Bounds on the Threshold Gap in Ramp Secret Sharing. IEEE Trans. Inf. Theory 65(7): 4620-4633 (2019) - [c16]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Rafael Dowsley, Irene Giacomelli:
Efficient UC Commitment Extension with Homomorphism for Free (and Applications). ASIACRYPT (2) 2019: 606-635 - [c15]Katrine Tjell, Ignacio Cascudo, Rafael Wisniewski:
Privacy Preserving Recursive Least Squares Solutions. ECC 2019: 3490-3495 - [c14]Qiongxiu Li, Ignacio Cascudo, Mads Græsbøll Christensen:
Privacy-Preserving Distributed Average Consensus based on Additive Secret Sharing. EUSIPCO 2019: 1-5 - [i19]Ignacio Cascudo, Jaron Skovsted Gundersen, Diego Ruano:
Squares of Matrix-product Codes. CoRR abs/1903.05494 (2019) - 2018
- [c13]Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan:
Amortized Complexity of Information-Theoretically Secure MPC Revisited. CRYPTO (3) 2018: 395-426 - [c12]Ignacio Cascudo, René Bødker Christensen, Jaron Skovsted Gundersen:
Actively Secure OT-Extension from q-ary Linear Codes. SCN 2018: 333-348 - [i18]Ignacio Cascudo, Jaron Skovsted Gundersen, Diego Ruano:
Improved Bounds on the Threshold Gap in Ramp Secret Sharing. IACR Cryptol. ePrint Arch. 2018: 99 (2018) - [i17]Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan:
Amortized Complexity of Information-Theoretically Secure MPC Revisited. IACR Cryptol. ePrint Arch. 2018: 429 (2018) - [i16]Ignacio Cascudo, René Bødker Christensen, Jaron Skovsted Gundersen:
Actively Secure OT-Extension from q-ary Linear Codes. IACR Cryptol. ePrint Arch. 2018: 603 (2018) - [i15]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Rafael Dowsley, Irene Giacomelli:
Efficient UC Commitment Extension with Homomorphism for Free (and Applications). IACR Cryptol. ePrint Arch. 2018: 983 (2018) - 2017
- [c11]Ignacio Cascudo, Bernardo David:
SCRAPE: Scalable Randomness Attested by Public Entities. ACNS 2017: 537-556 - [c10]Ignacio Cascudo, Ivan Damgård, Oriol Farràs, Samuel Ranellucci:
Resource-Efficient OT Combiners with Active Security. TCC (2) 2017: 461-486 - [i14]Ignacio Cascudo:
On squares of cyclic codes. CoRR abs/1703.01267 (2017) - [i13]Ignacio Cascudo, Bernardo David:
SCRAPE: Scalable Randomness Attested by Public Entities. IACR Cryptol. ePrint Arch. 2017: 216 (2017) - [i12]Ignacio Cascudo, Ivan Damgård, Oriol Farràs, Samuel Ranellucci:
Resource-efficient OT combiners with active security. IACR Cryptol. ePrint Arch. 2017: 545 (2017) - 2016
- [c9]Ignacio Cascudo:
Secret Sharing Schemes with Algebraic Properties and Applications. CiE 2016: 68-77 - [c8]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Jesper Buus Nielsen:
Rate-1, Linear Time and Additively Homomorphic UC Commitments. CRYPTO (3) 2016: 179-207 - [c7]Ignacio Cascudo, Ivan Damgård, Felipe Lacerda, Samuel Ranellucci:
Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement. TCC (B1) 2016: 204-234 - [i11]Ignacio Cascudo, Ivan Damgård, Felipe Lacerda, Samuel Ranellucci:
Oblivious Transfer from Any Non-Trivial Elastic Noisy Channels via Secret Key Agreement. IACR Cryptol. ePrint Arch. 2016: 120 (2016) - [i10]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Jesper Buus Nielsen:
Rate-1, Linear Time and Additively Homomorphic UC Commitments. IACR Cryptol. ePrint Arch. 2016: 137 (2016) - 2015
- [j5]Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Carles Padró, Chaoping Xing:
On Secret Sharing with Nonlinear Product Reconstruction. SIAM J. Discret. Math. 29(2): 1114-1131 (2015) - [j4]Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Gilles Zémor:
Squares of Random Linear Codes. IEEE Trans. Inf. Theory 61(3): 1159-1173 (2015) - [c6]Ignacio Cascudo:
Powers of codes and applications to cryptography. ITW 2015: 1-5 - [c5]Ignacio Cascudo, Ivan Damgård, Bernardo Machado David, Irene Giacomelli, Jesper Buus Nielsen, Roberto Trifiletti:
Additively Homomorphic UC Commitments with Optimal Amortized Overhead. Public Key Cryptography 2015: 495-515 - 2014
- [j3]Ignacio Cascudo, Ronald Cramer, Chaoping Xing:
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications. IEEE Trans. Inf. Theory 60(7): 3871-3888 (2014) - [i9]Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Gilles Zémor:
On powers of codes. CoRR abs/1407.0848 (2014) - [i8]Ignacio Cascudo, Ronald Cramer, Chaoping Xing:
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications. IACR Cryptol. ePrint Arch. 2014: 298 (2014) - [i7]Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Gilles Zémor:
On powers of codes. IACR Cryptol. ePrint Arch. 2014: 520 (2014) - [i6]Ignacio Cascudo, Ivan Damgård, Samuel Ranellucci:
Server-Aided Two-Party Computation with Simultaneous Corruption. IACR Cryptol. ePrint Arch. 2014: 809 (2014) - [i5]Ignacio Cascudo, Ivan Damgård, Bernardo David, Irene Giacomelli, Jesper Buus Nielsen, Roberto Trifiletti:
Additively Homomorphic UC commitments with Optimal Amortized Overhead. IACR Cryptol. ePrint Arch. 2014: 829 (2014) - 2013
- [j2]Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing:
Bounds on the Threshold Gap in Secret Sharing and its Applications. IEEE Trans. Inf. Theory 59(9): 5600-5612 (2013) - [i4]Ignacio Cascudo Pueyo, Ronald Cramer, Diego Mirandola, Carles Padró, Chaoping Xing:
On secret sharing with nonlinear product reconstruction. IACR Cryptol. ePrint Arch. 2013: 503 (2013) - 2012
- [j1]Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing, An Yang:
Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields. IEEE Trans. Inf. Theory 58(7): 4930-4935 (2012) - [c4]Ignacio Cascudo, Ronald Cramer, Chaoping Xing:
The arithmetic codex. ITW 2012: 75-79 - [i3]Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing:
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications. CoRR abs/1207.2936 (2012) - [i2]Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing:
Bounds on the Threshold Gap in Secret Sharing over Small Fields. IACR Cryptol. ePrint Arch. 2012: 319 (2012) - [i1]Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing:
The Arithmetic Codex. IACR Cryptol. ePrint Arch. 2012: 388 (2012) - 2011
- [c3]Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing:
The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing. CRYPTO 2011: 685-705
2000 – 2009
- 2009
- [c2]Ignacio Cascudo Pueyo, Hao Chen, Ronald Cramer, Chaoping Xing:
Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field. CRYPTO 2009: 466-486 - 2008
- [c1]Hao Chen, Ronald Cramer, Robbert de Haan, Ignacio Cascudo Pueyo:
Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves. EUROCRYPT 2008: 451-470
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 2025-01-09 19:31 CET 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:
