Kaushik Chakraborty

Orcid: 0000-0002-6425-0418

Affiliations:
  • TU Delft, The Netherlands
  • INRIA, Paris, France (former)
  • Pierre and Marie Curie University, Paris, France (PhD 2017)


According to our database1, Kaushik Chakraborty authored at least 21 papers between 2012 and 2025.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Certified randomness using a trapped-ion quantum processor.
Nat., April, 2025

Applications of Certified Randomness.
CoRR, March, 2025

Fully device independent quantum private query.
Adv. Math. Commun., 2025

2024
Certified Randomness implies Secure Classical Position-Verification.
IACR Cryptol. ePrint Arch., 2024

On the Relativistic Zero Knowledge Quantum Proofs of Knowledge.
CoRR, 2024

2023
Quantum Lock: A Provable Quantum Communication Advantage.
Quantum, May, 2023

2022
A Proposal for Device Independent Probabilistic Quantum Oblivious Transfer.
Proceedings of the Progress in Cryptology - INDOCRYPT 2022, 2022

2021
On the Connection Between Quantum Pseudorandomness and Quantum Hardware Assumptions.
CoRR, 2021

Hybrid PUF: A Novel Way to Enhance the Security of Classical PUFs.
CoRR, 2021

QEnclave - A practical solution for secure quantum cloud computing.
CoRR, 2021

2017
Cryptography with Spacetime Constraints. (Cryptographie avec des contraintes spatio-temporelles).
PhD thesis, 2017

Redefining the transparency order.
Des. Codes Cryptogr., 2017

2016
Robust Relativistic Bit Commitment.
CoRR, 2016

Application of Grover's algorithm to check non-resiliency of a Boolean function.
Cryptogr. Commun., 2016

2015
Arbitrarily long relativistic bit commitment.
CoRR, 2015

2014
Efficient quantum algorithms to construct arbitrary Dicke states.
Quantum Inf. Process., 2014

Redefining the Transparency Order.
IACR Cryptol. ePrint Arch., 2014

Differential Power Analysis in Hamming Weight Model: How to Choose among (Extended) Affine Equivalent S-boxes.
Proceedings of the Progress in Cryptology - INDOCRYPT 2014, 2014

2013
Quantum algorithm to check Resiliency of a Boolean function.
IACR Cryptol. ePrint Arch., 2013

2012
Efficient quantum algorithm to construct arbitrary Dicke states
CoRR, 2012

CSHR: Selection of Cryptographically Suitable Hybrid Cellular Automata Rule.
Proceedings of the Cellular Automata, 2012


  Loading...