Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Stahlbuhk, Thomas"'
Autor:
Woo, Jongchan, Vasudevan, Vipindev Adat, Kim, Benjamin D., D'Oliveira, Rafael G. L., Cohen, Alejandro, Stahlbuhk, Thomas, Duffy, Ken R., Médard, Muriel
The Internet of Things (IoT) represents a significant advancement in digital technology, with its rapidly growing network of interconnected devices. This expansion, however, brings forth critical challenges in data security and reliability, especiall
Externí odkaz:
http://arxiv.org/abs/2405.05107
Autor:
Kim, Benjamin D., Vasudevan, Vipindev Adat, Woo, Jongchan, Cohen, Alejandro, D'Oliveira, Rafael G. L., Stahlbuhk, Thomas, Médard, Muriel
The use of Mutual Information (MI) as a measure to evaluate the efficiency of cryptosystems has an extensive history. However, estimating MI between unknown random variables in a high-dimensional space is challenging. Recent advances in machine learn
Externí odkaz:
http://arxiv.org/abs/2309.08019
Autor:
Woo, Jongchan, Vasudevan, Vipindev Adat, Kim, Benjamin, Cohen, Alejandro, D'Oliveira, Rafael G. L., Stahlbuhk, Thomas, Médard, Muriel
This paper presents CERMET, an energy-efficient hardware architecture designed for hardware-constrained cryptosystems. CERMET employs a base cryptosystem in conjunction with network coding to provide both information-theoretic and computational secur
Externí odkaz:
http://arxiv.org/abs/2308.05063
Autor:
D'Oliveira, Rafael G. L., Cohen, Alejandro, Robinson, John, Stahlbuhk, Thomas, Médard, Muriel
We consider the problem of post-quantum secure and ultra-reliable communication through a heterogeneous network consisting of multiple connections. Three performance metrics are considered: security, throughput, and in-order delivery delay. In this s
Externí odkaz:
http://arxiv.org/abs/2108.06409
Throughput-optimal transmission scheduling in wireless networks has been a well considered problem in the literature, and the method for achieving optimality, MaxWeight scheduling, has been known for several decades. This algorithm achieves optimalit
Externí odkaz:
http://arxiv.org/abs/2008.01528
We consider a system consisting of a single transmitter/receiver pair and $N$ channels over which they may communicate. Packets randomly arrive to the transmitter's queue and wait to be successfully sent to the receiver. The transmitter may attempt a
Externí odkaz:
http://arxiv.org/abs/2005.05206
Autor:
Stahlbuhk, Thomas Benjamin
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2018.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collect
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collect
Externí odkaz:
http://hdl.handle.net/1721.1/119270
Publikováno v:
In Ad Hoc Networks 15 March 2019 85:131-144
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
2016 14th International Symposium on Modeling & Optimization in Mobile, Ad Hoc & Wireless Networks (WiOpt); 2016, p1-8, 8p