Cansu Betin Onur

Orcid: 0000-0002-3691-1469

According to our database1, Cansu Betin Onur authored at least 9 papers between 2017 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A different base approach for better efficiency on range proofs.
J. Inf. Secur. Appl., 2024

PATS: Let Parties Have a Say in Threshold Group Key Sharing.
IET Inf. Secur., 2024

A Zero-Knowledge Proof of Knowledge for Subgroup Distance Problem.
CoRR, 2024

2023
Finding Islands on Encrypted Graphs.
Proceedings of the 31st Signal Processing and Communications Applications Conference, 2023

2022
Intractable Group-theoretic Problems Around Zero-knowledge Proofs.
CoRR, 2022

Performance of Graph-based Zero-knowledge Proofs.
Proceedings of the 30th Signal Processing and Communications Applications Conference, 2022

2021
An Improved Range Proof with Base-3 Construction.
IACR Cryptol. ePrint Arch., 2021

2017
Impossibility of Three Pass Protocol using Public Abelian Groups.
CoRR, 2017

Revisiting Shamir's No-Key Protocol: Lightweight Key Transport.
Proceedings of the 15th IEEE Intl Conf on Dependable, 2017


  Loading...