Zobrazeno 1 - 10 of 21 pro vyhledávání: '"Couteau, Geoffroy"'
1
Report
Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding
Autor: Bombar, Maxime, Couteau, Geoffroy, Couvreur, Alain, Ducros, Clément
Secure computation often benefits from the use of correlated randomness to achieve fast, non-cryptographic online protocols. A recent paradigm put forth by Boyle $\textit{et al.}$ (CCS 2018, Crypto 2019) showed how pseudorandom correlation generators
Externí odkaz: http://arxiv.org/abs/2306.03488
Zobrazit plný text záznamu
2
Dissertation/ Thesis
Zero-knowledge proofs for secure computation
Autor: Couteau, Geoffroy
Dans cette thèse, nous étudions les preuves à divulgation nulle de connaissance, une primitive cryptographique permettant de prouver une assertion en ne révélant rien de plus que sa véracité, et leurs applications au calcul sécurisé. Nous in
Externí odkaz: http://www.theses.fr/2017PSLEE065/document
Zobrazit plný text záznamu
4
Sharp: Short Relaxed Range Proofs
Autor: Couteau, Geoffroy, Goudarzi, Dahmun, Klooß, Michael, Reichle, Michael
Publikováno v: CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security
CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security, Nov 2022, Los Angeles CA USA, United States. pp.609-622, ⟨10.1145/3548606.3560628⟩
International audience
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0033c0dcdb574523894527c33d8e2ed
https://hal.science/hal-03860720
Zobrazit plný text záznamu
5
Efficient NIZKs for Algebraic Sets
Autor: Couteau, Geoffroy, Lipmaa, Helger, Parisella, Roberto, Ødegaard, Arne
Publikováno v: ASIACRYPT 2021-International Conference on the Theory and Application of Cryptology and Information Security
ASIACRYPT 2021-International Conference on the Theory and Application of Cryptology and Information Security, Dec 2021, Online, Singapore
International audience; Significantly extending the framework of (Couteau and Hartmann, Crypto 2020), we propose a general methodology to construct NIZKs for showing that an encrypted vector χ belongs to an algebraic set, i.e., is in the zero locus
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5d5707f33807d639d1ca6f389cf132f6
https://hal.archives-ouvertes.fr/hal-03374536/file/2021-1251.pdf
Zobrazit plný text záznamu
6
Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
Autor: Couteau, Geoffroy, Roscoe, Bill, Ryan, Peter
Publikováno v: ACISP 2021-The 26th Australasian Conference on Information Security and Privacy
ACISP 2021-The 26th Australasian Conference on Information Security and Privacy, Dec 2021, Perth, Australia
International audience; We describe a new protocol to achieve two party ε-fair exchange: at any point in the unfolding of the protocol the difference in the probabilities of the parties having acquired the desired term is bounded by a value ε that
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1e75bff3c514a9184d0367906b34d015
https://hal.science/hal-03375287/file/2019-1281.pdf
Zobrazit plný text záznamu
7
Correlated Pseudorandomness from Expand-Accumulate Codes
Autor: Boyle, Elette, Couteau, Geoffroy, Gilboa, Niv, Ishai, Yuval, Kohl, Lisa, Resch, Nicolas, Scholl, Peter
Publikováno v: Boyle, E, Couteau, G, Gilboa, N, Ishai, Y, Kohl, L, Resch, N & Scholl, P 2022, Correlated Pseudorandomness from Expand-Accumulate Codes . in Y Dodis & T Shrimpton (eds), Advances in Cryptology-CRYPTO 2022-42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part II . vol. 13508, Springer, Lecture Notes in Computer Science, pp. 603-633 . https://doi.org/10.1007/978-3-031-15979-421
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=pure_au_____::175cf312483b54ed8c5817a09f1205e9
https://pure.au.dk/portal/da/publications/correlated-pseudorandomness-from-expandaccumulate-codes(a2215efe-e696-4571-99da-588f5407591c).html
Zobrazit plný text záznamu
8
Black-Box Uselessness: Composing Separations in Cryptography
Autor: Couteau, Geoffroy, Farshim, Pooya, Mahmoody, Mohammad
Publikováno v: ITCS 2021-12th Innovations in Theoretical Computer Science Conference
ITCS 2021-12th Innovations in Theoretical Computer Science Conference, Feb 2021, Online, United States
Black-box separations have been successfully used to identify the limits of a powerful set of tools in cryptography, namely those of black-box reductions. They allow proving that a large set of techniques are not capable of basing one primitive 𝒫
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76a8c45e41db00e8bebd7327af0387ca
https://hal.archives-ouvertes.fr/hal-03374178/file/2021-016.pdf
Zobrazit plný text záznamu
9
Low-complexity weak pseudorandom functions in AC0[MOD2]
Autor: Couteau, Geoffroy, Gilboa, Niv, Ishai, Yuval, Kohl, Lisa, Scholl, Peter
A weak pseudorandom function (WPRF) is a keyed function fk:{0,1}n→{0,1} such that, for a random key k, a collection of samples (x,fk(x)), for uniformly random inputs x, cannot be efficiently distinguished from totally random input-output pairs (x,
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::ade688540aee28b98e96341b46897443
https://ir.cwi.nl/pub/31404
Zobrazit plný text záznamu
10
Low-Complexity Weak Pseudorandom Functions in textdollartextbackslashmathtt AC0[textbackslashmathtt MOD2]textdollar
Autor: Boyle, Elette, Couteau, Geoffroy, Gilboa, Niv, Ishai, Yuval, Kohl, Lisa, Scholl, Peter
Publikováno v: Boyle, E, Couteau, G, Gilboa, N, Ishai, Y, Kohl, L & Scholl, P 2021, Low-Complexity Weak Pseudorandom Functions in textdollartextbackslashmathtt AC0[textbackslashmathtt MOD2]textdollar . in T Malkin & C Peikert (eds), Advances in Cryptology – CRYPTO 2021 : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part IV . Springer, Lecture Notes in Computer Science, vol. 12828, pp. 487-516, Annual International Cryptology Conference, 16/08/2021 . https://doi.org/10.1007/978-3-030-84259-8_17
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=pure_au_____::a110b41563238ce87a049b762c81f371
https://pure.au.dk/portal/da/publications/lowcomplexity-weak-pseudorandom-functions-in-textdollartextbackslashmathtt-ac0textbackslashmathtt-mod2textdollar(d31501bb-7a67-47c0-a0c4-0908c28b5837).html
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje