Common use of Xxxxxx and X Clause in Contracts

Xxxxxx and X. Xxx, “A unified monotonic approach to generalized linear fractional programming,” Journal of Global Optimization, vol. 26, no. 3, pp. 229–259, 2003. [14] X. X. Xxxx, X. X. Xxxxx, and X. Xxxxx, “Xxxxx: Achieving global optimality for a non-convex wireless power control problem,” IEEE Transactions on Wireless Communications, vol. 8, no. 3, pp. 1553–1563, Mar 2009. [15] X. Xxxxxxxx and X. Xxxxxxx, “Common randomness in information theory and cryptography - part I: Secret sharing,” IEEE Transactions on Information Theory, vol. 39, no. 4, pp. 1121–1132, Jul. 1993. [16] I. Safaka, X. X. Xxxxxxxxxx, X. Xxxxxxx, E. Atsan, C. Fragouli, X. Xxxxxxxx, and X. Xxxxxxx, “Exchanging Secrets without Using Cryptography,” arXiv:1105.4991 [cs, math], May 2011, arXiv: 1105.4991. [Online]. Available: xxxx://xxxxx.xxx/abs/1105.4991 [17] I. Safaka, C. Fragouli, X. Xxxxxxxx, and X. Xxxxxxx, “Exchanging pairwise secrets efficiently,” in 2013 Proceedings IEEE INFOCOM, Apr. 2013, pp. 2265–2273.‌ [18] E. Atsan, I. Safaka, X. Xxxxxx, and X. Xxxxxxxx, “Low cost security for sensor networks,” in 2013 International Symposium on Network Coding (NetCod), Jun. 2013, pp. 1–6. [19] X. Xxxxxxxx, X. Xxxxxxx, X. Xxxxxx, X. Xxxxxxxx, X. Xxxxxxxxx, and X. Xxxxxxxxxxx, “Creating Secrets out of Erasures,” in Proceedings of the 19th Annual International Conference on Mobile Computing & Networking, ser. MobiCom ’13. New York, NY, USA: ACM, 2013, pp. 429–440. [Online]. Available: xxxx://xxx.xxx.xxx/10.1145/2500423.2500440 [20] X. X. Xxxx and X. Xxxxxxxxxxxx, Convex Optimization. Cambridge University Press, Mar. 2004. [21] X. X. Xxxxxxxxx, X. Xxxxx, and X. X. Xxxxxxxx, Convex Analysis and Optimization. Athena Scientific, 2003. [22] X. Xxxx, X. X. Xxxxxxxxxxx, X. Xxxxxxxx, and X. X. Xxxxxxx, “Secret communication over broadcast erasure channels with state-feedbac,” IEEE Transactions on Information Theory, vol. 61, pp. 4788–4808, Sep. 2015. [23] X. X. XxxXxxxxxxx, The Theory of Error-Correcting Codes, 2nd ed. Amsterdam; New York; New York: North Holland Publishing Co., 1978. [24] C. Fragouli and X. Xxxxxxxx, Network Coding Fundamentals. Hanover, MA: Now Publishers Inc, Jun. 2007.

Xxxxxx and X. XxxX. Xxxxxxx, “A unified monotonic approach to generalized linear fractional programming,” Journal Purification of Global Optimizationnoisy entanglement and faithful teleportation via noisy channels, volPhys. 26Rev. Lett., noVol. 376, pp. 229–259722–725, 20031996. [143] X.X. Xxxxxxx and X. Xxxxxxxx, Quantum cryptography: public key dis- tribution and coin tossing, Proceedings of the IEEE International Con- xxxxxxx on Computer, Systems, and Signal Processing, IEEE, pp. 175– 179, 1984. [4] X. Xxxxx, Optimal eavesdropping in quantum cryptography with six states, Phys. Rev. Lett., Xxx. 00, Xx. 00, pp. 3018–3021, 1998. [5] X. Xxˇxxx and X. Xxxxxxx, Quantum copying: beyond the no-cloning theorem, Phys. Rev. A, Vol. 54, pp. 1844–1852, 1996. [6] X. X. Xxxxxxx, M. A. Xxxxx, X. Xxxxxxx and X. X. Xxxx, Proposed ex- periment to test local hidden-variable theories, Phys. Rev. Lett., Vol. 23, pp. 880–884, 1969. [7] I. Csisz´ar and J. Ko¨rner, Broadcast channels with confidential messages, IEEE Transactions on Information Theory, Vol. IT-24, pp. 339–348, 1978. [8] D. Deutsch, X. Xxxxx, X. Xxxxx, X. Xxxxxxxxxxxx, X. Xxxxxxx, and A. Sanpera, Quantum privacy amplification and the security of quantum cryptography over noisy channels, Phys. Rev. Lett., Vol. 77, pp. 2818– 2821, 1996. [9] X. X. XxXxxxxxxx, X. X. Xxxx, X. X. Xxxxxx, X. X. Xxxxxx, and X. X. Xxxxxxxxx, Evidence for bound entangled states with negative partial transpose, quant-ph/9910026, 1999. [10] X. X. Xxxxx, Quantum cryptography based on Xxxx’x theorem, Phys. Rev. Lett., Vol. 67, pp. 661–663, 1991. See also Physics World, March 1998. [11] X. Xxxxx, X. Xxxxx, X. X. Xxxxxxxxx, X. X. Xxx, and X. Xxxxx, “XxxxxOptimal eavesdropping in quantum cryptography – I: Achieving global optimality for a non-convex wireless power control problem,” IEEE Transactions on Wireless Communicationsinformation bound and optimal strategy, volPhys. 8Rev. A, noVol. 356, pp. 1553–15631163–1172, Mar 20091997.‌‌ [12] X. Xxxxx, Stochastic quantum dynamics and relativity, Helv. Phys. Acta, Vol. 62, pp. 363–371, 1989. [13] X. Xxxxx and X. Xxxxxxx, Quantum cloning, eavesdropping, and Xxxx inequality, Phys. Lett. A, Vol. 228, pp. 13–21, 1997. [14] X. Xxxxx and X. Xxxxxx, Optimal quantum cloning machines, Phys. Rev. Lett., Vol. 79, pp. 2153–2156, 1997. [15] X. Xxxxxxxx Xxxxx and X. XxxxxxxXxxx, “Common randomness in information theory and Quantum cryptography - part Ion noisy channels: Secret sharing,” IEEE Transactions on Information Theoryquan- tum versus classical key agreement protocols, volPhys. 39Rev. Lett., noVol. 483, pp. 1121–11324200–4203, Jul. 19931999. [16] I. Safaka, X. X. Xxxxxxxxxx, X. Xxxxxxx, E. Atsan, C. Fragouli, X. Xxxxxxxx, and X. Xxxxxxx, “Exchanging Secrets without Using Cryptography,” arXiv:1105.4991 [cs, math], May 2011, arXiv: 1105.4991. [Online]. Available: xxxx://xxxxx.xxx/abs/1105.4991 [17] I. Safaka, C. Fragouli, X. Xxxxxxxx, and X. Xxxxxxx, “Exchanging pairwise secrets efficiently,” in 2013 Proceedings IEEE INFOCOM, Apr. 2013, pp. 2265–2273.‌ [18] E. Atsan, I. Safaka, X. Xxxxxx, and X. Xxxxxxxx, “Low cost security for sensor networks,” in 2013 International Symposium on Network Coding (NetCod), Jun. 2013, pp. 1–6. [19] X. Xxxxxxxx, X. Xxxxxxx, X. Xxxxxx, X. XxxxxxxxXxxxxxxxx, X. Xxxxxxxxx, and X. XxxxxxxxxxxXxxxxxxxx, Mixed-state entangle- ment and distillation: is there a “Creating Secrets out of Erasures,bound” entanglement in Proceedings of the 19th Annual International Conference on Mobile Computing & Networkingnature?, serPhys. MobiCom ’13Rev. Lett., Vol. New York, NY, USA: ACM, 201380, pp. 429–4405239-5242, 1998. [Online]17] X. Xxxxxxxxx, Separability criterion and inseparable mixed states with positive partial transposition, Phys. Available: xxxx://xxx.xxx.xxx/10.1145/2500423.2500440 Lett. A, Vol. 232, p. 333, 1997. [2018] X. Xxxxxxxxx, X. Xxxxxxxxx, and X. Xxxxxxxxx, Bound entanglement can be activated, quant-ph/9806058, 1998. [19] X. X. Xxxx and X. Xxxxxxxxxxxx, Convex Optimization. Cambridge University Press, Mar. 2004. [21] X. X. XxxxxxxxxXxxxxxxx, X. Xxxxx, and X. X. Xxxxxxxx, Convex Analysis and OptimizationA complete classi- fication of quantum ensembles having a given density matrix, Phys. Athena ScientificLett. A, 2003Vol. 183, pp. 14–18, 1993. [2220] X. XxxxXxxxxx, X. X. XxxxxxxxxxxSecret key agreement by public discussion from common information, X. Xxxxxxxx, and X. X. Xxxxxxx, “Secret communication over broadcast erasure channels with state-feedbac,” IEEE Transactions on Information Theory, volXxx. 6100, Xx. 0, pp. 4788–4808733-742, Sep. 20151993. [21] X. Xxxxxx and X. Xxxx, Strengthening security of information-theoretic secret-key agreement, to appear in Proceedings of EUROCRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, 2000. [22] X. Xxxxxx and X. Xxxx, Unconditionally secure key agreement and the intrinsic conditional information, IEEE Transactions on Information Theory, Vol. 45, No. 2, pp. 499–514, 1999. [23] X. X. XxxXxxxxxxxN. D. Mermin, The Theory Ithaca interpretation of Error-Correcting Codesquantum mechanics, 2nd edPra- mana, Vol. Amsterdam; New York; New York: North Holland Publishing Co.51, 1978pp. 549–565, 1998. [24] C. Fragouli X. Xxxxx, Quantum theory: concepts and methods, Kluwer Academic Publishers, 1993.‌‌ [25] X. Xxxxx, Separability criterion for density matrices, Phys. Rev. Lett., Vol. 77, pp. 1413–1415, 1996. [26] X. Xxxxxxx and X. Xxxxxxxx, Network Coding FundamentalsThermodynamics and the measure of en- tanglement, quant-ph/9610044, 1996. Hanover[27] X. Xxxxxxx, MAX. X. Xxxxxxx, X. Xxxxx, O. Guinnard, and X. Xxxxxxx, Automated plug and play quantum key distribution, Electron. Lett., Vol. 34, pp. 2116–2117, 1998. [28] X. X. Xxxxxxx, Communication theory of secrecy systems, Xxxx System Technical Journal, Vol. 28, pp. 656–715, 1949. [29] A. D. Xxxxx, The wire-tap channel, Xxxx System Technical Journal, Vol. 54, No. 8, pp. 1355–1387, 1975. [30] X. Xxxxxxx, X. Xxxxxxxx, X. Xxxxxxx, and X. Xxxxx, Quantum cryp- tography, Applied Physics B, Vol. 67, pp. 743–748, 1998. Appendix A: Now Publishers IncFigures PXYZ X Y Xxxxx Xxx Eve Z Figure 1: Secret-Key Agreement from Common Information Z Z 0.5 0.5 0.5 0.5 [0,0] 1 u [0,1] v [1,0] [1,1] Figure 2: The Channel PZ|Z in Example 1 Quantum World ρ is ... AB Measurement bound free separable entangled entangled I(X;Y Z)=0 I(X;Y Z)>0 5 α I(X;Y Z)>0 S(X;Y||Z)=0 S(X;Y||Z)=0 (?) S(X;Y||Z)>0 PXYZ satisfies ... Classical World Figure 3: The Results of Example 3 Appendix B: Measuring in “bad” Bases In this appendix we show, Jun. 2007by two examples, that the statements of Theo- rems 1 and 2 do not always hold for the standard bases and, in particular, not for arbitrary bases: Xxxxx and Xxx as well as Eve can perform bad mea- surements and give away an initial advantage. Let us begin with an example where measuring in the standard basis is a bad choice for Eve.

Xxxxxx and X. XxxX. Xxxxxxx, “A unified monotonic approach to generalized linear fractional programming,” Journal Purification of Global Optimizationnoisy entanglement and faithful teleportation via noisy channels, volPhys. 26Rev. Lett., noVol. 376, pp. 229–259722–725, 20031996. [143] X.X. Xxxxxxx and X. Xxxxxxxx, Quantum cryptography: public key dis- tribution and coin tossing, Proceedings of the IEEE International Con- xxxxxxx on Computer, Systems, and Signal Processing, IEEE, pp. 175– 179, 1984. [4] X. Xxxxx, Optimal eavesdropping in quantum cryptography with six states, Phys. Rev. Lett., Xxx. 00, Xx. 00, pp. 3018–3021, 1998. [5] X. Xxˇxxx and X. Xxxxxxx, Quantum copying: beyond the no-cloning theorem, Phys. Rev. A, Vol. 54, pp. 1844–1852, 1996. [6] X. X. Xxxxxxx, M. A. Xxxxx, X. Xxxxxxx and X. X. Xxxx, Proposed ex- periment to test local hidden-variable theories, Phys. Rev. Lett., Vol. 23, pp. 880–884, 1969. [7] I. Csisz´ar and J. K¨xxxxx, Broadcast channels with confidential messages, IEEE Transactions on Information Theory , Vol. IT-24, pp. 339–348, 1978. [8] D. Deutsch, X. Xxxxx, X. Xxxxx, X. Xxxxxxxxxxxx, X. Xxxxxxx, and A. Sanpera, Quantum privacy amplification and the security of quantum cryptography over noisy channels, Phys. Rev. Lett., Vol. 77, pp. 2818– 2821, 1996. [9] X. X. XxXxxxxxxx, X. X. Xxxx, X. X. Xxxxxx, X. X. Xxxxxx, and X. X. Xxxxxxxxx, Evidence for bound entangled states with negative partial transpose, quant-ph/9910026, 1999. [10] X. X. Xxxxx, Quantum cryptography based on Xxxx’x theorem, Phys. Rev. Lett., Vol. 67, pp. 661–663, 1991. See also Physics World, March 1998. [11] X. Xxxxx, X. Xxxxx, X. X. Xxxxxxxxx, X. X. Xxx, and X. Xxxxx, “XxxxxOptimal eavesdropping in quantum cryptography – I: Achieving global optimality for a non-convex wireless power control problem,” IEEE Transactions on Wireless Communicationsinformation bound and optimal strategy, volPhys. 8Rev. A, noVol. 356, pp. 1553–15631163–1172, Mar 20091997. [12] X. Xxxxx, Stochastic quantum dynamics and relativity, Helv. Phys. Acta, Vol. 62, pp. 363–371, 1989. [13] X. Xxxxx and X. Xxxxxxx, Quantum cloning, eavesdropping, and Xxxx inequality, Phys. Lett. A, Vol. 228, pp. 13–21, 1997. [14] X. Xxxxx and X. Xxxxxx, Optimal quantum cloning machines, Phys. Rev. Lett., Vol. 79, pp. 2153–2156, 1997. [15] X. Xxxxxxxx Xxxxx and X. XxxxxxxXxxx, “Common randomness in information theory and Quantum cryptography - part Ion noisy channels: Secret sharing,” IEEE Transactions on Information Theoryquan- tum versus classical key agreement protocols, volPhys. 39Rev. Lett., noVol. 483, pp. 1121–11324200–4203, Jul. 19931999. [16] I. Safaka, X. X. Xxxxxxxxxx, X. Xxxxxxx, E. Atsan, C. Fragouli, X. Xxxxxxxx, and X. Xxxxxxx, “Exchanging Secrets without Using Cryptography,” arXiv:1105.4991 [cs, math], May 2011, arXiv: 1105.4991. [Online]. Available: xxxx://xxxxx.xxx/abs/1105.4991 [17] I. Safaka, C. Fragouli, X. Xxxxxxxx, and X. Xxxxxxx, “Exchanging pairwise secrets efficiently,” in 2013 Proceedings IEEE INFOCOM, Apr. 2013, pp. 2265–2273.‌ [18] E. Atsan, I. Safaka, X. Xxxxxx, and X. Xxxxxxxx, “Low cost security for sensor networks,” in 2013 International Symposium on Network Coding (NetCod), Jun. 2013, pp. 1–6. [19] X. Xxxxxxxx, X. Xxxxxxx, X. Xxxxxx, X. XxxxxxxxXxxxxxxxx, X. Xxxxxxxxx, and X. XxxxxxxxxxxXxxxxxxxx, Mixed-state entangle- ment and distillation: is there a “Creating Secrets out of Erasures,bound” entanglement in Proceedings of the 19th Annual International Conference on Mobile Computing & Networkingnature?, serPhys. MobiCom ’13Rev. Lett., Vol. New York, NY, USA: ACM, 201380, pp. 429–4405239-5242, 1998. [Online]17] X. Xxxxxxxxx, Separability criterion and inseparable mixed states with positive partial transposition, Phys. Available: xxxx://xxx.xxx.xxx/10.1145/2500423.2500440 Lett. A, Vol. 232, p. 333, 1997. [2018] X. Xxxxxxxxx, X. Xxxxxxxxx, and X. Xxxxxxxxx, Bound entanglement can be activated, quant-ph/9806058, 1998. [19] X. X. Xxxx and X. Xxxxxxxxxxxx, Convex Optimization. Cambridge University Press, Mar. 2004. [21] X. X. XxxxxxxxxXxxxxxxx, X. Xxxxx, and X. X. Xxxxxxxx, Convex Analysis A complete classi- fication of quantum ensembles having a given density matrix, Phys. Lett. A, Vol. 183, pp. 14–18, 1993. [20] X. Xxxxxx, Secret key agreement by public discussion from common information, IEEE Transactions on Information Theory , Xxx. 00, Xx. 0, pp. 733-742, 1993. [21] X. Xxxxxx and Optimization. Athena ScientificX. Xxxx, 2003Strengthening security of information-theoretic secret-key agreement, to appear in Proceedings of EUROCRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, 2000. [22] X. Xxxxxx and X. Xxxx, Unconditionally secure key agreement and the intrinsic conditional information, IEEE Transactions on Information Theory , Vol. 45, No. 2, pp. 499–514, 1999. [23] N. D. Mermin, The Ithaca interpretation of quantum mechanics, Pra- mana, Vol. 51, pp. 549–565, 1998. [24] X. Xxxxx, Quantum theory: concepts and methods, Kluwer Academic Publishers, 1993. [25] X. Xxxxx, Separability criterion for density matrices, Phys. Rev. Lett., Vol. 77, pp. 1413–1415, 1996. [26] X. Xxxxxxx and X. Xxxxxxxx, Thermodynamics and the measure of en- tanglement, quant-ph/9610044, 1996. [27] X. Xxxxxxx, X. X. XxxxxxxxxxxXxxxxxx, X. Xxxxx, O. Guinnard, and X. Xxxxxxx, Automated plug and play quantum key distribution, Electron. Lett., Vol. 34, pp. 2116–2117, 1998. [28] X. X. Xxxxxxx, Communication theory of secrecy systems, Xxxx System Technical Journal, Vol. 28, pp. 656–715, 1949. [29] A. D. Xxxxx, The wire-tap channel, Xxxx System Technical Journal, Vol. 54, No. 8, pp. 1355–1387, 1975. [30] X. Xxxxxxx, X. Xxxxxxxx, and X. X. Xxxxxxx, “Secret communication over broadcast erasure channels with state-feedbac,” IEEE Transactions on Information Theoryand X. Xxxxx, volQuantum cryp- tography, Applied Physics B, Vol. 6167, pp. 4788–4808743–748, Sep. 20151998. Appendix A: Figures PXYZ X Y Xxxxx Xxx Eve Z Figure 1: Secret-Key Agreement from Common Information Z Z 0.5 0.5 0.5 0.5 [230,0] X. X. XxxXxxxxxxx1 u [0,1] v [1,0] [1,1] Figure 2: The Channel PZ|Z in Example 1 Quantum World ρ is ... AB Measurement bound free separable entangled entangled I(X;Y Z)=0 I(X;Y Z)>0 5 α I(X;Y Z)>0 S(X;Y||Z)=0 S(X;Y||Z)=0 (?) S(X;Y||Z)>0 PXYZ satisfies ... Classical World Figure 3: The Results of Example 3 Appendix B: Measuring in “bad” Bases In this appendix we show, The Theory by two examples, that the statements of Error-Correcting CodesTheo- rems 1 and 2 do not always hold for the standard bases and, 2nd edin particular, not for arbitrary bases: Xxxxx and Xxx as well as Eve can perform bad mea- surements and give away an initial advantage. Amsterdam; New York; New York: North Holland Publishing Co., 1978. [24] C. Fragouli and X. Xxxxxxxx, Network Coding Fundamentals. Hanover, MA: Now Publishers Inc, Jun. 2007Let us begin with an example where measuring in the standard basis is a bad choice for Eve.

Xxxxxx and X. XxxXxxxx. Resilient consensus pro- tocols. In PODC ’83: Proceedings of the sec- ond annual ACM symposium on Principles of dis- tributed computing, “A unified monotonic approach to generalized linear fractional programming,” Journal of Global Optimizationpages 12–26, volXxx Xxxx, XX, XXX, 0000. 26, no. 3, pp. 229–259, 2003ACM. [145] X. X. XxxxXxxxxxxx, X. X. XxxxxE. Madeira, and X. XxxxxXxxxxx. Optimal and practical wab-based consensus algorithms. In Euro-Par 2006 Parallel Processing, “Xxxxx: Achieving global optimality for a non-convex wireless power control problem,” IEEE Transactions on Wireless Communicationsvolume 4128 of Lecture Notes in Computer Science, volpages 549–558, Berlin / Heidelberg, September 2006. 8, no. 3, pp. 1553–1563, Mar 2009Springer. [156] X. Xxxxxxxx and X. Xxxxxxx, “Common randomness in information theory and cryptography - part I: Secret sharing,” IEEE Transactions on Information Theory, vol. 39, no. 4, pp. 1121–1132, Jul. 1993. [16] I. Safaka, X. X. Xxxxxxxxxx, X. Xxxxxxx, E. Atsan, C. Fragouli, X. Xxxxxxxx, and X. Xxxxxxx, “Exchanging Secrets without Using Cryptography,” arXiv:1105.4991 [cs, math], May 2011, arXiv: 1105.4991. [Online]. Available: xxxx://xxxxx.xxx/abs/1105.4991 [17] I. Safaka, C. Fragouli, X. Xxxxxxxx, and X. Xxxxxxx, “Exchanging pairwise secrets efficiently,” in 2013 Proceedings IEEE INFOCOM, Apr. 2013, pp. 2265–2273.‌ [18] E. Atsan, I. Safaka, X. Xxxxxx, and X. Xxxxxxxx, “Low cost security Xxxxxxx. A primary-backup protocol for sensor networks,” in 2013 in-memory database replication. In NCA ’06: Proceedings of the Fifth IEEE International Symposium on Network Coding (NetCod)Com- puting and Applications, Jun. 2013pages 204–211, ppWashing- ton, DC, USA, 2006. 1–6IEEE Computer Society. [197] X. Xxxxxxxx, X. Xxxxxxx, and X. Xxxxxx. Multi- coordinated Paxos. Technical Report 2006/2, EPFL and University of Lugano, 2006. [8] X. Xxxxxxxx, X. XxxxxxxxxXxxxxxx, and X. Xxxxxxxxxxx, “Creating Secrets out of Erasures,” in Xxxxxx. Multi- coordinated paxos: Brief announcement. In PODC ’07: Proceedings of the 19th Annual International Conference twenty-sixth annual ACM symposium on Mobile Computing & NetworkingPrinciples of distributed computing, ser. MobiCom ’13. pages 316–317, New York, NY, USA: ACM, 2013, pp2007. 429–440ACM Press. [Online]. Available: xxxx://xxx.xxx.xxx/10.1145/2500423.2500440 [209] X. X. Xxxx and X. Xxxxxxxxxxxx, Convex Optimization. Cambridge University Press, Mar. 2004. [21] X. X. XxxxxxxxxXxxxxxxx, X. XxxxxXxxxxxx, and X. Xxxxxx. Multi- coordinated agreement protocols for higher avail- abilty. In NCA ’08: Proceedings of the Seventh IEEE International Symposium on Network Com- puting and Applications, Washington, DC, USA, July 2008. IEEE Computer Society. [10] X. Xxxxxx and X. Xxxxxx. Practical byzantine fault tolerance. In OSDI ’99: Proceedings of the third symposium on Operating systems design and im- plementation, pages 000–000, Xxxxxxxx, Convex Analysis and OptimizationXX, XXX, 0000. Athena Scientific, 2003. [22] X. Xxxx, X. X. Xxxxxxxxxxx, X. Xxxxxxxx, and X. X. Xxxxxxx, “Secret communication over broadcast erasure channels with state-feedbac,” IEEE Transactions on Information Theory, vol. 61, pp. 4788–4808, Sep. 2015. [23] X. X. XxxXxxxxxxx, The Theory of Error-Correcting Codes, 2nd ed. Amsterdam; New York; New York: North Holland Publishing Co., 1978. [24] C. Fragouli and X. Xxxxxxxx, Network Coding Fundamentals. Hanover, MA: Now Publishers Inc, Jun. 2007USENIX Association.

Xxxxxx and X. Xxx, “A unified monotonic approach to generalized gener- alized linear fractional programming,” Journal of Global Optimization, vol. 26, no. 3, pp. 229–259, 2003. [1420] X. X. Xxxx, X. X. Xxxxx, and X. Xxxxx, “Xxxxx: Achieving global optimality for a non-convex wireless power control problem,” IEEE Transactions on Wireless Communications, vol. 8, no. 3, pp. 1553–1563, Mar 2009. [15] X. Xxxxxxxx and X. Xxxxxxx, “Common randomness in information theory and cryptography - part I: Secret sharing,” IEEE Transactions on Information Theory, vol. 39, no. 4, pp. 1121–1132, Jul. 1993. [1621] I. Safaka, X. X. Xxxxxxxxxx, X. Xxxxxxx, E. Atsan, C. Fragouli, X. XxxxxxxxXxxx- raki, and X. Xxxxxxx, “Exchanging Secrets without Using Cryptography,” arXiv:1105.4991 [cs, math], May 2011, arXiv: 1105.4991. [Online]. Available: xxxx://xxxxx.xxx/abs/1105.4991 [1722] I. Safaka, C. Fragouli, X. Xxxxxxxx, and X. Xxxxxxx, “Exchanging pairwise secrets efficiently,” in 2013 Proceedings IEEE INFOCOM, Apr. 2013, pp. 2265–2273.‌ 2265–2273. [1823] E. Atsan, I. Safaka, X. Xxxxxx, and X. Xxxxxxxx, “Low cost security for sensor networks,” in 2013 International Symposium on Network Coding (NetCod), Jun. 2013, pp. 1–6. [1924] X. Xxxxxxxx, X. Xxxxxxx, X. Xxxxxx, X. Xxxxxxxx, X. Xxxxxxxxx, and X. Xxxxxxxxxxx, “Creating Secrets out of Erasures,” in Proceedings of the 19th Annual International Conference on Mobile Computing & Networking, ser. MobiCom ’13. New York, NY, USA: ACM, 2013, pp. 429–440. [Online]. Available: xxxx://xxx.xxx.xxx/10.1145/2500423.2500440 [2025] X. X. Xxxx and X. Xxxxxxxxxxxx, Convex Optimization. Cambridge University Press, Mar. 2004. [2126] X. Xxxxx, J. Ha, X. X. XxXxxxxxxx, X. Xxxxxx, and X. X. Xxxx, “LDPC Codes for the Gaussian Wiretap Channel,” IEEE Transactions on Information Forensics and Security, vol. 6, no. 3, pp. 532–540, Sep. 2011. [27] X. X. Xxxxxxxxx, X. Xxxxx, and X. X. Xxxxxxxx, Convex Analysis and Optimization. Athena Scientific, 2003. [2228] X. Xxxx, X. X. Xxxxxxxxxxx, X. Xxxxxxxx, and X. X. Xxxxxxx, “Secret communication over broadcast erasure channels with state-feedbac,” IEEE Transactions on Information Theory, vol. 61, pp. 4788–4808, Sep. 2015. [23] X. X. XxxXxxxxxxxXxxxx Xxxxxx Siavoshani is an Assistant Professor in the Department of Computer Engineering, The Theory Sharif University of Error-Correcting CodesTechnology (SUT), 2nd edTehran, Iran, from 2013. Amsterdam; New York; New York: North Holland Publishing Co.He received his B.S. degrees in Communica- tion Systems as well as Physics both from SUT in 2005. He was awarded an Excellency scholarship from Ecole Polytechnique Fe´de´rale de Lausanne (EPFL), 1978Switzerland, where he received the X.Xx. [24] C. Fragouli degree in 2007 and X. Xxxxxxxxthe Ph.D. degree in 2012, both in Computer, Communication, and Information Sciences. After completing his Ph.D., he joined the Institute of Network Coding Fundamentals(INC) at the Chinese University of Hong Kong (CUHK) as a postdoctoral fellow from 2012 to 2013. HanoverHis research interests include finding fundamental limits of Communication Systems and Networks. Moreover, MA: Now Publishers Inche is interested in the connection between Communication and Computer Sciences. In particular, Jun. he is interested in theory and algorithms for network information flow, network coding, network algorithms, information and coding theory, wireless communication networks. UCLA (2010). Xxxxxxx Xxxxxx received the B. Tech. degree in electronics and electrical communication engineer- ing from the Indian Institute of Technology, Kharag- pur, India in 2010, and the M.S. degree in electrical engineering from the University of California, Los Angeles in 2011. He is currently a Ph.D. student in the department of Electrical Engineering at Uni- versity of California, Los Angeles. His research interests include statistics and information theory with applications in security and machine learning. He is a recipient of the Xxxxx Xxxxxxx fellowship at Xxxxxxxxx Xxxxxxxx is a Professor at UCLA in the Electrical Engineering Department. She received the B.S. degree in Electrical Engineering from the National Technical University of Athens, Athens, Greece, in 1996, and the X.Xx. and Ph.D. degrees in Electrical Engineering from the University of California, Los Angeles, in 1998 and 2000, respec- tively. She has worked at the Information Sciences Center, AT&T Labs, Florham Park New Jersey, and the National University of Athens. She also visited Xxxx Laboratories, Xxxxxx Xxxx, NJ, and DIMACS, Rutgers University. Between 2006-2007., 2007-2012 and 2012-2015 she was an FNS Assistant Professor, an Assistant Professor and an Associate Professor, respectively, in the School of Computer and Communication Sciences, EPFL, Switzerland. She is an IEEE fellow. She served as an Associate Editor for IEEE Communications Letters, for Elsevier Computer Communication, for IEEE Transactions on Communications, for IEEE Transactions on Information Theory, and for IEEE Transactions on Mobile Communications. She received the Fulbright Fellowship for her graduate studies, the Outstanding Ph.D. Student Award 2000-2001, UCLA, Electrical Engineering Department, the Zonta award 2008 in Switzerland, the Starting Investigator ERC award in 2009, the Mobihoc 2013 best paper award, and the MASCOTS 2011 best paper award. Her research interests are in network coding, wireless communications, algorithms for networking and network security. Xxxxx X. Xxxxxxx received the B. Tech. degree in electrical engineering from the Indian Institute of Technology, Delhi, India, and the Ph.D. degree in electrical engineering from Stanford University, Stanford, CA, in 1998. After completing his Ph.D., he was a Principal Member Technical Staff in the Information Sciences Center, AT&T Xxxxxxx Laboratories, Florham Park, NJ. After that he was on the faculty of the School of Computer and Communication Sciences, EPFL, where he directed the Laboratory for Information and Communication

Xxxxxx and X. Xxx, “A unified monotonic approach to generalized linear fractional programmingmachine-learning-based data-centric misbehavior detection model for internet of vehicles,” Journal IEEE Internet of Global OptimizationThings Journal, vol. 268, no. 36, pp. 229–2594991–4999, 20032021. [1422] X. Xxxxxxx and X. Xxxx, “Misbehavior detection using machine learning in vehicular communication networks,” in ICC 2019 - 2019 IEEE International Conference on Communications (ICC), 2019, pp. 1–6. [23] X. Xxxxx, X. Xxxx, X. X. xxx xxx Xxx, X. Xxxxxx, X. Xxxxx, and X. Xxxxx, “XxxxxVeReMi extension: Achieving global optimality A dataset for a non-convex wireless power control problemcomparable evaluation of misbehavior detection in VANETs,” in ICC 2020 - 2020 IEEE Transactions International Conference on Wireless CommunicationsCommunications (ICC), 2020, pp. 1–6. [24] X. Xxxxx, X. Xxxxxxx, X. Xxxxxxx-Xxxxxxx, and X. Xxxxxx-Xxxxxx, "Reinforcement learning-based misbehaviour detection in V2X scenarios", in Proc. of IEEE International Mediterranean Conference on Communications and Networking 2021 (IEEE MeditCom 2021), September 2021. [25] X. Xxxxxx et al., Reinforcement learning: An introduction. MIT press, 2018. [26] X. Xxxxxxx et al., “Q-learning,” Machine learning, vol. 8, no. 3-4, pp. 1553–1563279–292, Mar 20091992. [1527] VeReMi dataset: xxxxx://xxxxxx.xxx/josephkamel/VeReMi-Dataset [28] X. Xxxxxxxx X. Xxxxx and X. Xxxxx, "Computer network intrusion detection using sequential LSTM Neural Networks autoencoders," 2018 26th Signal Processing and Communications Applications Conference (SIU), 2018, pp. 1-4, doi: 10.1109/SIU.2018.8404689. [29] Canadian Institute for Cybersecurity datasets, xxxx://xxx.xxxx.xx/datasets/ [30] R. U. Xxxx, X. Zhang, X. Xxxxxx and X. Xxxxx, "An Improved Convolutional Neural Network Model for Intrusion Detection in Networks," 2019 Cybersecurity and Cyberforensics Conference (CCC), 2019, pp. 74-77, doi: 10.1109/CCC.2019.000-6. [31] KDD dataset, xxxx://xxx.xxx.xxx.xxx/databases/kddcup99/kddcup99.html [32] X. Xxx, X. Xxx, X. Xxxx, X. Xx and X. Xxxx, "Using convolutional neural networks to network intrusion detection for cyber threats," 2018 IEEE International Conference on Applied System Invention (ICASI), 2018, pp. 1107-1110, doi: 10.1109/ICASI.2018.8394474. [33] X. X. Xxxxxxxxx, X. X. Xxxxx and X. Xxx, "LSTM for Anomaly-Based Network Intrusion Detection," 2018 28th International Telecommunication Networks and Applications Conference (ITNAC), 2018, pp. 1-3, doi: 10.1109/ATNAC.2018.8615300.Authors, Title2, Date…. [34] xxxxx://xxx.xx-xxxxxx.xx/forschung/forschungsprojekte- oeffentlich/informationstechnologie/cidds-coburg-intrusion-detection-data-sets.html [35] Gümüşbaş, D., Xxxxxxxx, T., Xxxxxxxx, X., & Xxxxxx, F. (2020). A comprehensive survey of databases and deep learning methods for cybersecurity and intrusion detection systems. IEEE Systems Journal [36] Xxxxxx, X., Xxxxxxxxx, X., Xxxxxxx, X., & Xxxxxxx, A. (2018). Kitsune: an ensemble of autoencoders for online network intrusion detection. arXiv preprint arXiv:1802.09089. [37] Xxxxxxxxx, G., Xxxxxx, A., Xx Xxxxx, N., Xxxxxxxx, C., and Xxxxxxx, D., Multi-channel deep feature learning for intrusion detection. IEEE Access, 8, 53346-53359. [38] Xxxxxxxxx, G., Xxxxxx, A., Xx Xxxxx, N., Xxxxxxxx, C., and Xxxxxxx, D. (2019, June). Exploiting the auto-encoder residual error for intrusion detection. In 2019 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW) (pp. 281-290). IEEE. [39] Encrypted Traffic Analysis. November 2019. ENISA. URL: xxxxx://xxx.xxxxx.xxxxxx.xx/publications/encrypted-traffic-analysis [40] Xxxx, Pan, et al. "A survey of techniques for mobile service encrypted traffic classification using deep learning," IEEE Access 7 (2019): 54024-54033 [41] Xxxxx, Xxxx, et al. "A survey of methods for encrypted traffic classification and analysis." International Journal of Network Management 25.5 (2015): 355-374 [42] Xxx, Xxxxxx, et al. "Long short term memory recurrent neural network classifier for intrusion detection." 2016 International Conference on Platform Technology and Service (PlatCon). IEEE, 2016 [43] Xxx, Xxxxxx, and Xxxxxx Xxxxx. "Machine learning based anomaly detection for 5g networks." arXiv preprint arXiv:2003.03474 (2020) [44] X. Xxxxx, X. Xxxx, and X. Xxxxxxx, “Common randomness Lightweight DDoS Flooding Attack Detection using NOX/OpenFlow,” in information theory IEEE Local Computer Network Conference, Oct. 2010, pp. 408 – 415. [45] X. Xxxxxxx, “The self-organizing map,” Proceedings of the IEEE, vol. 78, no. 9, pp. 1464 – 1480, 1990. [46] X. Xxxx, S. A. R. Xxxxx, X. XxXxxxxx, X. Xxxxxx, and cryptography - part IX. Xxxxxx, “Deep Recurrent Neural Network for Intrusion Detection in SDN-based Networks,” in Proc. of the 4th IEEE Conf. on Network Softwarization and Workshops (NetSoft), June 2018, pp. 1 – 5. [47] X. X. Xxxxxxxx, X. Xxxxxxx, X. Xxxxx, X. Xxxxxxxxxxxx, X. X. Xxx, X. Xxxxxxx, C. A. Xxxxxxxx, X. Barka, and M. Z. A. Xxxxxxx, “A New Machine Learning-based Collaborative DDoS Mitigation Mechanism in Software-Defined Network,” in Proc. of WiMob, Oct. 2018. [48] X. Xxxx, X. Xxx, X. Xxxx, and X. Xxxx, “SDN-assisted slow http DDoS attack defense method,” IEEE Commun. Lett., vol. 22, no. 4, Apr. 2018. [49] X. Xxxxxxxxxx, X. Xxxxxxxx, and B. V. Xxxxx, “Detection of lddos attacks based on TCP connection parameters,” CoRR, vol. abs/1904.01508, 2019. [50] Xxx Xxxxxxx Xxxxxxx, Xxxxxxx Xxxxxx, Xxxx X. Xxxxxxx Xxxxxx, and Xxxx Xxxxxx Xxxxxxx “Towards the transversal detection of DDoS network attacks in 5G multi-tenant overlay networks,” Computers & Security, 79:132 – 147, 2018. ISSN 0167-4048. doi: Secret sharingxxxxx://xxx.xxx/10.1016/x.xxxx.2018.07.017. [51] X. Xxxxxxxx, X. Xxxxx, X. Xxxxxxx, X. Xxxxx, X. Xxxxxx, X. Xxxxxxxxx, et al., "On end-to- end approach for slice isolation in 5G networks. Fundamental challenges", Proc. Federated Conf. Comput. Sci. Inf. Syst., pp. 783-792, Sep. 2017. [52] Apache JMeter tool: xxxxx://xxxxxx.xxxxxx.xxx/ [53] Slowhttptest tool: xxxxx://xxxxxx.xxx/shekyan/slowhttptest [54] X. Xxxxxxxxxxx, X. X. Xxxxxxxx, and X. X. Xxxxxxxx, “Toward Generating a New Intrusion Detection Dataset and Intrusion Traffic Characterization,” in Proc. of the 4th Int. Conf. on Inform. Syst. Security and Privacy (ICISSP), Jan. 2018. [55] X. Xxxxxxx, X. Xxxxxxxxx, and X. Xxxxx, “Robust Self-Protection Against Application-Layer (D)DoS Attacks in SDN Environment,” in Proc. IEEE WCNC 2020, Seoul, Korea, Apr. 2020. [56] MOSA!C, “Application-Layer DDoS Dataset,” xxxxx://xxx.xxxxxx.xxx/wardac/applicationlayer- ddos-dataset, 2019. [57] R.-X. Xxxxxxx, X. Xxxxx, X. Xxxxxx, A Novel Approach for Distributed Denial of Service Defense using Continuous Wavelet Transform and Convolutional Neural Network for Software-Defined Network“ Computers & Security, Vol. 112, Jan. 2022. [58] X. Xxxxx, P. A. Xxxxxxxxxx, X. Xxxxxxxx, X. Xxxxxxxx, “CDN Slicing over a Multi-Domain Edge Cloud,” in IEEE/ACM Trans. Mobile Computing., Vol. 19, No. 9, Sep. 2020, pp. 2010 – 2027. [59] X. X. Xxxxxx, X. X. X’Xxxxxx, X. X. Xxxxxx, X. X. Xxxxxxx, and X. X. Xxxxxxxxx, “GPS spoofing detection via dual-receiver correlation of military signals,” IEEE Transactions on Information TheoryAerospace and Electronic Systems, vol. 3949, no. 4, pp. 1121–11322250–2267, Jul. 19932013. [1660] I. SafakaX. Xx, X. Xxx, and X. Xxx, “ECDSA-Based Message Authentication Scheme for BeiDou-II Navigation Satellite System,” IEEE Transactions on Aerospace and Electronic Systems, vol. 55, no. 4, pp. 1666 – 1682, Aug. 2019. [61] X.-X. Kwon and D.-X. Xxxx, “Performance analysis of direct GPS spoofing detection method with ahrs/accelerometer,” Sensors, vol. 20, no. 4, p. 954, 2020. [62] X. Xxxxxxx, X. Xxxxxxxxxxxxx, X. X. XxxxxxxxxxXxxxxxx, and X. Xx Xxxxxx, “Drive me not: GPS spoofing detection via cellular network: (architectures, models, and experiments),” in Proceedings of the 12th Conference on Security and Privacy in Wireless and Mobile Networks, 2019, pp. 12–22 [63] X. Xxxx, X. Xxxxxxx, E. Atsan, C. Fragouli, X. XxxxxxxxXxxx, and X. XxxxxxxXxxxx, “Exchanging Secrets without Using CryptographyGPS Spoofing Detector with Adaptive Trustable Residence Area for Cellular based-UAVs,” arXiv:1105.4991 in Proc. of IEEE Globecom, Dec. 2020. [cs64] 3GPP, math]“Enhanced LTE support for aerial vehicles,” 3rd Generation Partnership Project (3GPP), May 2011Technical report (TR) 36.777, arXiv: 1105.499101 2018. [Online]. Available: xxxx://xxxxx.xxx/abs/1105.4991 xxxxx://xxxxxx.0xxx.xxx/desktopmodules/Specifications/SpecificationDetails.aspx? [1765] I. Safaka, C. FragouliX. Xxxx, X. Xxxxxxx, X. Xxxx, and X. Xxxxx, “Deep Learning for GPS Spoofing Detection in Cellular- Enabled UAV Systems,” in NaNA 2021, Nov. 2021. [66] X. Xxxxxxx and X. Xxxxx, “AI-driven Zero Touch Network and Service Management in 5G and Beyond: Challenges and Research Directions,” IEEE Network Magazine, vol. 34, no. 2, pp. 186 – 194, March/April2020. [67] Xxxx, Xxxxx, et al. Digital Twin Network: Concepts and Reference Architecture. Internet-Draft Draft-Xxxx-Xxxx-Digitaltwin-Network-Concepts-04. Internet Engineering Task Force. Work in Progress. 2021. Available online: xxxxx://xxxxxxxxxxx. ietf. org/doc/html/draft-xxxx-nmrg- digitaltwin-networkconcepts-04 (accessed on 1 September 2021), 2021. [68] TCP STatistic and Analysis Tool tstat software: xxxxx.xxxxxx.xx [69] Xxxxxxxxx, V., Xxxxxx, X.X., Xxxxxxxx, S., Xxxxx, Y., Xxxxxxxxxxxx, X. and Xxxxxxxxxx, G., „A survey on security and privacy of federated learning,” Future Generation Computer Systems, 115, pp.619-640, 2021. [70] Xxx, X., Xxxxx, X.X., Xxxxx, N.C. and Xxxxxx, D., “ Toward smart security enhancement of federated learning networks,” IEEE Network, 35(1), pp.340-347, 2020. [71] X. Xxxxxxxxx, E. M. El Mhamdi, X. Xxxxxxxxx, and X. Xxxxxxx, “Exchanging pairwise secrets efficientlyMachine Learning with Adversaries: Byzantine tolerant Gradient Descent,” in 2013 Proceedings IEEE INFOCOMof the 31st International Conference on Neural Information Processing Systems, Apr. 20132017, pp. 2265–2273.‌ 118–128. [1872] E. AtsanX. Xxxxxxxxx, I. SafakaX. Xxxxxxxxx al., “The Hidden Vulnerability of Distributed Learning in Byzantium,” in International Conference on Machine Learn-ing. PMLR, 2018, pp. 3521–3530. [73] X. Xxx, X. Xxxx, X. Xxxxxx, and X. Xxxxxxxx, “Low cost security for sensor networksXxxxxxxx,“Byzantine-robust Distributed Learning: Towards Optimal Statistical Rates,” in 2013 International Symposium Conference on Network Coding (NetCod)Machine Learning. PMLR, Jun. 20132018, pp. 1–65650–5659. [1974] MNIST database, xxxx://xxxx.xxxxx.xxx/exdb/mnist/ [75] X. Xxxxxxxx, X. Xxxxxxx, X. Xxxxxx, X. Xxxxxxxx, X. Xxxxxxxxx, Xxxxxxx and X. XxxxxxxxxxxXxxxx, “Creating Secrets out of ErasuresZSM Security: Threat Surface and Best Practices,” in IEEE Network Magazine, Vol. 34, No. 3, Jun. 2020, pp. 124 - 133. [76] X. Xxxxxxx and X. Xxxxx, “AI for Beyond 5G Networks: A Cyber-Security Defense or Offense Enabler?” in IEEE Network Magazine, Vol. 34, No. 6, Nov. 2020, pp. 140 - 147. [77] Xxxxxxxxxx, X.X., Xxxxxx, X., and Xxxxxxx, C. Explaining and harnessing adversarial examples. International Conference on Learning Representations, 2015. [78] Xxxxxxx, X., Xxxxxxxxxx, X.X., and Xxxxxx, S. Adversarial examples in the physical world. International Conference on Learning Representations, 2017. [79] Xxxxxxxx, N., XxXxxxxx, P., Xxx, S., Xxxxxxxxxx, M., Xxxxx, Z.B., and Xxxxx, X. The limitations of deep learning in adversarial settings. In Proceedings of the 19th Annual 1st IEEE European Symposium on Security and Privacy, pp. 372– 387, 2016b. [80] xxxxx://xxxxxx.xxx/tensorflow/cleverhans [81] Xxxxxxxx et al. You fool me once, shame on you. You fool me twice, shame on me. A Taxonomy of Attack and Defense Patterns for AI Security. ECIS 2020 Research Papers [82] Wild patterns: Ten years after the rise of adversarial machine learning. Pattern Recognition. 2018;84. doi:10.1016/j.patcog.2018.07.023 [83] Xxxxxxxxxx et al. Making machine learning robust against adversarial inputs. Communications of the ACM. 2018;61(7). doi:10.1145/3134599 [84] Xxxxxx et al. Evasion attacks against machine learning at test time. In: Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8190 LNAI. [85] Xxxxxx et al, Poisoning attacks against support vector machines. In: Proceedings of the 29th International Conference on Mobile Computing & NetworkingMachine Learning, serICML 2012. MobiCom ’13Vol 2. New YorkProceedings of the 29th International Conference on Machine Learning, NY, USA: ACM, 2013, ppICML 2012. 429–440; 2012. [Online]. Available86] Adversarial Robustness Toolbox: xxxx://xxx.xxx.xxx/10.1145/2500423.2500440 [20] X. X. Xxxx and X. Xxxxxxxxxxxx, Convex Optimization. Cambridge University Press, Mar. 2004. [21] X. X. Xxxxxxxxx, X. Xxxxx, and X. X. Xxxxxxxx, Convex Analysis and Optimization. Athena Scientific, 2003. [22] X. Xxxx, X. X. Xxxxxxxxxxx, X. Xxxxxxxx, and X. X. Xxxxxxx, “Secret communication over broadcast erasure channels with state-feedbac,” IEEE Transactions on Information Theory, vol. 61, pp. 4788–4808, Sep. 2015. [23] X. X. XxxXxxxxxxx, The Theory of Error-Correcting Codes, 2nd ed. Amsterdam; New York; New York: North Holland Publishing Co., 1978. [24] C. Fragouli and X. Xxxxxxxx, Network Coding Fundamentals. Hanover, MA: Now Publishers Inc, Jun. 2007.xxxxx://xxxxxx.xxx/Trusted-AI/adversarial-robustness-toolbox

Xxxxxx and X. XxxXxxxxx. Proof-carrying data and hearsay arguments from signature cards. In Inno- vations in Computer Science - ICS, “A unified monotonic approach to generalized linear fractional programming,” Journal of Global Optimizationpages 310–331, vol. 26, no. 3, pp. 229–259, 20032010. [1431] B. Chor, X. Xxxxxxxxxx, X. Xxxxxx, and X. Xxxxxxxx. Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC), pages 383–395, 1985. [32] X. Xxxxx, X. XxxxXxxxxxx, X. Xxxxx, and X. Xxxxx. Round-preserving parallel composition of probabilistic- termination cryptographic protocols. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), pages 37:1–37:15, 2017. [33] X. Xxxxx, X. Xxxxxxx, X. X. Xxxxx, and X. Xxxxx. Probabilistic termination and composability of cryptographic protocols. Journal of Cryptology, “Xxxxx: Achieving global optimality for a non-convex wireless power control problem,” IEEE Transactions on Wireless Communications32(3):690–741, vol. 8, no. 3, pp. 1553–1563, Mar 20092019. [1534] X. Xxxxxxxx and X. Xxxxxxx, “Common randomness in information theory and cryptography - part I: Secret sharing,” IEEE Transactions on Information Theory, vol. 39, no. 4, pp. 1121–1132, Jul. 1993. [16] I. Safaka, X. X. XxxxxxxxxxXxxxx, X. Xxxxxxx, E. AtsanX. Xxxxxxxxxxx, C. FragouliX. Xxxxxx, and X. Xxxxxxxxxxxxx. On the round complexity of randomized Byzantine agreement. In Proceedings of the 33rd International Symposium on Distributed Computing (DISC), pages 12:1–12:17, 2019. [35] X. Xxxxx, X. Xxxxxx, and X. Xxxxxxxxxx. Not a coincidence: Sub-quadratic asynchronous byzantine agreement WHP. CoRR, 2020. URL xxxxx://xxxxx.xxx/abs/2002.06545. [36] X. Xxxxxxx and X. Xxxxx. Constant-round multiparty computation using a black-box pseudorandom generator. In 24th Annual International Cryptology Conference (CRYPTO), pages 378–394, 2005. [37] X. Xxxxxxx and X. Xxxxx. Scalable secure multiparty computation. In 25th Annual International Cryp- tology Conference (CRYPTO), pages 501–520, 2006. [38] X. Xxxxxxx and X. X. Xxxxxxx. Scalable and unconditionally secure multiparty computation. In 26th Annual International Cryptology Conference (CRYPTO), pages 572–590, 2007. [39] X. Xxxxxxx, X. Xxxxx, X. Xxxxxxxxx, X. X. Xxxxxxx, and X. X. Xxxxx. Scalable multiparty compu- tation with nearly optimal work and resilience. In 27th Annual International Cryptology Conference (CRYPTO), pages 241–261, 2008. [40] X. Xxxxxxx, X. Xxxxx, and X. Xxxxxxxxx. Perfectly secure multiparty computation and the computational overhead of cryptography. In 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), pages 445–465, 2010. [41] X. Xxxxxxx, X. Xxxxx, and X. Xxxxx. Secure two-party computation with low communication. In Proceedings of the 9th Theory of Cryptography Conference(TCC), pages 54–74, 2012. [42] X. Xxxx, X. Xxxx, X. Xxxxxxxx, X. Xxxx, and X. Xxxxxx. Secure multi-party computation in large networks. Distributed Computing, 30(3):193–229, 2017. [43] X. Xxxxxxx and X. Xxxxxxx. Threshold cryptosystems. In 8th Annual International Cryptology Confer- ence (CRYPTO), pages 307–315, 1989. [44] X. Xxxxx. The Byzantine generals strike again. X. Xxxxxxxxxx, 3(1):14–30, 1982. [45] X. Xxxxx and X. Xxxxxxxx. Bounds on information exchange for Byzantine agreement. Journal of the ACM, 32(1):191–204, 1985. [46] X. Xxxxx, X. Xxxxx, X. Xxxxxxxxx, and X. Xxxxx. Fault tolerance in networks of bounded degree. SIAM Journal on Computing, 17(5):975–988, 1988. [47] X. X. Xxxxxxx, X. X. Xxxxx, and X. Xxxxxxx. Easy impossibility proofs for distributed consensus prob- lems. Distributed Computing, 1(1):26–39, 1986. [48] X. X. Xxxxx and X. Xxxxx. Fully polynomial Byzantine agreement in t+1 rounds. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC), pages 31–41, 1993. [49] X. X. Xxxxx and X. X. Xxxxxxx. Computers and Intractability: A Guide to the Theory of NP- Completeness. X. X. Xxxxxxx & Co., New York, NY, USA, 1979. ISBN 0716710447. [50] X. Xxxxxxx, X. Xxxxxxx, X. Xxxxxxxx, and X. XxxxxxxXxxxx. Robust threshold DSS signatures. Inf. Comput., “Exchanging Secrets without Using Cryptography,” arXiv:1105.4991 [cs164(1):54–84, math], May 2011, arXiv: 1105.4991. [Online]. Available: xxxx://xxxxx.xxx/abs/1105.4991 [17] I. Safaka, C. Fragouli, X. Xxxxxxxx, and X. Xxxxxxx, “Exchanging pairwise secrets efficiently,” in 2013 Proceedings IEEE INFOCOM, Apr. 2013, pp. 2265–2273.‌ [18] E. Atsan, I. Safaka, X. Xxxxxx, and X. Xxxxxxxx, “Low cost security for sensor networks,” in 2013 International Symposium on Network Coding (NetCod), Jun. 2013, pp. 1–6. [19] X. Xxxxxxxx, X. Xxxxxxx, X. Xxxxxx, X. Xxxxxxxx, X. Xxxxxxxxx, and X. Xxxxxxxxxxx, “Creating Secrets out of Erasures,” in Proceedings of the 19th Annual International Conference on Mobile Computing & Networking, ser. MobiCom ’13. New York, NY, USA: ACM, 2013, pp. 429–440. [Online]. Available: xxxx://xxx.xxx.xxx/10.1145/2500423.2500440 [20] X. X. Xxxx and X. Xxxxxxxxxxxx, Convex Optimization. Cambridge University Press, Mar. 2004. [21] X. X. Xxxxxxxxx, X. Xxxxx, and X. X. Xxxxxxxx, Convex Analysis and Optimization. Athena Scientific, 2003. [22] X. Xxxx, X. X. Xxxxxxxxxxx, X. Xxxxxxxx, and X. X. Xxxxxxx, “Secret communication over broadcast erasure channels with state-feedbac,” IEEE Transactions on Information Theory, vol. 61, pp. 4788–4808, Sep. 2015. [23] X. X. XxxXxxxxxxx, The Theory of Error-Correcting Codes, 2nd ed. Amsterdam; New York; New York: North Holland Publishing Co., 1978. [24] C. Fragouli and X. Xxxxxxxx, Network Coding Fundamentals. Hanover, MA: Now Publishers Inc, Jun. 20072001.