Khodakhast Bibak

According to our database, Khodakhast Bibak authored at least 36 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Cancer Prognosis and Diagnosis Methods Based on Ensemble Learning.

Behrouz Zolfaghari, Leila Mirsadeghi, Khodakhast Bibak, Kaveh Kavousi

ACM Comput. Surv., December, 2023

A tradeoff paradigm shift in cryptographically-secure pseudorandom number generation based on discrete logarithm.

Takeshi Koshiba, Behrouz Zolfaghari, Khodakhast Bibak

J. Inf. Secur. Appl., March, 2023

2022

DOTMIX-Pro: faster and more efficient variants of DOTMIX for dynamic-multithreading platforms.

Robert Ritchie, Khodakhast Bibak

J. Supercomput., 2022

Quantum key distribution using universal hash functions over finite fields.

Khodakhast Bibak

Quantum Inf. Process., 2022

From Random Numbers to Random Objects.

Behrouz Zolfaghari, Khodakhast Bibak, Takeshi Koshiba

Entropy, 2022

The Odyssey of Entropy: Cryptography.

Behrouz Zolfaghari, Khodakhast Bibak, Takeshi Koshiba

Entropy, 2022

The Modular Subset-Sum Problem and the size of deletion correcting codes.

Khodakhast Bibak, Behrouz Zolfaghari

Des. Codes Cryptogr., 2022

Perfect Secrecy in IoT - A Hybrid Combinatorial-Boolean Approach

Behrouz Zolfaghari, Khodakhast Bibak

Springer, ISBN: 978-3-031-13190-5, 2022

2021

Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security.

Khodakhast Bibak, Robert Ritchie

Quantum Inf. Process., 2021

Everlasting security of quantum key distribution with 1K-DWCDM and quadratic hash.

Khodakhast Bibak, Robert Ritchie, Behrouz Zolfaghari

Quantum Inf. Comput., 2021

Lower Bounds on Bandwidth Requirements of Regenerating Code Parameter Scaling in Distributed Storage Systems.

Behrouz Zolfaghari, Vikrant Singh, Sushmitha Reddy, Brijesh Kumar Rai, Khodakhast Bibak, Ali Dehghantanha

IEEE Commun. Lett., 2021

Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis.

Behrouz Zolfaghari, Vikrant Singh, Brijesh Kumar Rai, Khodakhast Bibak, Takeshi Koshiba

Entropy, 2021

Content Delivery Networks: State of the Art, Trends, and Future Roadmap.

Behrouz Zolfaghari, Gautam Srivastava, Swapnoneel Roy, Hamid R. Nemati, Fatemeh Afghah, Takeshi Koshiba, Abolfazl Razi, Khodakhast Bibak, Pinaki Mitra, Brijesh Kumar Rai

ACM Comput. Surv., 2021

2020

Generalized M_{m, r}-Network: A Case for Fixed Message Dimensions.

Vikrant Singh, Behrouz Zolfaghari, Chunduri Venkata Dheeraj Kumar, Brijesh Kumar Rai, Khodakhast Bibak, Gautam Srivastava, Swapnoneel Roy, Takeshi Koshiba

IEEE Commun. Lett., 2020

Order-restricted linear congruences.

Khodakhast Bibak

Discret. Math., 2020

Deletion correcting codes meet the Littlewood-Offord problem.

Khodakhast Bibak

Des. Codes Cryptogr., 2020

MMH* with arbitrary modulus is always almost-universal.

Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan

CoRR, 2020

SQUAREMIX: A Faster Pseudorandom Number Generator for Dynamic-Multithreading Platforms.

Robert Ritchie, Khodakhast Bibak

Proceedings of the Data Compression Conference, 2020

2019

Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes.

Khodakhast Bibak, Olgica Milenkovic

IEEE Trans. Commun., 2019

A generalization of Schönemann's theorem via a graph theoretic method.

Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan

Discret. Math., 2019

2018

On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes.

Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, László Tóth

Int. J. Found. Comput. Sci., 2018

Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes.

Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan

Des. Codes Cryptogr., 2018

Weight Enumerators of Some Classes of Deletion Correcting Codes.

Khodakhast Bibak, Olgica Milenkovic

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Number theoretic methods and their significance in computer science, information theory, combinatorics, and geometry.

Khodakhast Bibak

PhD thesis, 2017

2016

The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs.

Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan

IEEE Trans. Inf. Theory, 2016

MMH^⁎ with arbitrary modulus is always almost-universal.

Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan

Inf. Process. Lett., 2016

On a variant of multilinear modular hashing with applications to authentication and secrecy codes.

Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan, László Tóth

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

2015

Restricted linear congruences.

Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh, Roberto Tauraso, László Tóth

IACR Cryptol. ePrint Arch., 2015

Restricted linear congruences and an authenticated encryption scheme.

Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, Roberto Tauraso, László Tóth

CoRR, 2015

On almost-universal multilinear modular hashing with composite moduli.

Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh

CoRR, 2015

2014

On the Erdös-Gyárfás conjecture in claw-free graphs.

Khodakhast Bibak, Hossein Esfandiari, Pouria Salehi Nowbandegani, Mohammad Hassan Shirdareh Haghighi

Discuss. Math. Graph Theory, 2014

2013

Determinants of grids, tori, cylinders and Möbius ladders.

Khodakhast Bibak, Roberto Tauraso

Discret. Math., 2013

On the determinant of bipartite graphs.

Khodakhast Bibak

Discret. Math., 2013

Additive Combinatorics: With a View Towards Computer Science and Cryptography - An Exposition.

Khodakhast Bibak

Proceedings of the Number Theory and Related Fields, In Memory of Alf van der Poorten, 2013

2011

Degree-equipartite graphs.

Khodakhast Bibak, Mohammad Hassan Shirdareh Haghighi

Discret. Math., 2011

Additive combinatorics: with a view towards computer science and cryptography - An exposition

Khodakhast Bibak

CoRR, 2011