Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Pedersen, Thomas Brochmann"'
Autor:
Jain, Nitin, Chin, Hou-Man, Mani, Hossein, Lupo, Cosmo, Nikolic, Dino Solar, Kordts, Arne, Pirandola, Stefano, Pedersen, Thomas Brochmann, Kolb, Matthias, Ömer, Bernhard, Pacher, Christoph, Gehring, Tobias, Andersen, Ulrik L.
A quantum key distribution (QKD) system must fulfill the requirement of universal composability to ensure that any cryptographic application (using the QKD system) is also secure. Furthermore, the theoretical proof responsible for security analysis a
Externí odkaz:
http://arxiv.org/abs/2110.09262
Publikováno v:
In Discrete Applied Mathematics 15 October 2020 285:317-329
It is widely accepted in the quantum cryptography community that interactive information reconciliation protocols, such as cascade, are ineffcient due to the communication overhead. Instead, non-interactive information reconciliation protocols based
Externí odkaz:
http://arxiv.org/abs/1307.7829
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.
For commitments on secrets, statistical hiding is a must when we are dealing with a long-term secret or when the secret domain is small enough for a brute-force attack by a powerful adversary. Unfortunately, all the Chinese Remainder Theorem-based ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4122d457273a0e6011de604a8b2a8a34
http://hdl.handle.net/20.500.11851/1133
http://hdl.handle.net/20.500.11851/1133
Privacy preserving querying and data publishing has been studied in the context of statistical databases and statistical disclosure control. Recently, large-scale data collection and integration efforts increased privacy concerns which motivated data
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1246::5a8424a1bf1df6e44019eee65bd0e71b
http://epp.eurostat.ec.europa.eu/pls/portal/docs/PAGE/PGP_DS_CONFERENCES/PGE_CONFERENCES/PGE_UNECE/TAB70736602/WP4.PDF
http://epp.eurostat.ec.europa.eu/pls/portal/docs/PAGE/PGP_DS_CONFERENCES/PGE_CONFERENCES/PGE_UNECE/TAB70736602/WP4.PDF
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.
Autor:
Pedersen, Thomas Brochmann
Publikováno v:
Pedersen, T B 2006, Quantum Encryption Minimising Key Leakage under Known Plaintext Attacks . Daimi PhD Dissertation, no. PD-06-1 .
In this dissertation we show how, by using a quantum channel, we can get more unconditionally secret communication with a symmetric key under known plaintext attacks. In unconditionally secret encryption schemes the key is necessarily an expensive re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::4deab06d07e5c0be6db8ef503be121f1
https://pure.au.dk/portal/da/publications/quantum-encryption-minimising-key-leakage-under-known-plaintext-attacks(4d38e7a0-d3c3-11db-bee9-02004c4f4f50).html
https://pure.au.dk/portal/da/publications/quantum-encryption-minimising-key-leakage-under-known-plaintext-attacks(4d38e7a0-d3c3-11db-bee9-02004c4f4f50).html
Publikováno v:
Damgård, I B, Salvail, L & Pedersen, T B 2005, A Quantum Cipher with Near Optimal Key-Recycling . in V Shoup (ed.), Advances in Cryptology-CRYPTO 2005 : 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005. Proceedings . Springer, Lecture Notes in Computer Science, vol. 3621, pp. 494-510, Santa Barbara, CA, United States, 14/08/2005 . https://doi.org/10.1007/11535218_30
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::e3228b7cf83e848dacfd389ef29a74c0
https://pure.au.dk/portal/da/publications/a-quantum-cipher-with-near-optimal-keyrecycling(113283c0-5c94-11db-bee9-02004c4f4f50).html
https://pure.au.dk/portal/da/publications/a-quantum-cipher-with-near-optimal-keyrecycling(113283c0-5c94-11db-bee9-02004c4f4f50).html
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.