Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Willy Quach"'
Publikováno v:
Advances in Cryptology – EUROCRYPT 2022 ISBN: 9783031070815
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3940cca453052b916bc185d40f836ef9
https://doi.org/10.1007/978-3-031-07082-2_26
https://doi.org/10.1007/978-3-031-07082-2_26
Publikováno v:
Theory of Cryptography ISBN: 9783031223174
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fa3d51e8ce81dd4a9390b05c292f383
https://doi.org/10.1007/978-3-031-22318-1_1
https://doi.org/10.1007/978-3-031-22318-1_1
Publikováno v:
Advances in Cryptology – CRYPTO 2021 ISBN: 9783030842581
CRYPTO (4)
CRYPTO (4)
Lossy trapdoor functions, introduced by Peikert and Waters (STOC ’08), can be initialized in one of two indistinguishable modes: in injective mode, the function preserves all information about its input, and can be efficiently inverted given a trap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c46c9f05770396540251f49601d8c76e
https://doi.org/10.1007/978-3-030-84259-8_15
https://doi.org/10.1007/978-3-030-84259-8_15
Publikováno v:
Theory of Cryptography ISBN: 9783030904524
TCC (2)
TCC (2)
We present a construction of indistinguishability obfuscation (iO) that relies on the learning with errors (LWE) assumption together with a new notion of succinctly sampling pseudorandom LWE samples. We then present a candidate LWE sampler whose secu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63c318d3d4c8c28283ea0baa1e8b65c6
https://doi.org/10.1007/978-3-030-90453-1_9
https://doi.org/10.1007/978-3-030-90453-1_9
Publikováno v:
Advances in Cryptology – CRYPTO 2021 ISBN: 9783030842581
CRYPTO (4)
CRYPTO (4)
The Fiat-Shamir transform is a general method for reducing interaction in public-coin protocols by replacing the random verifier messages with deterministic hashes of the protocol transcript. The soundness of this transformation is usually heuristic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05abfd48c738bfcfb45ee1f08b53eb29
https://doi.org/10.1007/978-3-030-84259-8_12
https://doi.org/10.1007/978-3-030-84259-8_12
Publikováno v:
Advances in Cryptology – CRYPTO 2020 ISBN: 9783030567835
CRYPTO (1)
CRYPTO (1)
Can Alice and Bob agree on a uniformly random secret key without having any truly secret randomness to begin with? Here we consider a setting where Eve can get partial leakage on the internal state of both Alice and Bob individually before the protoc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d773b10f659bc632202b74cee2572cbd
https://doi.org/10.1007/978-3-030-56784-2_14
https://doi.org/10.1007/978-3-030-56784-2_14
Autor:
Willy Quach
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030579890
SCN
SCN
We build a two-round, UC-secure oblivious transfer protocol (OT) in the common reference string (CRS) model under the Learning with Errors assumption (LWE) with super-polynomial modulus-to-noise ratio. We do so by instantiating the dual-mode encrypti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3338494a24352e44dfec0d431da9416
https://doi.org/10.1007/978-3-030-57990-6_10
https://doi.org/10.1007/978-3-030-57990-6_10
Publikováno v:
Euro-Par 2020: Parallel Processing ISBN: 9783030576745
Euro-Par
Euro-Par
Due to the advent of multicore architectures and massive parallelism, the tiled Cholesky factorization algorithm has recently received plenty of attention and is often referenced by practitioners as a case study. However, we note that a theoretical s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0485257dfe6525e0319fc86ecab0cca9
https://doi.org/10.1007/978-3-030-57675-2_9
https://doi.org/10.1007/978-3-030-57675-2_9
Publikováno v:
Advances in Cryptology – CRYPTO 2019 ISBN: 9783030269531
CRYPTO (3)
CRYPTO (3)
Non-interactive zero-knowledge arguments (NIZKs) for \(\mathsf {NP}\) are an important cryptographic primitive, but we currently only have instantiations under a few specific assumptions. Notably, we are missing constructions from the learning with e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88bc65b2b534b7b0a68ede831d29f584
https://doi.org/10.1007/978-3-030-26954-8_22
https://doi.org/10.1007/978-3-030-26954-8_22
Publikováno v:
Advances in Cryptology – EUROCRYPT 2019 ISBN: 9783030176556
EUROCRYPT (2)
EUROCRYPT (2)
Non-interactive zero-knowledge proofs (NIZKs) are a fundamental cryptographic primitive. Despite a long history of research, we only know how to construct NIZKs under a few select assumptions, such as the hardness of factoring or using bilinear maps.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5b40be4ec74ab0b2a3a16c4415e44e2
https://doi.org/10.1007/978-3-030-17656-3_21
https://doi.org/10.1007/978-3-030-17656-3_21