default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHamidreza Amini Khorasgani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c8]Saugata Basu, Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen:
Randomized Functions with High Round Complexity. TCC (1) 2023: 319-348- 2022
- [c7]Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen:
Secure Non-interactive Simulation: Feasibility and Rate. EUROCRYPT (3) 2022: 767-796 - [c6]Saugata Basu, Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen:
Geometry of Secure Two-party Computation. FOCS 2022: 1035-1044 - [c5]Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen:
Secure Non-interactive Simulation from Arbitrary Joint Distributions. TCC (2) 2022: 378-407 - 2021
- [c4]Hamidreza Amini Khorasgani, Hemanta K. Maji, Himanshi K. Mehta, Mingyuan Wang:
Efficient Distributed Coin-tossing Protocols. ISIT 2021: 2852-2857 - [c3]Hamidreza Amini Khorasgani, Hemanta K. Maji, Mingyuan Wang:
Optimally-secure Coin-tossing against a Byzantine Adversary. ISIT 2021: 2858-2863 - [i6]Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen:
Decidability of Secure Non-interactive Simulation of Doubly Symmetric Binary Source. IACR Cryptol. ePrint Arch. 2021: 190 (2021) - 2020
- [i5]Hamidreza Amini Khorasgani, Hemanta K. Maji, Mingyuan Wang:
Coin Tossing with Lazy Defense: Hardness of Computation Results. IACR Cryptol. ePrint Arch. 2020: 131 (2020) - [i4]Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen:
Secure Non-interactive Simulation: Hardness & Feasibility. IACR Cryptol. ePrint Arch. 2020: 252 (2020) - [i3]Hamidreza Amini Khorasgani, Hemanta K. Maji, Mingyuan Wang:
Design & Analysis of Optimal Coin-tossing: New Techniques. IACR Cryptol. ePrint Arch. 2020: 519 (2020)
2010 – 2019
- 2019
- [c2]Hamidreza Amini Khorasgani, Hemanta K. Maji, Tamalika Mukherjee:
Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness. TCC (2) 2019: 333-355 - [i2]Hamidreza Amini Khorasgani, Hemanta K. Maji, Tamalika Mukherjee:
Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness. CoRR abs/1907.01694 (2019) - [i1]Hamidreza Amini Khorasgani, Hemanta K. Maji, Tamalika Mukherjee:
Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness. IACR Cryptol. ePrint Arch. 2019: 774 (2019) - 2016
- [j2]Hamidreza Amini Khorasgani, Saba Asaad, Hossein Pilaram
, Taraneh Eghlidos, Mohammad Reza Aref:
On the design and security of a lattice-based threshold secret sharing scheme. ISC Int. J. Inf. Secur. 8(1): 25-38 (2016) - [j1]Mohammad Mansoori, Mehdi Mahdavi, Hamidreza Amini Khorasgani:
Performance Analysis of Large Multi-Interface Wireless Mesh Networks with Multi-Different Bandwidth Channel. IEEE Trans. Mob. Comput. 15(5): 1237-1248 (2016) - 2014
- [c1]Hamidreza Amini Khorasgani, Saba Asaad, Taraneh Eghlidos, Mohammad Reza Aref:
A lattice-based threshold secret sharing scheme. ISCISC 2014: 173-179
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 2024-10-07 21:14 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:
