Zobrazeno 1 - 10
of 117
pro vyhledávání: '"Steven D. Galbraith"'
Autor:
Steven D. Galbraith
Public key cryptography is a major interdisciplinary subject with many real-world applications, such as digital signatures. A strong background in the mathematics underlying public key cryptography is essential for a deep understanding of the subject
Publikováno v:
International Journal of Computer Mathematics: Computer Systems Theory. 6:387-404
We present a polynomial-time adaptive attack on the 2-SIDH protocol. The 2-SIDH protocol is a special instance of the countermeasure proposed by Azarderakhsh, Jao and Leonardi to perform isogeny-ba...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e188c86ce555ff6faab79d0079151b7
https://doi.org/10.1080/23799927.2021.2018115
https://doi.org/10.1080/23799927.2021.2018115
Publikováno v:
ACM Transactions on Privacy and Security. 24:1-35
Searchable Encryption (SE) is a technique that allows Cloud Service Providers to search over encrypted datasets without learning the content of queries and records. In recent years, many SE schemes have been proposed to protect outsourced data. Howev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27de765a508cad9d710e0c8bfea6cf2d
https://doi.org/10.1145/3446920
https://doi.org/10.1145/3446920
Publikováno v:
Advances in Cryptology – EUROCRYPT 2020
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2020
Advances in Cryptology – EUROCRYPT 2020 ISBN: 9783030457235
EUROCRYPT (2)
Advances in Cryptology – EUROCRYPT 2020-39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part II
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2020
Advances in Cryptology – EUROCRYPT 2020 ISBN: 9783030457235
EUROCRYPT (2)
Advances in Cryptology – EUROCRYPT 2020-39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part II
Many advanced lattice based cryptosystems require to sample lattice points from Gaussian distributions. One challenge for this task is that all current algorithms resort to floating-point arithmetic (FPA) at some point, which has numerous drawbacks i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a92175d023c7fa6c456f020254422a7
http://europepmc.org/articles/PMC7991737
http://europepmc.org/articles/PMC7991737
Publikováno v:
Advances in Cryptology – ASIACRYPT 2022 ISBN: 9783031229657
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::918dc74cc32e6f27fb2aca51ee8375f3
https://doi.org/10.1007/978-3-031-22966-4_11
https://doi.org/10.1007/978-3-031-22966-4_11
Publikováno v:
Advances in Cryptology-EUROCRYPT 2021
Lecture Notes in Computer Science ISBN: 9783030778699
EUROCRYPT (1)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2021
Lecture Notes in Computer Science ISBN: 9783030778699
EUROCRYPT (1)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2021
Oblivious transfer (OT) is an essential cryptographic tool that can serve as a building block for almost all secure multiparty functionalities. The strongest security notion against malicious adversaries is universal composability (UC-secure). An imp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8457addc211f7912faec1c01f9074b86
Autor:
Steven D. Galbraith, Trey Li
Publikováno v:
Information Security and Privacy ISBN: 9783030905668
ACISP
ACISP
Let \(S = \{1,\dots ,n\}\) be a set of integers and X be a subset of S. We study the boolean function \(f_X(Y)\) which outputs 1 if and only if Y is a small enough superset (resp., big enough subset) of X. Our purpose is to protect X from being known
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba262822101516db0ab8446c2922a2ac
https://doi.org/10.1007/978-3-030-90567-5_4
https://doi.org/10.1007/978-3-030-90567-5_4
Publikováno v:
Selected Areas in Cryptography ISBN: 9783030816513
SAC
SAC
In this paper we further the study of index calculus methods for solving the elliptic curve discrete logarithm problem (ECDLP). We focus on the index calculus for subfield curves, also called Koblitz curves, defined over \(\mathbb {F}_q\) with ECDLP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe922689aa1df13ef20df4a57db88e4d
https://doi.org/10.1007/978-3-030-81652-0_5
https://doi.org/10.1007/978-3-030-81652-0_5
Autor:
Steven D. Galbraith, Lukas Zobernig
Publikováno v:
Selected Areas in Cryptography ISBN: 9783030816513
SAC
SAC
We construct a virtual black box and perfect circuit-hiding obfuscator for evasive deterministic finite automata using a matrix encoding scheme with a limited zero-testing algorithm. We construct the matrix encoding scheme by extending an existing ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::211566ab2376838eea404476a46f71cc
https://doi.org/10.1007/978-3-030-81652-0_4
https://doi.org/10.1007/978-3-030-81652-0_4
Publikováno v:
TrustCom
Most recent theoretical literature on program obfuscation is based on notions like Virtual Black Box (VBB) obfuscation and indistinguishability Obfuscation (iO). These notions are very strong and are hard to satisfy. Further, they offer far more prot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d1f740c188fc7b023239202f8e5df8e
http://arxiv.org/abs/2011.02607
http://arxiv.org/abs/2011.02607