default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOsmanbey Uzunkol
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]Stephan Moritz, Osmanbey Uzunkol
:
Secure delegation of group exponentiations: Efficient and fully verifiable schemes with two servers†. Secur. Priv. 6(4) (2023)- 2021
- [c9]Robi Pedersen, Osmanbey Uzunkol:
Delegating Supersingular Isogenies over $\mathbb {F}_{p^2}$ with Cryptographic Applications. ICISC 2021: 95-118 - [i11]Robi Pedersen, Osmanbey Uzunkol:
Delegating Supersingular Isogenies over 픽p2 with Cryptographic Applications. IACR Cryptol. ePrint Arch. 2021: 506 (2021)
2010 – 2019
- 2019
- [j4]Osmanbey Uzunkol:
Comments on "verifiable outsourced attribute-based signature scheme". Multim. Tools Appl. 78(9): 11735-11742 (2019) - [c8]Robi Pedersen, Osmanbey Uzunkol:
Secure Delegation of Isogeny Computations and Cryptographic Applications. CCSW 2019: 29-42 - [i10]Robi Pedersen, Osmanbey Uzunkol:
Secure Delegation of Isogeny Computations and Cryptographic Applications. IACR Cryptol. ePrint Arch. 2019: 1070 (2019) - 2018
- [j3]Osmanbey Uzunkol, Mehmet Sabir Kiraz:
Still wrong use of pairings in cryptography. Appl. Math. Comput. 333: 467-479 (2018) - [c7]Stephan Moritz, Osmanbey Uzunkol:
A More Efficient Secure Fully Verifiable Delegation Scheme for Simultaneous Group Exponentiations. ISDDC 2018: 74-93 - [c6]Osmanbey Uzunkol, Jothi Rangasamy, Lakshmi Kuppusamy:
Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT. ISC 2018: 250-267 - [i9]Osmanbey Uzunkol, Jothi Rangasamy, Lakshmi Kuppusamy:
Hide The Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT. IACR Cryptol. ePrint Arch. 2018: 644 (2018) - 2017
- [c5]Öznur Kalkar, Mehmet Sabir Kiraz, Isa Sertkaya, Osmanbey Uzunkol:
A More Efficient 1-Checkable Secure Outsourcing Algorithm for Bilinear Maps. WISTP 2017: 155-164 - [i8]Osmanbey Uzunkol, Öznur Kalkar, Isa Sertkaya:
Fully Verifiable Secure Delegation of Pairing Computation: Cryptanalysis and An Efficient Construction. IACR Cryptol. ePrint Arch. 2017: 1173 (2017) - 2016
- [j2]Mehmet Sabir Kiraz, Osmanbey Uzunkol:
Efficient and verifiable algorithms for secure outsourcing of cryptographic computations. Int. J. Inf. Sec. 15(5): 519-537 (2016) - [i7]Mehmet Sabir Kiraz, Osmanbey Uzunkol:
Still Wrong Use of Pairings in Cryptography. CoRR abs/1603.02826 (2016) - [i6]Mehmet Sabir Kiraz, Osmanbey Uzunkol:
Still Wrong Use of Pairings in Cryptography. IACR Cryptol. ePrint Arch. 2016: 223 (2016) - 2015
- [c4]Muhammed F. Esgin, Mehmet Sabir Kiraz, Osmanbey Uzunkol:
A New Partial Key Exposure Attack on Multi-power RSA. CAI 2015: 103-114 - [c3]Mehmet Sabir Kiraz, Isa Sertkaya, Osmanbey Uzunkol:
An efficient ID-based message recoverable privacy-preserving auditing scheme. PST 2015: 117-124 - [i5]Seher Tutdere, Osmanbey Uzunkol:
Construction of Arithmetic Secret Sharing Schemes by Using Torsion Limits. IACR Cryptol. ePrint Arch. 2015: 619 (2015) - [i4]Mehmet Sabir Kiraz, Isa Sertkaya, Osmanbey Uzunkol:
An Efficient ID-Based Message Recoverable Privacy-Preserving Auditing Scheme. IACR Cryptol. ePrint Arch. 2015: 633 (2015) - [i3]Muhammed F. Esgin, Mehmet S. Kiraz, Osmanbey Uzunkol:
A New Partial Key Exposure Attack on Multi-power RSA. IACR Cryptol. ePrint Arch. 2015: 642 (2015) - [i2]Öznur Arabaci, Mehmet Sabir Kiraz, Isa Sertkaya, Osmanbey Uzunkol:
More Efficient Secure Outsourcing Methods for Bilinear Maps. IACR Cryptol. ePrint Arch. 2015: 960 (2015) - 2014
- [c2]Atilla Bektas, Mehmet Sabir Kiraz, Osmanbey Uzunkol:
A Secure and Efficient Protocol for Electronic Treasury Auctions. BalkanCryptSec 2014: 123-140 - [c1]Isa Sertkaya, Ali Doganaksoy, Osmanbey Uzunkol, Mehmet Sabir Kiraz:
Affine Equivalency and Nonlinearity Preserving Bijective Mappings over 𝔽2. WAIFI 2014: 121-136 - [i1]Mehmet Sabir Kiraz, Osmanbey Uzunkol:
Efficient and Verifiable Algorithms for Secure Outsourcing of Cryptographic Computations. IACR Cryptol. ePrint Arch. 2014: 748 (2014) - 2011
- [j1]Franck Leprévost, Michael Pohst, Osmanbey Uzunkol:
On the Computation of Class Polynomials with "Thetanullwerte" and Its Applications to the Unit Group Computation. Exp. Math. 20(3): 271-281 (2011)
Coauthor Index
aka: Mehmet S. Kiraz
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 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
