Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Claude Crépeau"'
A Sufficient Clarification of 'Super-Quantum Correlations: A Necessary Clarification' by Pierre Uzan
Autor:
Nicolas Courtemanche, Claude Crépeau
Publikováno v:
Journal of Quantum Information Science. 11:65-70
In the paper “Super-Quantum Correlations: A Necessary Clarification” by Uzan [1], it is suggested that stronger than quantum (or supra-quantum) correlations are not possible. The main point of Uzan’s argumentation is the belief that the intuiti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40e4acb8ad1599b99bfadc39cf15ea81
https://doi.org/10.4236/jqis.2021.112005
https://doi.org/10.4236/jqis.2021.112005
Publikováno v:
IEEE Transactions on Information Theory. 66:3745-3752
Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exchanging secret-keys as well as realizing other cryptographic primitives such as commitment and oblivious transfer. To be really useful, noisy channels
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c37e9bf653abf6e8a3b8a27613121c6d
https://doi.org/10.1109/tit.2020.2967048
https://doi.org/10.1109/tit.2020.2967048
Autor:
Pouriya, Alikhani, Nicolas, Brunner, Claude, Crépeau, Sébastien, Designolle, Raphaël, Houlmann, Weixu, Shi, Nan, Yang, Hugo, Zbinden
Publikováno v:
Nature. 599(7883)
Protecting secrets is a key challenge in our contemporary information-based era. In common situations, however, revealing secrets appears unavoidable; for instance, when identifying oneself in a bank to retrieve money. In turn, this may have highly u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::908ec4ca35568e9c94827c0f8be9c197
https://pubmed.ncbi.nlm.nih.gov/34732861
https://pubmed.ncbi.nlm.nih.gov/34732861
Autor:
Sébastien Designolle, Weixu Shi, Raphael Houlmann, Claude Crépeau, Hugo Zbinden, Pouriya Alikhani, Nicolas Brunner, Nan Yang
Publikováno v:
Nature, Vol. 599 (2020) pp. 47-50
Protecting secrets is a key challenge in our contemporary information-based era. In common situations, however, revealing secrets appears unavoidable, for instance, when identifying oneself in a bank to retrieve money. In turn, this may have highly u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3fc7cd465bb1af901e733b4329becd72
http://arxiv.org/abs/2012.10452
http://arxiv.org/abs/2012.10452
Publikováno v:
IEEE Transactions on Information Theory. 61:5623-5635
Interactive hashing has featured as an essential ingredient in protocols realizing a large variety of cryptographic tasks, notably oblivious transfer in the bounded storage model. In interactive hashing, a sender transfers a bit string to a receiver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa4baf323a6adf5a6c6c5e01704cec63
https://doi.org/10.1109/tit.2015.2450732
https://doi.org/10.1109/tit.2015.2450732
Autor:
Nan Yang, Claude Crépeau
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319612720
Mycrypt
Mycrypt
Several Multi-Prover Interactive Proofs (MIPs) found in the literature contain proofs of soundness that are lacking. This was first observed [1] in which a notion of Prover isolation is defined to partly address the issue. Furthermore, some existing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b76a1fe0956c5fbb8cfc0381c19eb58
https://doi.org/10.1007/978-3-319-61273-7_25
https://doi.org/10.1007/978-3-319-61273-7_25
Publikováno v:
Ad Hoc Networks. 6:17-31
The issue of certificate revocation in mobile ad hoc networks (MANETs) where there are no on-line access to trusted authorities, is a challenging problem. In wired network environments, when certificates are to be revoked, certificate authorities (CA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::349197328f9ccdb8e169eae5171298aa
https://doi.org/10.1016/j.adhoc.2006.07.003
https://doi.org/10.1016/j.adhoc.2006.07.003
Autor:
Raza Ali Kazmi, Claude Crépeau
Publikováno v:
Mathematical Foundations of Computer Science 2015 ISBN: 9783662480533
MFCS (2)
MFCS (2)
We define a new notion of Weakly Random-Self-Reducibile cryptosystems and show how it can be used to implement secure Oblivious Transfer. We also show that two recent Post-quantum cryptosystems (based on Learning With Errors and Approximate Integer G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52ccecf1ced5c23da4ebfec17be79a7f
https://doi.org/10.1007/978-3-662-48054-0_22
https://doi.org/10.1007/978-3-662-48054-0_22
Autor:
Raza Ali Kazmi, Claude Crépeau
Publikováno v:
Cryptography and Coding ISBN: 9783319272382
IMA Int. Conf.
IMA Int. Conf.
In this work we introduce a new hard problem in lattices called Isometric Lattice ProblemILP and reduce Linear Code Equivalence over prime fields and Graph Isomorphism to this problem. We also show that this problem has an efficient prover perfect ze
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7ff9c7a2c751c02f4c3aed3b7142066
https://doi.org/10.1007/978-3-319-27239-9_9
https://doi.org/10.1007/978-3-319-27239-9_9
Publikováno v:
Journal of Cryptology. 16:219-237
Oblivious transfer (OT) is an important primitive in cryptography. In chosen one-out-of-two string OT, a sender offers two strings, one of which the other party, called the receiver, can choose to read, not learning any information about the other st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d2739cb62d072cbebfd10b39bb7fdae
https://doi.org/10.1007/s00145-002-0146-4
https://doi.org/10.1007/s00145-002-0146-4