Osmanbey Uzunkol

Orcid: 0000-0002-5151-3848

According to our database1, Osmanbey Uzunkol authored at least 18 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Secure delegation of group exponentiations: Efficient and fully verifiable schemes with two servers<sup>†</sup>.
Secur. Priv., 2023

2021
Delegating Supersingular Isogenies over 픽<sub>p<sup>2</sup></sub> with Cryptographic Applications.
IACR Cryptol. ePrint Arch., 2021

Delegating Supersingular Isogenies over $\mathbb {F}_{p^2}$ with Cryptographic Applications.
Proceedings of the Information Security and Cryptology - ICISC 2021, 2021

2019
Comments on "verifiable outsourced attribute-based signature scheme".
Multim. Tools Appl., 2019

Secure Delegation of Isogeny Computations and Cryptographic Applications.
IACR Cryptol. ePrint Arch., 2019

2018
Hide The Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT.
IACR Cryptol. ePrint Arch., 2018

Still wrong use of pairings in cryptography.
Appl. Math. Comput., 2018

A More Efficient Secure Fully Verifiable Delegation Scheme for Simultaneous Group Exponentiations.
Proceedings of the Intelligent, Secure, and Dependable Systems in Distributed and Cloud Environments, 2018

2017
Fully Verifiable Secure Delegation of Pairing Computation: Cryptanalysis and An Efficient Construction.
IACR Cryptol. ePrint Arch., 2017

A More Efficient 1-Checkable Secure Outsourcing Algorithm for Bilinear Maps.
Proceedings of the Information Security Theory and Practice, 2017

2016
Efficient and verifiable algorithms for secure outsourcing of cryptographic computations.
Int. J. Inf. Sec., 2016

2015
Construction of Arithmetic Secret Sharing Schemes by Using Torsion Limits.
IACR Cryptol. ePrint Arch., 2015

An Efficient ID-Based Message Recoverable Privacy-Preserving Auditing Scheme.
IACR Cryptol. ePrint Arch., 2015

A New Partial Key Exposure Attack on Multi-power RSA.
IACR Cryptol. ePrint Arch., 2015

More Efficient Secure Outsourcing Methods for Bilinear Maps.
IACR Cryptol. ePrint Arch., 2015

2014
Affine Equivalency and Nonlinearity Preserving Bijective Mappings over 𝔽<sub>2</sub>.
Proceedings of the Arithmetic of Finite Fields - 5th International Workshop, 2014

A Secure and Efficient Protocol for Electronic Treasury Auctions.
Proceedings of the Cryptography and Information Security in the Balkans, 2014

2011
On the Computation of Class Polynomials with "Thetanullwerte" and Its Applications to the Unit Group Computation.
Exp. Math., 2011


  Loading...