Filters








10 Hits in 4.6 sec

PQDH: A Quantum-Safe Replacement for Diffie-Hellman based on SIDH [article]

Vladimir Soukharev, Basil Hess
2019 IACR Cryptology ePrint Archive  
Finally, we show how to obtain an isogeny-based password-authenticated key exchange protocol based on our scheme by applying a construction shown in [16] .  ...  This scheme is based on elliptic curve isogenies and can be viewed as a variant of the well-known SIDH protocol.  ...  PQDH-Based PAKE In this section, we present a password-authenticated key exchange protocol based on isogenies, namely a PQDH-based PAKE.  ... 
dblp:journals/iacr/SoukharevH19 fatcat:vjd3ipycdfe3lptrqjtlj4uatq

An Isogeny-Based Password-Authenticated Key Establishment Protocol [article]

Oleg Taraskin, Vladimir Soukharev, David Jao, Jason T. LeGrow
2018 IACR Cryptology ePrint Archive  
We propose the first quantum-resistant password-authenticated key exchange scheme based on supersingular elliptic curve isogenies.  ...  Password authenticated key establishment (PAKE) is a cryptographic primitive that allows two parties who share a low-entropy secret (a password) to securely establish cryptographic keys in the absence  ...  This research was undertaken thanks in part to funding from the Canada First Research Excellence Fund, CryptoWorks21, NSERC, Public Works and Government Services Canada, and the Royal Bank of Canada.  ... 
dblp:journals/iacr/TaraskinSJL18 fatcat:svzwul23pzfchl3k76jn4uapua

Towards Isogeny-Based Password-Authenticated Key Establishment

Oleg Taraskin, Vladimir Soukharev, David Jao, Jason T. LeGrow
2020 Journal of Mathematical Cryptology  
We propose the first quantum-resistant password-authenticated key exchange scheme based on supersingular elliptic curve isogenies.  ...  AbstractPassword authenticated key establishment (PAKE) is a cryptographic primitive that allows two parties who share a low-entropy secret (a password) to securely establish cryptographic keys in the  ...  Until this work, the only PAKEs built on quantum-safe foundations are lattice-based [12, 27] . We propose the first PAKE based on isogenies between supersingular elliptic curves.  ... 
doi:10.1515/jmc-2020-0071 fatcat:rgpm3ei3vrhc5kodcs2j47udti

Review of Chosen Isogeny-Based Cryptographic Schemes

Bartosz Drzazga, Łukasz Krzywiecki
2022 Cryptography  
Our goal was not to develop an efficient implementation, but to provide materials that make it easier to analyze isogeny-based cryptography.  ...  Several families of post-quantum systems exist; one of them is isogeny-based cryptography. As a main contribution, in this paper, we provide a survey of chosen, fundamental isogeny-based schemes.  ...  It is the least complicated and we use it to also show how isogeny operations work in general. .  ... 
doi:10.3390/cryptography6020027 fatcat:jfwtotts7vbs3jbjpduz2ylljm

Quantum and post-quantum cryptography and cybersecurity: A systematic mapping [chapter]

Beatriz García Markaida, Xabier Larrucea, Manuel Graña Romay
2021 Colección Jornadas y Congresos  
Creating provably-secure isogeny-based password-authenticated key establishment protocols (PAKEs) is still a challenge; while in the classical setting this has been achieved in a number of ways, translating  ...  Quantum cryptography aims to use quantum technologies to create new cryptographic solutions.  ... 
doi:10.18239/jornadas_2021.34.53 fatcat:ouxje2qeaja5pajygkxblqebsm

Security Protocols in a Nutshell [article]

Mohsen Toorani
2016 arXiv   pre-print
They deploy some security mechanisms to provide certain security services. Security protocols are considered abstract when analyzed, but they can have extra vulnerabilities when implemented.  ...  Furthermore, a survey on computational security models for authenticated key exchange (AKE) and password-authenticated key exchange (PAKE) protocols, as the most important and well-studied type of security  ...  Acknowledgment The author would like to thank Øyvind Ytrehus for helpful comments and discussions.  ... 
arXiv:1605.09771v2 fatcat:mkbc3in6tvdo7madnvqaxogbfq

On PQC Migration and Crypto-Agility [article]

Alexander Wiesmaier
2021 arXiv   pre-print
Besides the development of PQC algorithms, the actual migration of IT systems to such new schemes has to be considered, best by utilizing or establishing crypto-agility.  ...  We use this as starting point for a community project to keep track of the ongoing efforts and the state of the art in this field.  ...  lattice-based (a grid as a discrete subset of an n-dimensional real vector space), code-based (the problem of decoding general error correcting codes), isogeny-based (algebraic geometry), and hash-based  ... 
arXiv:2106.09599v1 fatcat:itr6zdltirg2ri3ismbeo7vtiq

A Gapless Code-Based Hash Proof System based on RQC and its Applications [article]

Slim Bettaieb, Loïc Bidoux, Olivier Blazy, Yann Connan, Philippe Gaborit
2021 IACR Cryptology ePrint Archive  
This creates a lawless zone, where an adversary can possibly mount an undetectable attack, particularly problematic when trying to prove security in the UC framework [19] .  ...  This choice seems to inherently introduce a gap, as some elements outside the language could not be distinguish from those in the language.  ...  Several papers present PAKE in the lattice-based field [33, 43, 15] however we are the first, to the best of our knowledge, to present a PAKE based on coding theory. [14] proposed a construction allowing  ... 
dblp:journals/iacr/BettaiebBBCG21 fatcat:xouclkbdavba7cice56jvyfcpu

Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices [article]

Martin R. Albrecht, Alex Davidson, Amit Deo, Nigel P. Smart
2019 IACR Cryptology ePrint Archive  
Verifiable Oblivious Pseudorandom Functions (VOPRFs) are protocols that allow a client to learn verifiable pseudorandom function (PRF) evaluations on inputs of their choice.  ...  We construct such arguments as extensions of prior work in the area of lattice-based zeroknowledge proof systems.  ...  The client now must create N proofs for the most complex statements. On the other hand, the server does not need to create any proofs whatsoever in the online phase.  ... 
dblp:journals/iacr/AlbrechtDDS19 fatcat:ord3hgdlgzbydg4e4ogbmyjaxa

Algebraic Frameworks for Cryptographic Primitives

Navid Alamati, University, My
2021
For symmetric-key primitives, this goal has been accomplished by showing that one-way functions are necessary and sufficient to realize primitives ranging from symmetric-key encryption to digital signatures  ...  Our general approach is to augment symmetric abstractions with algebraic structure that turns out to be sufficient for PKE and much more, thus yielding a "bridge" between symmetric and asymmetric primitives  ...  We then show how certain isogeny-based assumptions can be modeled using our definitions. • We show several applications of cryptographic group actions (based on our definitions above) which were not previously  ... 
doi:10.7302/60 fatcat:j2zdgcqaqzaz7l62dezqxwmm4e