Zobrazeno 1 - 10
of 1 159
pro vyhledávání: '"Dumas, Jean"'
We consider the private set union (PSU) problem, where two parties each hold a private set of elements, and they want one of the parties (the receiver) to learn the union of the two sets and nothing else. Our protocols are targeted for the unbalanced
Externí odkaz:
http://arxiv.org/abs/2402.16393
We propose a non-commutative algorithm for multiplying 2x2 matrices using 7 coefficient products. This algorithm reaches simultaneously a better accuracy in practice compared to previously known such fast algorithms, and a time complexity bound with
Externí odkaz:
http://arxiv.org/abs/2402.05630
Autor:
Dumas, Jean-Guillaume, Grenet, Bruno
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some of the output variables are also input variables, linked by a linear dependency. Fundamental examples include the in-
Externí odkaz:
http://arxiv.org/abs/2307.12712
This study introduces the concept of the forking effect in the cryptocurrency market,specifically focusing on the impact of forking events on bitcoin, also called parent coin.We use a modified exponential GARCH model to examine the bitcoin's response
Externí odkaz:
http://arxiv.org/abs/2307.11718
Autor:
Dumas, Jean-Guillaume, Grenet, Bruno
We consider the simultaneously fast and in-place computation of the Euclidean polynomial modular remainder $R(X) $\not\equiv$ A(X) \mod B(X)$ with $A$ and $B$ of respective degrees $n$ and $m $\le$ n$. But fast algorithms for this usually come at the
Externí odkaz:
http://arxiv.org/abs/2302.13600
Publikováno v:
Western Journal of Emergency Medicine, Vol 11, Iss 3, Pp 235-241 (2010)
Externí odkaz:
https://doaj.org/article/9a89b8955a594912b937d4837795f129
Publikováno v:
Privacy Enhancing Technologies Symposium, Jul 2023, Lausanne (CH), Switzerland
Proofs of Retrievability are protocols which allow a Client to store data remotely and to efficiently ensure, via audits, that the entirety of that data is still intact. Dynamic Proofs of Retrievability (DPoR) also support efficient retrieval and upd
Externí odkaz:
http://arxiv.org/abs/2110.02022