Algebraic Methods for Stronger Crypto

Lattice Cryptography,from Cryptanalysis to New Foundations

Autori: Wessel van Woerden
Pubblicato in: 2023, Pagina/e 1-364
Editore: CWI & Universiteit Leiden

Random walks on Arakelov class groups

Autori: Koen de Boer
Pubblicato in: 2022, ISBN 9789464218565
Editore: Mathematical Institute (MI), Faculty of Science, Leiden University

Secure integer division with a private divisor

Autori: Thijs Veugen, Mark Abspoel
Pubblicato in: PETS 2021, 2021, Pagina/e (4): 339-349
Editore: De Gruyter Open
DOI: 10.2478/popets-2021-0073

Improved single-round secure multiplication using regenerating codes

Autori: Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damgård, and Chaoping Xing
Pubblicato in: ASIACRYPT 2021, 2021, Pagina/e 222-244, ISBN 978-3-030-92074-6
Editore: Springer Verlag
DOI: 10.1007/978-3-030-92075-3_8

Compressed Σ-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures

Autori: Thomas Attema, Ronald Cramer, Matthieu Rambaud
Pubblicato in: ASIACRYPT 2021, 2021, Pagina/e 526–556, ISBN 978-3-030-92067-8
Editore: Springer Verlag
DOI: 10.1007/978-3-030-92068-5_18

Secure training of decision trees with continuous attributes.

Autori: Mark Abspoel, Daniel Escudero, Nikolaj Volgushev
Pubblicato in: PETS 2021, 2021, Pagina/e (1): 167-187 (2021)
Editore: DE Gruyter Open
DOI: 10.2478/popets-2021-0010

Compressing Proofs of k-Out-Of-nPartial Knowledge

Autori: Thomas Attema, Ronald Cramer, and Serge Fehr
Pubblicato in: CRYPTO 2021, 2021, Pagina/e 65–91, ISBN 978-3-030-84258-1
Editore: Springer Verlag
DOI: 10.1007/978-3-030-84259-8_3

Attacks on the AJPS Mersenne-based cryptosystem

Autori: Koen de Boer, Léo Ducas, Stacey Jeffery, Ronald de Wolf
Pubblicato in: PQCRYPTO 2018, Numero 8th Annual, 2018, Pagina/e 101-120
Editore: Springer Nature

Construction of optimal locally recoverable codes and connection with hypergraph

Autori: Chaoping Xing, Chen Yuan
Pubblicato in: ICALP 2019, Numero 46th Annual, 2019
Editore: EATCS

New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment

Autori: Gabriele Spini; Emiliano Mancini; Thomas Attema; Mark Abspoel; Jan de Gier; Serge Fehr; Thijs Veugen; Maran van Heesch; Daniël Worm; Andrea De Luca; Ronald Cramer; Peter M.A. Sloot
Pubblicato in: VOLUME=46;ISSUE=12;STARTPAGE=84.1;ENDPAGE=84.11;TITLE=Journal of Medical Systems, Numero 3, 2022, ISSN 1573-689X
Editore: Springer
DOI: 10.1007/s10916-022-01851-x

On the Security of Subspace Subcodes of Reed-Solomon Codes for Public Key Encryption

Autori: Alain Couvreur, Matthieu Lequesne
Pubblicato in: . IEEE Trans. Inf. Theory, Numero 00189448, 2022, Pagina/e 68(1): 632-648 (2022), ISSN 0018-9448
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2021.3120440

Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time

Autori: Ronald Cramer; Léo Ducas; Benjamin Wesolowski
Pubblicato in: Journal of the ACM, 68(2), Numero 00045411, 2021, Pagina/e 1-26, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3431725

Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic

Autori: Thorsten Kleinjung, Benjamin Wesolowski
Pubblicato in: J. Amer. Math. Soc., 2022, Pagina/e 35: 581-624, ISSN 0894-0347
Editore: American Mathematical Society

Subspace Designs based on Algebraic Function Fields

Autori: Venkatesan Guruswami, Chaoping Xing, Chen Yuan
Pubblicato in: Transactions of the American Mathematical Society, Numero 370 (2018), 2018, Pagina/e 8757-8775, ISSN 0002-9947
Editore: American Mathematical Society

How Long Can Optimal Locally Repairable Codes Be?

Autori: Venkatesan Guruswami, Chaoping Xing, Chen Yuan
Pubblicato in: IEEE Transactions on Information Theory, Numero 65/6, 2019, Pagina/e 3662-3670, ISSN 0018-9448
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2019.2891765

List Decodability of Symbol-Pair Codes

Autori: Shu Liu, Chaoping Xing, Chen Yuan
Pubblicato in: IEEE Transactions on Information Theory, Numero 14 March 2019, 2019, Pagina/e 1-1, ISSN 0018-9448
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2019.2904998

Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes

Autori: Yuan Luo, Chaoping Xing, Chen Yuan
Pubblicato in: IEEE Transactions on Information Theory, Numero 65/2, 2019, Pagina/e 1048-1053, ISSN 0018-9448
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2018.2854717

Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex

Autori: Ronald Cramer, Chaoping Xing, Chen Yuan
Pubblicato in: IEEE Transactions on Information Theory, Numero 66/1, 2020, Pagina/e 263-272, ISSN 0018-9448
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2019.2939135

Asymptotic Gilbert–Varshamov Bound on Frequency Hopping Sequences

Autori: Xianhua Niu, Chaoping Xing, Chen Yuan
Pubblicato in: IEEE Transactions on Information Theory, Numero 66/2, 2020, Pagina/e 1213-1218, ISSN 0018-9448
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2019.2951383

Bounds for List-Decoding and List-Recovery of Random Linear Codes 68(2): 923-939 (2022)

Autori: Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
Pubblicato in: IEEE Trans. Inf. Theory, Numero 00189448, 2022, Pagina/e 68(2): 923-939, ISSN 0018-9448
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2021.3127126

Threshold Rates for Properties of Random Codes.

Autori: Venkatesan Guruswami, Jonathan Moshieff, Nicolas Resch, Shashwat Silas, Mary Wootters
Pubblicato in: IEEE Trans. Inf. Theory, Numero 00189448, 2022, Pagina/e 68(2): 905-922, ISSN 0018-9448
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2021.3123497

An upper bound on the number of perfect quadratic forms

Autori: W.P.J. van Woerden
Pubblicato in: Advances in Mathematics, Numero 365, 2020, Pagina/e 107031, ISSN 0001-8708
Editore: Academic Press
DOI: 10.1016/j.aim.2020.107031

Efficient Protocols for Perfectly Secure Message Transmission With Applications to Secure Network Coding

Autori: Gabriele Spini, Gilles Zemor
Pubblicato in: IEEE Transactions on Information Theory, Numero 66/10, 2020, Pagina/e 6340-6353, ISSN 0018-9448
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2020.2994285

An Algorithmic Reduction Theory for Binary Codes: LLL and More

Autori: Thomas Debris-Alazard, Léo Ducas, Wessel van Woerden
Pubblicato in: IEEE Trans. Inf. Theory, Numero 00189448, 2022, Pagina/e 68(5): 3426-3444, ISSN 0018-9448
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2022.3143620

Random Self-reducibility of Ideal-SVP via Arakelov Random Walks

Autori: Koen de Boer, Léo Ducas, Alice Pellet-Mary, Benjamin Wesolowski
Pubblicato in: Advances in Cryptology – CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II, Numero 12171, 2020, Pagina/e 243-273, ISBN 978-3-030-56879-5
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-56880-1_9

Online-Extractability in the Quantum Random-Oracle Model

Autori: Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner
Pubblicato in: EUROCRYPT 2022, 2022, Pagina/e 677–706, ISBN 978-3-031-07081-5
Editore: Springer Verlag
DOI: 10.1007/978-3-031-07082-2_24

Correlated Pseudorandomness from Expand-Accumulate Codes

Autori: Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl
Pubblicato in: CRYPTO 2022, Numero 03029743, 2022, ISSN 0302-9743
Editore: Springer VerlagElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl

On the Complexity of Arithmetic Secret Sharing

Autori: Ronald Cramer, Chaoping Xing, Chen Yuan
Pubblicato in: TCC 2020, 2020, Pagina/e 444–469, ISBN 978-3-030-64380-5
Editore: Springer Verlag
DOI: 10.1007/978-3-030-64381-2_16

An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings

Autori: Mark Abspoel, Anders P. K. Dalskov, Daniel Escudero, Ariel Nof
Pubblicato in: ACNS 2021, 2021, Pagina/e 122-152, ISBN 978-3-030-78374-7
Editore: Springer Verlag
DOI: 10.1007/978-3-030-78375-4_6

Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple

Autori: Leo Ducas, Eamonn W. Postlethwaite, Ludo N. Pulles, Wessel van Woerden
Pubblicato in: ASIACRYPT 2022, 2022, Pagina/e 65--94
Editore: Springer
DOI: 10.1007/978-3-031-22972-5

Circuits resilient to short-circuit errors

Autori: Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch,
Pubblicato in: STOC 2022, 2022, Pagina/e 582-594, ISBN 978-1-4503-9264-8
Editore: ACM
DOI: 10.1145/3519935.3520007

Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC

Autori: Ronald Cramer, Matthieu Rambaud, and Chaoping Xing
Pubblicato in: CRYPTO 2021, 2021, Pagina/e 656–686, ISBN 978-3-030-84251-2
Editore: Springer
DOI: 10.1007/978-3-030-84252-9_22

Vector Commitments over Rings and Compressed Σ-Protocols

Autori: Thomas Attema, Ignacio Cascudo, Ronald Cramer, Ivan Bjerre Damgård, Daniel Escudero
Pubblicato in: TCC 2022, 2022
Editore: Springer Verlag

Compressed $$\varSigma $$-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics

Autori: Thomas Attema, Ronald Cramer
Pubblicato in: Advances in Cryptology – CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III, Numero 12172, 2020, Pagina/e 513-543, ISBN 978-3-030-56876-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-56877-1_18

Efficient NIZKs and Signatures from Commit-and-Open Protocols in the QROM

Autori: Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner
Pubblicato in: CRYPTO 2022, Numero 03029743, 2022, ISSN 0302-9743
Editore: Springer Verlag

NTRU Fatigue: How Stretched is Overstretched?

Autori: Léo Ducas, Wessel van Woerden
Pubblicato in: ASIACRYPT 2021, 2021, Pagina/e 4: 3-32, ISBN 978-3-030-92067-8
Editore: Springer Verlag
DOI: 10.1007/978-3-030-92068-5_1

The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier

Autori: Léo Ducas, Thijs Laarhoven, Wessel P. J. van Woerden
Pubblicato in: Public-Key Cryptography – PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4–7, 2020, Proceedings, Part II, Numero 12111, 2020, Pagina/e 3-36, ISBN 978-3-030-45387-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-45388-6_1

The Measure-and-Reprogram Technique 2.0: Multi-round Fiat-Shamir and More

Autori: Jelle Don, Serge Fehr, Christian Majenz
Pubblicato in: Advances in Cryptology – CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III, Numero 12172, 2020, Pagina/e 602-631, ISBN 978-3-030-56876-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-56877-1_21

SPD$$\mathbb {Z}_{2^k}$$: Efficient MPC mod $$2^k$$ for Dishonest Majority

Autori: Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing
Pubblicato in: Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part II, Numero 10992, 2018, Pagina/e 769-798, ISBN 978-3-319-96880-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-96881-0_26

Amortized Complexity of Information-Theoretically Secure MPC Revisited

Autori: Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan
Pubblicato in: Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part III, Numero 10993, 2018, Pagina/e 395-426, ISBN 978-3-319-96877-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-96878-0_14

Efficient Verifiable Delay Functions

Autori: Benjamin Wesolowski
Pubblicato in: Advances in Cryptology – EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19–23, 2019, Proceedings, Part III, Numero 11478, 2019, Pagina/e 379-407, ISBN 978-3-030-17658-7
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-17659-4_13

On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm

Autori: Léo Ducas, Maxime Plançon, Benjamin Wesolowski
Pubblicato in: Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part I, Numero 11692, 2019, Pagina/e 322-351, ISBN 978-3-030-26947-0
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-26948-7_12

On the Quantum Complexity of the Continuous Hidden Subgroup Problem

Autori: Koen de Boer, Léo Ducas, Serge Fehr
Pubblicato in: Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part II, Numero 12106, 2020, Pagina/e 341-370, ISBN 978-3-030-45723-5
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-45724-2_12

Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary

Autori: Serge Fehr, Chen Yuan
Pubblicato in: Advances in Cryptology – EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19–23, 2019, Proceedings, Part III, Numero 11478, 2019, Pagina/e 472-499, ISBN 978-3-030-17658-7
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-17659-4_16

Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes

Autori: Ronald Cramer, Chaoping Xing
Pubblicato in: Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part I, Numero 12105, 2020, Pagina/e 499-528, ISBN 978-3-030-45720-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-45721-1_18

Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model

Autori: Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner
Pubblicato in: Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part II, Numero 11693, 2019, Pagina/e 356-383, ISBN 978-3-030-26950-0
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-26951-7_13

Efficient Information-Theoretic Secure Multiparty Computation over $$\mathbb {Z}/p^k\mathbb {Z}$$ via Galois Rings

Autori: Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Chen Yuan
Pubblicato in: Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part I, Numero 11891, 2019, Pagina/e 471-501, ISBN 978-3-030-36029-0
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-36030-6_19

On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography

Autori: Léo Ducas, Wessel van Woerden
Pubblicato in: .EUROCRYPT 2022, 2022, Pagina/e 3: 643-673, ISBN 978-3-031-07081-5
Editore: Springer Verlag
DOI: 10.1007/978-3-031-07082-2_23

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over ℤ/ℤ

Autori: Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan
Pubblicato in: ASIACRYPT 2020, 2020, Pagina/e 151–180, ISBN 978-3-030-64839-8
Editore: Springer Verlag
DOI: 10.1007/978-3-030-64840-4_6

A Compressed Σ-Protocol Theory for Lattices

Autori: Thomas Attema, Ronald Cramer, Lisa Kohl:
Pubblicato in: CRYPTO 2021, 2021, Pagina/e 549–579, ISBN 978-3-030-84244-4
Editore: Springer Verlag
DOI: 10.1007/978-3-030-84245-1_19

Advanced Lattice Sieving on GPUs, with Tensor Cores

Autori: Léo Ducas, Marc Stevens, Wessel van Woerden
Pubblicato in: EUROCRYPT 2021, 2021, Pagina/e 2: 249-279, ISBN 978-3-030-77885-9
Editore: Springer Verlag
DOI: 10.1007/978-3-030-77886-6_9

Pubblicazioni

Condividi questa pagina

Scarica