Kamil Doruk Gür

ORCID: 0000-0003-4796-212X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Cryptography and Data Security
  • Complexity and Algorithms in Graphs
  • Coding theory and cryptography
  • Cryptographic Implementations and Security
  • Security and Verification in Computing
  • Privacy-Preserving Technologies in Data
  • Quantum Computing Algorithms and Architecture
  • Logic, Reasoning, and Knowledge
  • Adversarial Robustness in Machine Learning
  • Advanced Malware Detection Techniques
  • AI-based Problem Solving and Planning
  • Advanced Steganography and Watermarking Techniques
  • Semantic Web and Ontologies

New Jersey Institute of Technology
2017-2018

Sabancı Üniversitesi
2016

Lattice trapdoors are an important primitive used in a wide range of cryptographic protocols, such as identity-based encryption (IBE), attribute-based encryption, functional and program obfuscation. In this paper, we present software implementations the Gentry-Peikert-Vaikuntanathan (GPV) digital signature, IBE ciphertext-policy (CP-ABE) schemes based on efficient Gaussian sampling algorithm for trapdoor lattices, demonstrate that these three protocols practical. One aspect our...

10.1109/tc.2018.2874479 article EN IEEE Transactions on Computers 2018-10-16

We report on our implementation of a new Gaussian sampling algorithm for lattice trapdoors. Lattice trapdoors are used in wide array lattice-based cryptographic schemes including digital signatures, attributed-based encryption, program obfuscation and others. Our provides trapdoor lattices with prime moduli, supports both single- multi-threaded execution. experimentally evaluate through its use the GPV hash-and-sign signature scheme as benchmark. compare design prior work reported...

10.1145/3267973.3267975 preprint EN 2018-01-01

We address the practicality challenges of secure program obfuscation by implementing, optimizing, and experimentally assessing an approach to securely obfuscate conjunction programs proposed in [1]. Conjunction evaluate functions <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">f</i> ( xmlns:xlink="http://www.w3.org/1999/xlink">x</i> <sub xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> ,..., xmlns:xlink="http://www.w3.org/1999/xlink">L</sub> ) =...

10.1109/sp.2018.00007 article EN 2022 IEEE Symposium on Security and Privacy (SP) 2018-05-01
Coming Soon ...