Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Cascudo, Ignacio"'
Publikováno v:
Finite Fields and Their Applications 62 (2020) 101606
The component-wise or Schur product $C*C'$ of two linear error correcting codes $C$ and $C'$ over certain finite field is the linear code spanned by all component-wise products of a codeword in $C$ with a codeword in $C'$. When $C=C'$, we call the pr
Externí odkaz:
http://arxiv.org/abs/1903.05494
Autor:
Cascudo, Ignacio
The square $C^{*2}$ of a linear error correcting code $C$ is the linear code spanned by the component-wise products of every pair of (non-necessarily distinct) words in $C$. Squares of codes have gained attention for several applications mainly in th
Externí odkaz:
http://arxiv.org/abs/1703.01267
Autor:
Cascudo Ignacio, Schnyder Reto
Publikováno v:
Journal of Mathematical Cryptology, Vol 15, Iss 1, Pp 284-297 (2021)
We generalize a protocol by Yu for comparing two integers with relatively small difference in a secure multiparty computation setting. Yu's protocol is based on the Legendre symbol. A prime number p is found for which the Legendre symbol (· | p) agr
Externí odkaz:
https://doaj.org/article/4fdb1c80e7154acea554054f495ec3e6
Publikováno v:
IEEE Transactions on Information Theory, vol. 61, no. 3, pp. 1159-1173, March 2015
Given a linear code $C$, one can define the $d$-th 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 following question: does the square of a c
Externí odkaz:
http://arxiv.org/abs/1407.0848
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 function fields with many rational points and, so
Externí odkaz:
http://arxiv.org/abs/1207.2936
Publikováno v:
Attema, T, Cascudo, I, Cramer, R, Damgård, I & Escudero, D 2022, Vector Commitments over Rings and Compressed Σ-Protocols . in E Kiltz & V Vaikuntanathan (eds), Theory of Cryptography-20th International Conference, TCC 2022, Proceedings . vol. Part 1, Springer, Lecture Notes in Computer Science, vol. 13747, pp. 173-202, 20th Theory of Cryptography Conference, TCC 2022, Chicago, United States, 07/11/2022 . https://doi.org/10.1007/978-3-031-22318-1_7
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::69da04b2e7aaea0adaa15e83894b0cd8
https://pure.au.dk/portal/da/publications/vector-commitments-over-rings-and-compressed--protocols(754b38f9-b98a-457d-ad2f-a6ae391b7549).html
https://pure.au.dk/portal/da/publications/vector-commitments-over-rings-and-compressed--protocols(754b38f9-b98a-457d-ad2f-a6ae391b7549).html
Publikováno v:
Cascudo, I & Gundersen, J S 2020, A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity . in Theory of Cryptography Conference-18th International Conference, TCC 2020 . vol. 12551, Springer, Lecture Notes in Computer Science, vol. 12551, pp. 652-682, Theory of Cryptography Conference 2020, 16/11/2020 . https://doi.org/10.1007/978-3-030-64378-2_23
We present a new secure multiparty computation protocol in the preprocessing model that allows for the evaluation of a number of instances of a boolean circuit in parallel, with a small online communication complexity per instance of 10 bits per part
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::615021013f44dd3be931809809a9c9f2
https://vbn.aau.dk/da/publications/368daf5f-08be-4181-8511-b4ac9936b272
https://vbn.aau.dk/da/publications/368daf5f-08be-4181-8511-b4ac9936b272
Autor:
Cascudo, Ignacio, David, Bernardo
Publikováno v:
Cascudo, I & David, B 2020, ALBATROSS: Publicly AttestabLe BATched Randomness Based On Secret Sharing . in S Moriai & H Wang (eds), ASIACRYPT 2020: Advances in Cryptology – ASIACRYPT 2020 . Springer, Lecture Notes in Computer Science, vol. 12493, pp. 311-341 . https://doi.org/10.1007/978-3-030-64840-4_11
In this paper we present ALBATROSS, a family of multiparty randomness generation protocols with guaranteed output delivery and public verification that allows to trade off corruption tolerance for a much improved amortized computational complexity. O
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2988::7aa072b8da6aa90f31a0d770f5eadd85
https://pure.itu.dk/portal/da/publications/980a6752-0f62-47cd-a2a5-36f2a9e93065
https://pure.itu.dk/portal/da/publications/980a6752-0f62-47cd-a2a5-36f2a9e93065
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Cascudo, Ignacio, Damgård, Ivan, David, Bernardo, Döttling, Nico, Dowsley, Rafael, Giacomelli, Irene
Publikováno v:
Cascudo, I, Damgård, I, David, B, Dowsley, R, Döttling, N & Giacomelli, I 2019, Efficient UC Commitment Extension with Homomorphism for Free (and Applications) . in S Galbraith & S Moriai (eds), Advances in Cryptology – ASIACRYPT 2019 : 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part II . Springer, Lecture Notes in Computer Science, vol. 11922, pp. 606-635 . < https://eprint.iacr.org/2018/983.pdf >
Cascudo, I, Damgård, I, David, B, Döttling, N, Dowsley, R & Giacomelli, I 2019, Efficient UC Commitment Extension with Homomorphism for Free (and Applications) . in S D Galbraith & S Moriai (eds), Advances in Cryptology – ASIACRYPT 2019-25th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings . Springer, Lecture Notes in Computer Science, vol. 11922, pp. 606-635, 25th Annual International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 2019, Kobe, Japan, 08/12/2019 . https://doi.org/10.1007/978-3-030-34621-8_22
Cascudo, I, Damgård, I, David, B, Döttling, N, Dowsley, R & Giacomelli, I 2019, Efficient UC Commitment Extension with Homomorphism for Free (and Applications) . in S D Galbraith & S Moriai (eds), Advances in Cryptology – ASIACRYPT 2019-25th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings . Springer, Lecture Notes in Computer Science, vol. 11922, pp. 606-635, 25th Annual International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 2019, Kobe, Japan, 08/12/2019 . https://doi.org/10.1007/978-3-030-34621-8_22
Homomorphic universally composable (UC) commitments allow for the sender to reveal the result of additions and multiplications of values contained in commitments without revealing the values themselves while assuring the receiver of the correctness o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d175aac4d00cd8da4c8e6e34370a4992
https://pure.itu.dk/portal/da/publications/8859ac92-add0-4819-9390-9ccf6fe26878
https://pure.itu.dk/portal/da/publications/8859ac92-add0-4819-9390-9ccf6fe26878