Additive combinatorics: with a view towards computer science and cryptography - An exposition - Khodakhast Bibak (CoRR, 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 (Number Theory and Related Fields, 2013)

On the determinant of bipartite graphs. - Khodakhast Bibak (Discret. Math., 2013)

Determinants of grids, tori, cylinders and Möbius ladders. - Khodakhast Bibak; Roberto Tauraso (Discret. Math., 2013)

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)

On almost-universal multilinear modular hashing with composite moduli. - Khodakhast Bibak; Bruce M. Kapron; S. Venkatesh 001 (CoRR, 2015)

Restricted linear congruences and an authenticated encryption scheme. - Khodakhast Bibak; Bruce M. Kapron; Srinivasan Venkatesh 001; Roberto Tauraso; László Tóth 003 (CoRR, 2015)

Restricted linear congruences. - Khodakhast Bibak; Bruce M. Kapron; S. Venkatesh 001; Roberto Tauraso; László Tóth 003 (IACR Cryptol. ePrint Arch., 2015)

On a variant of multilinear modular hashing with applications to authentication and secrecy codes. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001; László Tóth 003 (ISITA, 2016)

MMH⁎ with arbitrary modulus is always almost-universal. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (Inf. Process. Lett., 2016)

The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (IEEE Trans. Inf. Theory, 2016)

Number theoretic methods and their significance in computer science, information theory, combinatorics, and geometry. - Khodakhast Bibak (2017)

Weight Enumerators of Some Classes of Deletion Correcting Codes. - Khodakhast Bibak; Olgica Milenkovic (ISIT, 2018)

Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (Des. Codes Cryptogr., 2018)

On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes. - Khodakhast Bibak; Bruce M. Kapron; Srinivasan Venkatesh 001; László Tóth 003 (Int. J. Found. Comput. Sci., 2018)

A generalization of Schönemann's theorem via a graph theoretic method. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (Discret. Math., 2019)

Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes. - Khodakhast Bibak; Olgica Milenkovic (IEEE Trans. Commun., 2019)

SQUAREMIX: A Faster Pseudorandom Number Generator for Dynamic-Multithreading Platforms. - Robert Ritchie 001; Khodakhast Bibak (DCC, 2020)

MMH* with arbitrary modulus is always almost-universal. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (CoRR, 2020)

Deletion correcting codes meet the Littlewood-Offord problem. - Khodakhast Bibak (Des. Codes Cryptogr., 2020)

Order-restricted linear congruences. - Khodakhast Bibak (Discret. Math., 2020)

Generalized Mm, r-Network: A Case for Fixed Message Dimensions. - Vikrant Singh; Behrouz Zolfaghari; Chunduri Venkata Dheeraj Kumar; Brijesh Kumar Rai; Khodakhast Bibak; Gautam Srivastava 001; Swapnoneel Roy; Takeshi Koshiba (IEEE Commun. Lett., 2020)

Content Delivery Networks: State of the Art, Trends, and Future Roadmap. - Behrouz Zolfaghari; Gautam Srivastava 001; Swapnoneel Roy; Hamid R. Nemati; Fatemeh Afghah; Takeshi Koshiba; Abolfazl Razi; Khodakhast Bibak; Pinaki Mitra; Brijesh Kumar Rai (ACM Comput. Surv., 2021)

Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis. - Behrouz Zolfaghari; Vikrant Singh; Brijesh Kumar Rai; Khodakhast Bibak; Takeshi Koshiba (Entropy, 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)

Everlasting security of quantum key distribution with 1K-DWCDM and quadratic hash. - Khodakhast Bibak; Robert Ritchie 001; Behrouz Zolfaghari (Quantum Inf. Comput., 2021)

Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security. - Khodakhast Bibak; Robert Ritchie 001 (Quantum Inf. Process., 2021)

Perfect Secrecy in IoT - A Hybrid Combinatorial-Boolean Approach - Behrouz Zolfaghari; Khodakhast Bibak (Springer, 2022)

The Modular Subset-Sum Problem and the size of deletion correcting codes. - Khodakhast Bibak; Behrouz Zolfaghari (Des. Codes Cryptogr., 2022)

The Odyssey of Entropy: Cryptography. - Behrouz Zolfaghari; Khodakhast Bibak; Takeshi Koshiba (Entropy, 2022)

From Random Numbers to Random Objects. - Behrouz Zolfaghari; Khodakhast Bibak; Takeshi Koshiba (Entropy, 2022)

Quantum key distribution using universal hash functions over finite fields. - Khodakhast Bibak (Quantum Inf. Process., 2022)

DOTMIX-Pro: faster and more efficient variants of DOTMIX for dynamic-multithreading platforms. - Robert Ritchie 001; Khodakhast Bibak (J. Supercomput., 2022)

A tradeoff paradigm shift in cryptographically-secure pseudorandom number generation based on discrete logarithm. - Takeshi Koshiba; Behrouz Zolfaghari; Khodakhast Bibak (J. Inf. Secur. Appl., 2023)

Cancer Prognosis and Diagnosis Methods Based on Ensemble Learning. - Behrouz Zolfaghari; Leila Mirsadeghi; Khodakhast Bibak; Kaveh Kavousi (ACM Comput. Surv., 2023)

Secure UAV (Drone) and the Great Promise of AI. - Behrouz Zolfaghari; Mostafa Abbas Mollaei; Fahimeh Hajizadeh; Naoto Yanai; Khodakhast Bibak (ACM Comput. Surv., 2024)

From Bottom of Sea to Space: Quo Vadis IoT? So What About Security? - Behrouz Zolfaghari; Jacob Krzciok; Khodakhast Bibak (Future Internet, 2025)