Добірка наукової літератури з теми "Round Complexity"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Round Complexity".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Round Complexity"
Zhang, Feng, Feng Li, and Wenzheng Zhang. "Differential-Linear Cryptanalsis on SIMECK32/64 and SIMON32/64." Journal of Physics: Conference Series 2504, no. 1 (May 1, 2023): 012068. http://dx.doi.org/10.1088/1742-6596/2504/1/012068.
Повний текст джерелаZhang, Kai, Xuejia Lai, Lei Wang, Jie Guan, Bin Hu, Senpeng Wang, and Tairong Shi. "Related-Key Multiple Impossible Differential Cryptanalysis on Full-Round LiCi-2 Designed for IoT." Security and Communication Networks 2022 (May 25, 2022): 1–11. http://dx.doi.org/10.1155/2022/3611840.
Повний текст джерелаGrošek, Otokar, Peter Horák, and Pavol Zajac. "On complexity of round transformations." Discrete Mathematics 309, no. 18 (September 2009): 5527–34. http://dx.doi.org/10.1016/j.disc.2008.03.020.
Повний текст джерелаPandurangan, Gopal, Peter Robinson, and Michele Scquizzato. "On the Distributed Complexity of Large-Scale Graph Computations." ACM Transactions on Parallel Computing 8, no. 2 (June 30, 2021): 1–28. http://dx.doi.org/10.1145/3460900.
Повний текст джерелаXing, Zhaohui, Wenying Zhang, and Guoyong Han. "Improved Conditional Differential Analysis on NLFSR-Based Block Cipher KATAN32 with MILP." Wireless Communications and Mobile Computing 2020 (November 23, 2020): 1–14. http://dx.doi.org/10.1155/2020/8883557.
Повний текст джерелаMagniez, Frédéric, and Ashwin Nayak. "Quantum Distributed Complexity of Set Disjointness on a Line." ACM Transactions on Computation Theory 14, no. 1 (March 31, 2022): 1–22. http://dx.doi.org/10.1145/3512751.
Повний текст джерелаWeng, Tianling, Tingting Cui, Ting Yang, and Yinghua Guo. "Related-Key Differential Attacks on Reduced-Round LBlock." Security and Communication Networks 2022 (September 16, 2022): 1–15. http://dx.doi.org/10.1155/2022/8464960.
Повний текст джерелаKremer, I., N. Nisan, and D. Ron. "On Randomized One-round Communication Complexity." Computational Complexity 8, no. 1 (June 1, 1999): 21–49. http://dx.doi.org/10.1007/s000370050018.
Повний текст джерелаSong, Junghwan, Kwanhyung Lee, and Hwanjin Lee. "Biclique Cryptanalysis on the Full Crypton-256 and mCrypton-128." Journal of Applied Mathematics 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/529736.
Повний текст джерелаLacko-Bartošová, Lucia. "Linear and differential cryptanalysis of reduced-round AES." Tatra Mountains Mathematical Publications 50, no. 1 (December 1, 2011): 51–61. http://dx.doi.org/10.2478/v10127-011-0036-y.
Повний текст джерелаДисертації з теми "Round Complexity"
Ravi, Divya. "On the Round Complexity Landscape of Secure Multi-party Computation." Thesis, 2020. https://etd.iisc.ac.in/handle/2005/4809.
Повний текст джерелаLin, Kun-Xuan, and 林琨絢. "Low Complexity Packet Scheduling Algorithm: Adaptive Fair Queuing with Round-Robin." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/58810698448679516700.
Повний текст джерела國立雲林科技大學
電子與資訊工程研究所
94
The rapid growths of Internet bandwidth and Internet user have increased the complexity of network management. At the same time the contents of transmission in Internet trends to be pluralistic. It is not enough of only relying on the original best-effort IP protocol to support the required quality of service (QoS) for each application. In order to offer steady communication environment and QoS, the moderately bandwidth management is considered in network design. In general, the network bandwidth management can be classified into two parts of packet buffer management and packet scheduling. In this thesis, we target on the design of packet scheduling for the network bandwidth management and propose an Adaptive Fair Queuing with Round Robin (AFQRR) scheme. Based on Round Robin technique, the AFQRR has the properties of lower complexity and higher accuracy. According to the assigning weight of flows, the AFQRR can fairly to allocate the corresponding bandwidth for each flow. In the part of complexity, the computation of both the amount of allowing transmission for each flow and the next transmission flow selection are all of O(1). With the NS2 simulation tool, the simulation results reveal that the AFQRR scheduling algorithm has a better performance in the part of fair bandwidth allocation and of packet delay.
FRIOLO, DANIELE. "New perspectives in multi-party computation: low round complexity from new assumptions, financial fairness and public verifiability." Doctoral thesis, 2021. http://hdl.handle.net/11573/1566920.
Повний текст джерелаLapointe, Rébecca. "Complexité de la communication sur un canal avec délai." Thèse, 2014. http://hdl.handle.net/1866/10686.
Повний текст джерелаWe introduce a new communication complexity model in which we want to determine how much time of communication is needed by two players in order to execute arbitrary tasks on a channel with delay d. We establish a few basic lower and upper bounds and compare this new model to existing models such as the classical and quantum two-party models of communication. We show that the standard communication complexity of a function, modulo a factor of d/ lg d, constitutes an upper bound to its communication complexity on a delayed channel. We introduce a few examples on which a clever strategy depending on the delay procures a significant advantage over the naïve implementation of an optimal communication protocol. We then show that a delayed channel can be used to implement a cryptographic bit swap, but is insufficient on its own to implement an oblivious transfer scheme.
Книги з теми "Round Complexity"
Round Table on Law and Semiotics (6th 1992 Penn State University--Berks). Flux, complexity, and illusion: Sixth Round Table on Law and Semiotics. New York: P. Lang, 1993.
Знайти повний текст джерелаCole, Richard. The APRAM -- the rounds complexity measure and the explicit costs of synchronization. New York: Courant Institute of Mathematical Sciences, New York University, 1991.
Знайти повний текст джерелаFlux, Complexity, and Illusion: Sixth Round Table on Law and Semiotics (Semiotics and the Human Sciences). Peter Lang Publishing, 1993.
Знайти повний текст джерелаvan Es, Bart. 5. Character. Oxford University Press, 2016. http://dx.doi.org/10.1093/actrade/9780198723356.003.0006.
Повний текст джерелаZajicek, Ofer, and Richard Cole. APRAM -- the Rounds Complexity Measure and the Explicit Costs of Synchronization. Creative Media Partners, LLC, 2018.
Знайти повний текст джерелаMarat, Erica. The Politics of Police Reform. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190861490.001.0001.
Повний текст джерелаJohansen, Bruce, and Adebowale Akande, eds. Nationalism: Past as Prologue. Nova Science Publishers, Inc., 2021. http://dx.doi.org/10.52305/aief3847.
Повний текст джерелаЧастини книг з теми "Round Complexity"
Farley, Thomas. "Unraveling the Complexity of Market Structure." In Equity Trading Round-Up, 117–30. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51015-2_8.
Повний текст джерелаGarg, Sanjam, Pratyay Mukherjee, Omkant Pandey, and Antigoni Polychroniadou. "The Exact Round Complexity of Secure Computation." In Advances in Cryptology – EUROCRYPT 2016, 448–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49896-5_16.
Повний текст джерелаCohen, Tzafrir, Joe Kilian, and Erez Petrank. "Responsive Round Complexity and Concurrent Zero-Knowledge." In Advances in Cryptology — ASIACRYPT 2001, 422–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45682-1_25.
Повний текст джерелаChardouvelis, Orestis, and Giulio Malavolta. "The Round Complexity of Quantum Zero-Knowledge." In Theory of Cryptography, 121–48. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-90459-3_5.
Повний текст джерелаGarg, Sanjam, Mohammad Mahmoody, Daniel Masny, and Izaak Meckler. "On the Round Complexity of OT Extension." In Lecture Notes in Computer Science, 545–74. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96878-0_19.
Повний текст джерелаKublenz, Simeon, Sebastian Siebertz, and Alexandre Vigny. "Constant Round Distributed Domination on Graph Classes with Bounded Expansion." In Structural Information and Communication Complexity, 334–51. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79527-6_19.
Повний текст джерелаPatra, Arpita, Ashish Choudhary, Tal Rabin, and C. Pandu Rangan. "The Round Complexity of Verifiable Secret Sharing Revisited." In Advances in Cryptology - CRYPTO 2009, 487–504. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03356-8_29.
Повний текст джерелаChoudhury, Ashish, Kaoru Kurosawa, and Arpita Patra. "The Round Complexity of Perfectly Secure General VSS." In Lecture Notes in Computer Science, 143–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20728-0_14.
Повний текст джерелаKiayias, Aggelos, and Serdar Pehlivanoglu. "Improving the Round Complexity of Traitor Tracing Schemes." In Applied Cryptography and Network Security, 273–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13708-2_17.
Повний текст джерелаKozachinskiy, Alexander. "Making Randomness Public in Unbounded-Round Information Complexity." In Lecture Notes in Computer Science, 296–309. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-20297-6_19.
Повний текст джерелаТези доповідей конференцій з теми "Round Complexity"
Patt-Shamir, Boaz, and Marat Teplitsky. "The round complexity of distributed sorting." In the 30th annual ACM SIGACT-SIGOPS symposium. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1993806.1993851.
Повний текст джерелаBeaver, D., S. Micali, and P. Rogaway. "The round complexity of secure protocols." In the twenty-second annual ACM symposium. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/100216.100287.
Повний текст джерелаKremer, Ilan, Noam Nisan, and Dana Ron. "On randomized one-round communication complexity." In the twenty-seventh annual ACM symposium. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/225058.225277.
Повний текст джерелаGoyal, Vipul, and Abhishek Jain. "On the round complexity of covert computation." In the 42nd ACM symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1806689.1806717.
Повний текст джерелаSanghvi, Saurabh, and Salil Vadhan. "The round complexity of two-party random selection." In the thirty-seventh annual ACM symposium. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1060590.1060641.
Повний текст джерелаGanesh, Chaya, and Arpita Patra. "Broadcast Extensions with Optimal Communication and Round Complexity." In PODC '16: ACM Symposium on Principles of Distributed Computing. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2933057.2933082.
Повний текст джерелаApplebaum, Benny, Eliran Kachlon, and Arpita Patra. "The Round Complexity of Statistical MPC with Optimal Resiliency." In STOC '23: 55th Annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3564246.3585228.
Повний текст джерелаGaray, Juan A., Jonathan Katz, Chiu-Yuen Koo, and Rafail Ostrovsky. "Round Complexity of Authenticated Broadcast with a Dishonest Majority." In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE, 2007. http://dx.doi.org/10.1109/focs.2007.4389534.
Повний текст джерелаGaray, Juan A., Jonathan Katz, Chiu-Yuen Koo, and Rafail Ostrovsky. "Round Complexity of Authenticated Broadcast with a Dishonest Majority." In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE, 2007. http://dx.doi.org/10.1109/focs.2007.44.
Повний текст джерелаIto, Tsuyoshi, Hirotada Kobayashi, and Keiji Matsumoto. "Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies." In 2009 24th Annual IEEE Conference on Computational Complexity (CCC). IEEE, 2009. http://dx.doi.org/10.1109/ccc.2009.22.
Повний текст джерелаЗвіти організацій з теми "Round Complexity"
Eiber. L51786 Development of Optimized Nondestructive Inspection Methods for Hot Tap Branch Connection Welds. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), January 1998. http://dx.doi.org/10.55274/r0010388.
Повний текст джерелаLeis, Brian, and Xian-Kui Zhu. PR-003-063509-R01 Models for Predicting Delayed Fatigue Failure of Pipelines at Mechanical Damage. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), May 2018. http://dx.doi.org/10.55274/r0011489.
Повний текст джерела