Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Atashpendar, Arash"'
We propose the use of PAKE for achieving and enhancing entity authentication (EA) and key management (KM) in the context of decentralized end-to-end encrypted email and secure messaging, i.e., where neither a public key infrastructure nor trusted thi
Externí odkaz:
http://arxiv.org/abs/2107.06090
We revisit the problem of entity authentication in decentralized end-to-end encrypted email and secure messaging to propose a practical and self-sustaining cryptographic solution based on password-authenticated key exchange (PAKE). This not only allo
Externí odkaz:
http://arxiv.org/abs/2005.10787
Autor:
Atashpendar, Arash
From the output produced by a memoryless deletion channel with a uniformly random input of known length $n$, one obtains a posterior distribution on the channel input. The difference between the Shannon entropy of this distribution and that of the un
Externí odkaz:
http://arxiv.org/abs/2003.11663
We present an approach for performing the tallying work in the coercion-resistant JCJ voting protocol, introduced by Juels, Catalano, and Jakobsson, in linear time using fully homomorphic encryption (FHE). The suggested enhancement also paves the pat
Externí odkaz:
http://arxiv.org/abs/1901.02560
Publikováno v:
NordSec 2018. Lecture Notes in Computer Science, vol. 11252, pp 104-120, Springer, Cham (2018)
We revisit the notion of deniability in quantum key exchange (QKE), a topic that remains largely unexplored. In the only work on this subject by Donald Beaver, it is argued that QKE is not necessarily deniable due to an eavesdropping attack that limi
Externí odkaz:
http://arxiv.org/abs/1812.02245
From the output produced by a memoryless deletion channel from a uniformly random input of known length $n$, one obtains a posterior distribution on the channel input. The difference between the Shannon entropy of this distribution and that of the un
Externí odkaz:
http://arxiv.org/abs/1807.11609
Autor:
Atashpendar, Arash, Beunardeau, Marc, Connolly, Aisling, Géraud, Rémi, Mestel, David, Roscoe, A. W., Ryan, Peter Y. A.
A binary string transmitted via a memoryless i.i.d. deletion channel is received as a subsequence of the original input. From this, one obtains a posterior distribution on the channel input, corresponding to a set of candidate supersequences weighted
Externí odkaz:
http://arxiv.org/abs/1802.00703
Autor:
Atashpendar, Arash
Research questions, originally rooted in quantum key exchange (QKE), have branched off into independent lines of inquiry ranging from information theory to fundamental physics. In a similar vein, the first part of this thesis is dedicated to informat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2658::7b1d4ca42fc4e75f9dfd69beec2509c9
http://orbilu.uni.lu/handle/10993/38825
http://orbilu.uni.lu/handle/10993/38825
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.
Publikováno v:
Security Protocols XXIII: Lecture Notes in Computer Science, Volume 9379, 2015 (pp. 325-341). Springer (2015).
This note describes an information theory problem that arose from some analysis of quantum key distribution protocols. The problem seems very natural and is very easy to state but has not to our knowledge been addressed before in the information theo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2658::f8ec4d4e2f1f1890fd429d82231d10e3
http://orbilu.uni.lu/handle/10993/21251
http://orbilu.uni.lu/handle/10993/21251