Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Hamidreza Amini Khorasgani"'
Publikováno v:
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80bfce24b93b99c528c14661bd7ad165
https://doi.org/10.1109/focs54457.2022.00101
https://doi.org/10.1109/focs54457.2022.00101
Publikováno v:
Advances in Cryptology – EUROCRYPT 2022 ISBN: 9783031070815
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4bf897402dbf4ca8918949ff8ef5b133
https://doi.org/10.1007/978-3-031-07082-2_27
https://doi.org/10.1007/978-3-031-07082-2_27
Publikováno v:
Theory of Cryptography ISBN: 9783031223648
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b390fc9b3b3fe96ba678f8448d181a3
https://doi.org/10.1007/978-3-031-22365-5_14
https://doi.org/10.1007/978-3-031-22365-5_14
Publikováno v:
ISIT
Ben-Or and Linial (1985) introduced the full information model for coin-tossing protocols involving $n$ processors with unbounded computational power using a common broadcast channel for all their communications. For most adversarial settings, the ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0ccae0ec4a4eecb8b6debe397b13b5b
https://doi.org/10.1109/isit45174.2021.9518276
https://doi.org/10.1109/isit45174.2021.9518276
Publikováno v:
ISIT
Ben-Or and Linial (1985) introduced the full information model for coin-tossing protocols involving $n$ -processors with unbounded computational power using a common broadcast channel for all their communications. A bias- $X$ coin-tossing protocol ou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e88eea11e97bb6e8adaded1d274063ea
https://doi.org/10.1109/isit45174.2021.9518000
https://doi.org/10.1109/isit45174.2021.9518000
Publikováno v:
Theory of Cryptography ISBN: 9783030360320
TCC (2)
TCC (2)
Consider the representative task of designing a distributed coin-tossing protocol for n processors such that the probability of heads is \(X_0\in [0,1]\). This protocol should be robust to an adversary who can reset one processor to change the distri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::979ce341cb54bb78ccec620b47624b25
https://doi.org/10.1007/978-3-030-36033-7_13
https://doi.org/10.1007/978-3-030-36033-7_13
Publikováno v:
IEEE Transactions on Mobile Computing. 15:1237-1248
In this paper, we study the asymptotic throughput capacity of a static multi-channel multi-interface infrastructure wireless mesh network (InfWMN) wherein each infrastructure node has m interfaces and c channels of unequal bandwidth are available. Fi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::26fac48fac821a503e3fae9200066969
https://doi.org/10.1109/tmc.2015.2442253
https://doi.org/10.1109/tmc.2015.2442253
Publikováno v:
7'th International Symposium on Telecommunications (IST'2014).
In this paper, a variant of (t, n) threshold secret sharing scheme is realized using a lattice model. Due to the potential quantum attacks in the future, we need to construct a secure channels for transmitting secret shares. Such channels could be mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec555b3f5c7cf8a0fbad6fe7c2976d68
https://doi.org/10.1109/istel.2014.7000831
https://doi.org/10.1109/istel.2014.7000831
Publikováno v:
ISCISC
In this paper, we introduce a method of threshold secret sharing scheme in which secret reconstruction is based on celebrated Babai lattice algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e2441434a3b6e6a1b7b57521606ac07
https://doi.org/10.1109/iscisc.2014.6994043
https://doi.org/10.1109/iscisc.2014.6994043