Zobrazeno 1 - 10
of 342
pro vyhledávání: '"Cas Cremers"'
Publikováno v:
S&P 2022-43rd IEEE Symposium on Security and Privacy
S&P 2022-43rd IEEE Symposium on Security and Privacy, May 2022, San Francisco / Virtual, United States
S&P 2022-43rd IEEE Symposium on Security and Privacy, May 2022, San Francisco / Virtual, United States
International audience; We provide the first mechanized post-quantum sound security protocol proofs. We achieve this by developing PQ-BC, a computational first-order logic that is sound with respect to quantum attackers, and corresponding mechanizati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6666afb7509875836e3bf466d401fc57
https://inria.hal.science/hal-03620358
https://inria.hal.science/hal-03620358
Publikováno v:
Advances in Cryptology – CRYPTO 2022 ISBN: 9783031159787
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cb3a24a97b7cdc5a63c69bcbe72f0a1
https://doi.org/10.1007/978-3-031-15979-4_23
https://doi.org/10.1007/978-3-031-15979-4_23
Autor:
Gilles Barthe, Karthikeyan Bhargavan, Bryan Parno, Bruno Blanchet, Kevin Liao, Manuel Barbosa, Cas Cremers
Publikováno v:
SP 2021-42nd IEEE Symposium on Security and Privacy
SP 2021-42nd IEEE Symposium on Security and Privacy, May 2021, Virtual Conference, United States
2021 IEEE Symposium on Security and Privacy (SP)
IEEE Symposium on Security and Privacy
SP 2021-42nd IEEE Symposium on Security and Privacy, May 2021, Virtual Conference, United States
2021 IEEE Symposium on Security and Privacy (SP)
IEEE Symposium on Security and Privacy
International audience; Computer-aided cryptography is an active area of research that develops and applies formal, machine-checkable approaches to the design, analysis, and implementation of cryptography. We present a cross-cutting systematization o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d080f72de531ce79a971582fc9fa0f1
https://inria.hal.science/hal-03046757/document
https://inria.hal.science/hal-03046757/document
Publikováno v:
IEEE Symposium on Security and Privacy
Modern digital signature schemes can provide more guarantees than the standard notion of (strong) unforgeability, such as offering security even in the presence of maliciously generated keys, or requiring to know a message to produce a signature for
Publikováno v:
IEEE Symposium on Security and Privacy
A standard requirement for a signature scheme is that it is existentially unforgeable under chosen message attacks (EUF-CMA), alongside other properties of interest such as strong unforgeability (SUF-CMA), and resilience against key substitution atta
Publikováno v:
CCS
We investigate whether modern messaging apps achieve the strong post-compromise security guarantees offered by their underlying protocols. In particular, we perform a black-box experiment in which a user becomes the victim of a clone attack; in this
Autor:
Luke Garratt, Nick Sullivan, Liliya R. Akhmetzyanova, Stanislav Vital'evich Smyshlyaev, Cas Cremers
Publikováno v:
CSF
Many cryptographic mechanisms depend upon the availability of securely generated random numbers. In practice, the sources of random numbers can be unreliable for many reasons, including bugs, compromise or subversion of standards. While there exist w
Publikováno v:
CCS
The standard definition of security for digital signatures - existential unforgeability - does not ensure certain properties that protocol designers might expect. For example, in many modern signature schemes, one signature may verify against multipl
Publikováno v:
Journal of Computer Security. 26:459-508
Autor:
Cas Cremers, Michèle Feltz
Publikováno v:
Designs, Codes and Cryptography. 86:481-516
Recent history has revealed that many random number generators (RNGs) used in cryptographic algorithms and protocols were not providing appropriate randomness, either by accident or on purpose. Subsequently, researchers have proposed new algorithms a