


default search action
Koray Karabina
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Hilda Azimi, Steven Chang, Jonathan Gold, Koray Karabina:
Improving accuracy and explainability of online handwritten character recognition. Int. J. Document Anal. Recognit. 27(4): 515-528 (2024) - [i21]Axel Durbet, Koray Karabina, Kevin Thiry-Atighehchi:
Generic Construction of Secure Sketches from Groups. IACR Cryptol. ePrint Arch. 2024: 1224 (2024) - 2023
- [c18]Dominic Gold
, Koray Karabina
, Francis C. Motta
:
Poster: Computing the Persistent Homology of Encrypted Data. CCS 2023: 3546-3548 - [i20]Dominic Gold, Koray Karabina, Francis C. Motta:
An Algorithm for Persistent Homology Computation Using Homomorphic Encryption. CoRR abs/2307.01923 (2023) - [i19]Dominic Gold, Koray Karabina, Francis C. Motta:
An Algorithm for Persistent Homology Computation Using Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2023: 1048 (2023) - 2022
- [c17]Masoumeh Shafieinejad, Suraj Gupta, Jin Yang Liu, Koray Karabina, Florian Kerschbaum:
Equi-Joins over Encrypted Data for Series of Queries. ICDE 2022: 1635-1648 - [i18]Hilda Azimi, Steven Chang, Jonathan Gold, Koray Karabina:
Improving Accuracy and Explainability of Online Handwriting Recognition. CoRR abs/2209.09102 (2022) - 2021
- [j13]Abbas Acar, Shoukat Ali, Koray Karabina, Cengiz Kaygusuz, Hidayet Aksu, Kemal Akkaya, Arif Selcuk Uluagac:
A Lightweight Privacy-Aware Continuous Authentication Protocol-PACA. ACM Trans. Priv. Secur. 24(4): 24:1-24:28 (2021) - [c16]Aaron Hutchinson, Koray Karabina, Geovandro Pereira:
Memory Optimization Techniques for Computing Discrete Logarithms in Compressed SIKE. PQCrypto 2021: 296-315 - [i17]Masoumeh Shafieinejad, Suraj Gupta, Jin Yang Liu, Koray Karabina, Florian Kerschbaum:
Equi-Joins Over Encrypted Data for Series of Queries. CoRR abs/2103.05792 (2021) - [i16]Aaron Hutchinson, Koray Karabina, Geovandro Pereira:
Memory Optimization Techniques for Computing Discrete Logarithms in Compressed SIKE. IACR Cryptol. ePrint Arch. 2021: 368 (2021) - 2020
- [j12]Loubna Ghammam, Koray Karabina
, Patrick Lacharme, Kevin Atighehchi
:
A Cryptanalysis of Two Cancelable Biometric Schemes Based on Index-of-Max Hashing. IEEE Trans. Inf. Forensics Secur. 15: 2869-2880 (2020) - [c15]Aaron Hutchinson, Koray Karabina:
A New Encoding Algorithm for a Multidimensional Version of the Montgomery Ladder. AFRICACRYPT 2020: 403-422 - [c14]Shoukat Ali, Koray Karabina, Emrah Karagoz:
Formal Accuracy Analysis of a Biometric Data Transformation and Its Application to Secure Template Generation. ICETE (2) 2020: 485-496 - [c13]Abhraneel Dutta, Aaron Hutchinson, Koray Karabina:
Extending the Signed Non-zero Bit and Sign-Aligned Columns Methods to General Bases for Use in Cryptography. INDOCRYPT 2020: 248-270 - [i15]Aaron Hutchinson, Koray Karabina:
A New Encoding Algorithm for a Multidimensional Version of the Montgomery Ladder. IACR Cryptol. ePrint Arch. 2020: 503 (2020) - [i14]Abhraneel Dutta, Aaron Hutchinson, Koray Karabina:
Extending the Signed Non-zero Bit and Sign-Aligned Columns Methods to General Bases for Use in Cryptography. IACR Cryptol. ePrint Arch. 2020: 1111 (2020)
2010 – 2019
- 2019
- [j11]Aaron Hutchinson, Koray Karabina:
Constructing multidimensional differential addition chains and their applications. J. Cryptogr. Eng. 9(1): 1-19 (2019) - [c12]Shoukat Ali, Koray Karabina, Emrah Karagoz:
Biometric data transformation for cryptographic domains and its application: poster. WiSec 2019: 304-305 - [i13]Kevin Atighehchi, Loubna Ghammam, Koray Karabina, Patrick Lacharme:
A Cryptanalysis of Two Cancelable Biometric Schemes based on Index-of-Max Hashing. CoRR abs/1910.01389 (2019) - 2018
- [c11]Koray Karabina, Angela Robinson:
Extending a Framework for Biometric Visual Cryptography. CANS 2018: 481-494 - [c10]Aaron Hutchinson, Koray Karabina:
Constructing Canonical Strategies for Parallel Implementation of Isogeny Based Cryptography. INDOCRYPT 2018: 169-189 - [c9]Hüseyin Hisil, Aaron Hutchinson, Koray Karabina:
d-MUL: Optimizing and Implementing a Multidimensional Scalar Multiplication Algorithm over Elliptic Curves. SPACE 2018: 198-217 - 2017
- [c8]Diego F. Aranha
, Reza Azarderakhsh, Koray Karabina:
Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves. SPACE 2017: 74-92 - [i12]Aaron Hutchinson, Koray Karabina:
Constructing Multidimensional Differential Addition Chains and their Applications. IACR Cryptol. ePrint Arch. 2017: 311 (2017) - 2016
- [j10]Koray Karabina, Onur Canpolat:
A new cryptographic primitive for noise tolerant template security. Pattern Recognit. Lett. 80: 70-75 (2016) - [c7]Reza Azarderakhsh, Koray Karabina:
Efficient Algorithms and Architectures for Double Point Multiplication on Elliptic Curves. CS2@HiPEAC 2016: 25-30 - [c6]Koray Karabina, Angela Robinson:
Revisiting the False Acceptance Rate Attack on Biometric Visual Cryptographic Schemes. ICITS 2016: 114-125 - 2015
- [j9]Sanjit Chatterjee, Koray Karabina, Alfred Menezes:
Fault Attacks on Pairing-Based Protocols Revisited. IEEE Trans. Computers 64(6): 1707-1714 (2015) - [c5]Koray Karabina:
Point Decomposition Problem in Binary Elliptic Curves. ICISC 2015: 155-168 - [i11]Koray Karabina:
Point Decomposition Problem in Binary Elliptic Curves. CoRR abs/1504.02347 (2015) - [i10]Koray Karabina:
Point Decomposition Problem in Binary Elliptic Curves. IACR Cryptol. ePrint Arch. 2015: 319 (2015) - 2014
- [j8]Reza Azarderakhsh, Koray Karabina:
A New Double Point Multiplication Algorithm and Its Application to Binary Elliptic Curves with Endomorphisms. IEEE Trans. Computers 63(10): 2614-2619 (2014) - [i9]Sanjit Chatterjee, Koray Karabina, Alfred Menezes:
Fault attacks on pairing-based protocols revisited. IACR Cryptol. ePrint Arch. 2014: 492 (2014) - 2013
- [j7]Koray Karabina, Edward Knapp, Alfred Menezes:
Generalizations of Verheul's theorem to asymmetric pairings. Adv. Math. Commun. 7(1): 103-111 (2013) - [j6]Koray Karabina:
Squaring in cyclotomic subgroups. Math. Comput. 82(281): 555-579 (2013) - [i8]Reza Azarderakhsh, Koray Karabina:
A Comparison of Double Point Multiplication Algorithms and their Implementation over Binary Elliptic Curves. IACR Cryptol. ePrint Arch. 2013: 504 (2013) - 2012
- [j5]Koray Karabina:
Torus-Based Compression by Factor 4 and 6. IEEE Trans. Inf. Theory 58(5): 3293-3304 (2012) - 2011
- [c4]Diego F. Aranha
, Koray Karabina, Patrick Longa, Catherine H. Gebotys, Julio López:
Faster Explicit Formulas for Computing Pairings over Ordinary Curves. EUROCRYPT 2011: 48-68 - 2010
- [b1]Koray Karabina:
Discrete Logarithm Cryptography. University of Waterloo, Ontario, Canada, 2010 - [j4]Koray Karabina, Berkant Ustaoglu
:
Invalid-curve attacks on (hyper)elliptic curve cryptosystems. Adv. Math. Commun. 4(3): 307-321 (2010) - [j3]Koray Karabina:
Factor-4 and 6 compression of cyclotomic subgroups of and. J. Math. Cryptol. 4(1): 1-42 (2010) - [j2]Koray Karabina, Alfred Menezes, Carl Pomerance, Igor E. Shparlinski
:
On the asymptotic effectiveness of Weil descent attacks. J. Math. Cryptol. 4(2): 175-191 (2010) - [i7]Koray Karabina:
Torus-based compression by factor 4 and 6. IACR Cryptol. ePrint Arch. 2010: 525 (2010) - [i6]Diego F. Aranha, Koray Karabina, Patrick Longa, Catherine H. Gebotys, Julio López:
Faster Explicit Formulas for Computing Pairings over Ordinary Curves. IACR Cryptol. ePrint Arch. 2010: 526 (2010) - [i5]Koray Karabina:
Squaring in cyclotomic subgroups. IACR Cryptol. ePrint Arch. 2010: 542 (2010)
2000 – 2009
- 2009
- [j1]Darrel Hankerson, Koray Karabina, Alfred Menezes:
Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields. IEEE Trans. Computers 58(10): 1411-1420 (2009) - [c3]Sanjit Chatterjee, Koray Karabina, Alfred Menezes:
A New Protocol for the Nearby Friend Problem. IMACC 2009: 236-251 - [c2]Koray Karabina:
Double-Exponentiation in Factor-4 Groups and Its Applications. IMACC 2009: 336-350 - [i4]Koray Karabina:
Factor-4 and 6 Compression of Cyclotomic Subgroups. IACR Cryptol. ePrint Arch. 2009: 304 (2009) - [i3]Koray Karabina:
Double-Exponentiation in Factor-4 Groups and its Applications. IACR Cryptol. ePrint Arch. 2009: 475 (2009) - 2008
- [c1]Koray Karabina, Edlyn Teske:
On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6. ANTS 2008: 102-117 - [i2]Darrel Hankerson, Koray Karabina, Alfred Menezes:
Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields. IACR Cryptol. ePrint Arch. 2008: 334 (2008) - 2007
- [i1]Koray Karabina, Edlyn Teske:
On prime-order elliptic curves with embedding degrees k=3, 4 and 6. IACR Cryptol. ePrint Arch. 2007: 425 (2007)
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint