Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKhodakhast Bibak
Person information
- affiliation: Miami University, Department of Computer Science and Software Engineering, Oxford, OH, USA
- affiliation: University of Illinois at Urbana-Champaign, Coordinated Science Laboratory, Urbana, IL, USA
- affiliation (PhD 2017): University of Victoria, Department of Computer Science, BC, Canada
- affiliation: University of Waterloo, Department of Combinatorics and Optimization, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j25]Behrouz Zolfaghari
, Leila Mirsadeghi, Khodakhast Bibak, Kaveh Kavousi:
Cancer Prognosis and Diagnosis Methods Based on Ensemble Learning. ACM Comput. Surv. 55(12): 262:1-262:34 (2023)- [j24]Takeshi Koshiba, Behrouz Zolfaghari, Khodakhast Bibak:
A tradeoff paradigm shift in cryptographically-secure pseudorandom number generation based on discrete logarithm. J. Inf. Secur. Appl. 73: 103430 (2023) - 2022
- [b2]Behrouz Zolfaghari, Khodakhast Bibak:
Perfect Secrecy in IoT - A Hybrid Combinatorial-Boolean Approach. Springer 2022, ISBN 978-3-031-13190-5, pp. 3-79 - [j23]Khodakhast Bibak, Behrouz Zolfaghari:
The Modular Subset-Sum Problem and the size of deletion correcting codes. Des. Codes Cryptogr. 90(8): 1721-1734 (2022) - [j22]Behrouz Zolfaghari, Khodakhast Bibak, Takeshi Koshiba:
The Odyssey of Entropy: Cryptography. Entropy 24(2): 266 (2022) - [j21]Behrouz Zolfaghari, Khodakhast Bibak, Takeshi Koshiba:
From Random Numbers to Random Objects. Entropy 24(7): 928 (2022) - [j20]Khodakhast Bibak:
Quantum key distribution using universal hash functions over finite fields. Quantum Inf. Process. 21(4): 121 (2022) - [j19]Robert Ritchie, Khodakhast Bibak:
DOTMIX-Pro: faster and more efficient variants of DOTMIX for dynamic-multithreading platforms. J. Supercomput. 78(1): 945-961 (2022) - 2021
- [j18]Behrouz Zolfaghari, Gautam Srivastava, Swapnoneel Roy, Hamid R. Nemati, Fatemeh Afghah, Takeshi Koshiba, Abolfazl Razi, Khodakhast Bibak, Pinaki Mitra, Brijesh Kumar Rai:
Content Delivery Networks: State of the Art, Trends, and Future Roadmap. ACM Comput. Surv. 53(2): 34:1-34:34 (2021) - [j17]Behrouz Zolfaghari, Vikrant Singh, Brijesh Kumar Rai, Khodakhast Bibak, Takeshi Koshiba:
Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis. Entropy 23(11): 1459 (2021) - [j16]Behrouz Zolfaghari, Vikrant Singh, Sushmitha Reddy, Brijesh Kumar Rai, Khodakhast Bibak, Ali Dehghantanha:
Lower Bounds on Bandwidth Requirements of Regenerating Code Parameter Scaling in Distributed Storage Systems. IEEE Commun. Lett. 25(5): 1477-1481 (2021) - [j15]Khodakhast Bibak, Robert Ritchie, Behrouz Zolfaghari:
Everlasting security of quantum key distribution with 1K-DWCDM and quadratic hash. Quantum Inf. Comput. 21(3&4): 181-202 (2021) - [j14]Khodakhast Bibak, Robert Ritchie:
Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security. Quantum Inf. Process. 20(7): 1-18 (2021) - 2020
- [j13]Khodakhast Bibak:
Deletion correcting codes meet the Littlewood-Offord problem. Des. Codes Cryptogr. 88(11): 2387-2396 (2020) - [j12]Khodakhast Bibak:
Order-restricted linear congruences. Discret. Math. 343(2): 111690 (2020) - [j11]Vikrant Singh, Behrouz Zolfaghari, Chunduri Venkata Dheeraj Kumar, Brijesh Kumar Rai, Khodakhast Bibak, Gautam Srivastava, Swapnoneel Roy, Takeshi Koshiba:
Generalized Mm, r-Network: A Case for Fixed Message Dimensions. IEEE Commun. Lett. 24(1): 38-42 (2020) - [c3]Robert Ritchie, Khodakhast Bibak:
SQUAREMIX: A Faster Pseudorandom Number Generator for Dynamic-Multithreading Platforms. DCC 2020: 391 - [i10]Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh:
The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs. CoRR abs/2010.05407 (2020) - [i9]Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh:
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes. CoRR abs/2010.05415 (2020) - [i8]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
MMH* with arbitrary modulus is always almost-universal. CoRR abs/2010.05420 (2020)
2010 – 2019
- 2019
- [j10]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
A generalization of Schönemann's theorem via a graph theoretic method. Discret. Math. 342(11): 3057-3061 (2019) - [j9]Khodakhast Bibak, Olgica Milenkovic:
Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes. IEEE Trans. Commun. 67(3): 1809-1816 (2019) - 2018
- [j8]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes. Des. Codes Cryptogr. 86(9): 1893-1904 (2018) - [j7]Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, László Tóth:
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes. Int. J. Found. Comput. Sci. 29(3): 357-376 (2018) - [c2]Khodakhast Bibak, Olgica Milenkovic:
Weight Enumerators of Some Classes of Deletion Correcting Codes. ISIT 2018: 431-435 - [i7]Khodakhast Bibak, Olgica Milenkovic:
Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes. CoRR abs/1812.09627 (2018) - 2017
- [b1]Khodakhast Bibak:
Number theoretic methods and their significance in computer science, information theory, combinatorics, and geometry. University of Victoria, Canada, 2017 - [i6]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
A generalization of Schönemann's theorem via a graph theoretic method. CoRR abs/1712.06770 (2017) - 2016
- [j6]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
MMH⁎ with arbitrary modulus is always almost-universal. Inf. Process. Lett. 116(7): 481-483 (2016) - [j5]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs. IEEE Trans. Inf. Theory 62(11): 6355-6358 (2016) - [c1]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan, László Tóth:
On a variant of multilinear modular hashing with applications to authentication and secrecy codes. ISITA 2016: 320-324 - 2015
- [i5]Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, Roberto Tauraso, László Tóth:
Restricted linear congruences and an authenticated encryption scheme. CoRR abs/1503.01806 (2015) - [i4]Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh:
On almost-universal multilinear modular hashing with composite moduli. CoRR abs/1507.02331 (2015) - [i3]Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh, Roberto Tauraso, László Tóth:
Restricted linear congruences. IACR Cryptol. ePrint Arch. 2015: 1186 (2015) - [i2]Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh, László Tóth:
On an almost-universal hash function family with applications to authentication and secrecy codes. IACR Cryptol. ePrint Arch. 2015: 1187 (2015) - 2014
- [j4]Khodakhast Bibak, Hossein Esfandiari, Pouria Salehi Nowbandegani, Mohammad Hassan Shirdareh Haghighi:
On the Erdös-Gyárfás conjecture in claw-free graphs. Discuss. Math. Graph Theory 34(3): 635-640 (2014) - 2013
- [j3]Khodakhast Bibak, Roberto Tauraso:
Determinants of grids, tori, cylinders and Möbius ladders. Discret. Math. 313(13): 1436-1440 (2013) - [j2]Khodakhast Bibak:
On the determinant of bipartite graphs. Discret. Math. 313(21): 2446-2450 (2013) - [p1]Khodakhast Bibak:
Additive Combinatorics: With a View Towards Computer Science and Cryptography - An Exposition. Number Theory and Related Fields 2013: 99-128 - 2011
- [j1]Khodakhast Bibak, Mohammad Hassan Shirdareh Haghighi:
Degree-equipartite graphs. Discret. Math. 311(10-11): 888-891 (2011) - [i1]Khodakhast Bibak:
Additive combinatorics: with a view towards computer science and cryptography - An exposition. CoRR abs/1108.3790 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-28 03:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
