Gotowa bibliografia na temat „Round Complexity”

Abstract In this paper, we give differential-linear cryptanalysis of SIMON, which is a family of lightweight block ciphers published by the National Security Agency, and SIMECK, which is a family of lightweight block ciphers proposed by Yang et al. Firstly, all input difference and output masks with one active bit are traversed to obtain a 9-round SIMON32/64 differential-linear distinguisher and a 10-round SIMECK32/64 differential-linear distinguisher. Then, a 12-round SIMON32/64 differential-linear distinguisher with bias 2−12.69 and a 13-round SIMECK32/64 differential-linear distinguisher with bias 2−14.03 can be obtained by searching one round of differential characteristics forward and two rounds of linear approximations backward. The dynamic key guessing technique proposed by Wang et al. has excellent advantages in the SIMON-like cipher key recovery process. Therefore, we have applied it to differential-linear cryptanalysis. Then, the 12-round SIMON32/64 differential-linear distinguisher is extended forward by four rounds and backward by four rounds to attack the 20-round SIMON32/64 with time complexity 255.68 and data complexity 228. And the 13-round SIMECk32/64 differential-linear distinguisher is extended forward by four rounds and backward by four rounds to attack the 21-round SIMECK32/64 with time complexity 250.67 and data complexity 230. These are the best differential-linear cryptanalysis results for SIMON32/64 and SIMECK32/64 in the open literature.

LiCi-2 is an ultralightweight block cipher designed for constrained IoT devices. It is a successor of LiCi and has even better performance in both software and hardware implementation. In this paper, based on the idea of related-key multiple impossible differential cryptanalysis, a key recovery attack on full-round LiCi-2 is proposed. First, an interesting property is revealed that, with a single bit difference in the related key, a 10-round differential character with probability of 1 exists on LiCi-2. With an automatic approach, the boundaries of impossible differential distinguishers in terms of single-key setting and related-key setting are explored. Under our construction method, the longest length is 8 rounds for single-key setting and 18 rounds for related-key setting. Finally, based on these 18-round distinguishers, a 25-round key recovery attack is proposed with adding 3 rounds before and 4 rounds after the distinguisher. Our attack needs one related key. The time complexity for our attack is O(2123.44), the memory complexity is O(294), and the data complexity is O(260.68). As far as we know, no full-round attack has previously been reported on LiCi-2.

Motivated by the increasing need to understand the distributed algorithmic foundations of large-scale graph computations, we study some fundamental graph problems in a message-passing model for distributed computing where k ≥ 2 machines jointly perform computations on graphs with n nodes (typically, n >> k). The input graph is assumed to be initially randomly partitioned among the k machines, a common implementation in many real-world systems. Communication is point-to-point, and the goal is to minimize the number of communication rounds of the computation. Our main contribution is the General Lower Bound Theorem , a theorem that can be used to show non-trivial lower bounds on the round complexity of distributed large-scale data computations. This result is established via an information-theoretic approach that relates the round complexity to the minimal amount of information required by machines to solve the problem. Our approach is generic, and this theorem can be used in a “cookbook” fashion to show distributed lower bounds for several problems, including non-graph problems. We present two applications by showing (almost) tight lower bounds on the round complexity of two fundamental graph problems, namely, PageRank computation and triangle enumeration . These applications show that our approach can yield lower bounds for problems where the application of communication complexity techniques seems not obvious or gives weak bounds, including and especially under a stochastic partition of the input. We then present distributed algorithms for PageRank and triangle enumeration with a round complexity that (almost) matches the respective lower bounds; these algorithms exhibit a round complexity that scales superlinearly in k , improving significantly over previous results [Klauck et al., SODA 2015]. Specifically, we show the following results: PageRank: We show a lower bound of Ὼ(n/k 2 ) rounds and present a distributed algorithm that computes an approximation of the PageRank of all the nodes of a graph in Õ(n/k 2 ) rounds. Triangle enumeration: We show that there exist graphs with m edges where any distributed algorithm requires Ὼ(m/k 5/3 ) rounds. This result also implies the first non-trivial lower bound of Ὼ(n 1/3 ) rounds for the congested clique model, which is tight up to logarithmic factors. We then present a distributed algorithm that enumerates all the triangles of a graph in Õ(m/k 5/3 + n/k 4/3 ) rounds.

In this paper, a new method for constructing a Mixed Integer Linear Programming (MILP) model on conditional differential cryptanalysis of the nonlinear feedback shift register- (NLFSR-) based block ciphers is proposed, and an approach to detecting the bit with a strongly biased difference is provided. The model is successfully applied to the block cipher KATAN32 in the single-key scenario, resulting in practical key-recovery attacks covering more rounds than the previous. In particular, we present two distinguishers for 79 and 81 out of 254 rounds of KATAN32. Based on the 81-round distinguisher, we recover 11 equivalent key bits of 98-round KATAN32 and 13 equivalent key bits of 99-round KATAN32. The time complexity is less than 2 31 encryptions of 98-round KATAN32 and less than 2 33 encryptions of 99-round KATAN32, respectively. Thus far, our results are the best known practical key-recovery attacks for the round-reduced variants of KATAN32 regarding the number of rounds and the time complexity. All the results are verified experimentally.

Given \( x,y\in \lbrace 0,1\rbrace ^n \) , Set Disjointness consists in deciding whether \( x_i=y_i=1 \) for some index \( i \in [n] \) . We study the problem of computing this function in a distributed computing scenario in which the inputs \( x \) and \( y \) are given to the processors at the two extremities of a path of length \( d \) . Each vertex of the path has a quantum processor that can communicate with each of its neighbours by exchanging \( \operatorname{O}(\log n) \) qubits per round. We are interested in the number of rounds required for computing Set Disjointness with constant probability bounded away from \( 1/2 \) . We call this problem “Set Disjointness on a Line”. Set Disjointness on a Line was introduced by Le Gall and Magniez [ 14 ] for proving lower bounds on the quantum distributed complexity of computing the diameter of an arbitrary network in the CONGEST model. However, they were only able to provide a lower bound when the local memory used by the processors on the intermediate vertices of the path is severely limited. More precisely, their bound applies only when the local memory of each intermediate processor consists of \( \operatorname{O}(\log n) \) qubits. In this work, we prove an unconditional lower bound of \( \widetilde{\Omega }\big (\sqrt [3]{n d^2}+\sqrt {n} \, \big) \) rounds for Set Disjointness on a Line with \( d + 1 \) processors. This is the first non-trivial lower bound when there is no restriction on the memory used by the processors. The result gives us a new lower bound of \( \widetilde{\Omega } \big (\sqrt [3]{n\delta ^2}+\sqrt {n} \, \big) \) on the number of rounds required for computing the diameter \( \delta \) of any \( n \) -node network with quantum messages of size \( \operatorname{O}(\log n) \) in the CONGEST model. We draw a connection between the distributed computing scenario above and a new model of query complexity. In this model, an algorithm computing a bi-variate function \( f \) (such as Set Disjointness) has access to the inputs \( x \) and \( y \) through two separate oracles \( {\mathcal {O}}_x \) and \( {\mathcal {O}}_y \) , respectively. The restriction is that the algorithm is required to alternately make \( d \) queries to \( {\mathcal {O}}_x \) and \( d \) queries to \( {\mathcal {O}}_y \) , with input-independent computation in between queries. The model reflects a “switching delay” of \( d \) queries between a “round” of queries to \( x \) and the following “round” of queries to \( y \) . The information-theoretic technique we use for deriving the round lower bound for Set Disjointness on a Line also applies to the number of rounds in this query model. We provide an algorithm for Set Disjointness in this query model with round complexity that matches the round lower bound stated above, up to a polylogarithmic factor. This presents a barrier for obtaining a better round lower bound for Set Disjointness on the Line. At the same time, it hints at the possibility of better communication protocols for the problem.

LBlock, as one of the typical lightweight encryption schemes, is a 32-round block cipher with 64 bit block and 80 bit master key. It can be widely applied in the IoT environment because of its friendly software and hardware implementations. Since it came out, it has encountered many attacks. In this paper, we evaluate LBlock’s ability against related-key differential attack more accurately based on SMT method. On the one hand, we propose tighter lower bounds on the minimal number of active S-boxes for up to 19 rounds of LBlock, which are 8 more rounds than previous ones. Then, we propose the upper bounds of total probabilities for up to 19 rounds of LBlock for the first time. On the other hand, with a suitable 17-round related-key differential distinguisher, we propose attacks on 22- and 23-round LBlock. Each of these attacks has lower time complexity and data complexity than previous ones for the same rounds of LBlock.

Biclique cryptanalysis is an attack which reduces the computational complexity by finding a biclique which is a kind of bipartite graph. We show a single-key full-round attack of the Crypton-256 and mCrypton-128 by using biclique cryptanalysis. In this paper, 4-round bicliques are constructed for Crypton-256 and mCrypton-128. And these bicliques are used to recover master key for the full rounds of Crypton-256 and mCrypton-128 with the computational complexities of 2253.78and 2126.5, respectively. This is the first known single-key full-round attack on the Crypton-256. And our result on the mCrypton-128 has superiority over known result of biclique cryptanalysis on the mCrypton-128 which constructs 3-round bicliques in terms of computational time complexity.

ABSTRACT The subject of this paper is linear and differential cryptanalysis of two rounds of the Advanced Encryption Standard (AES) with estimation of com- plexity for three-round AES attack. Presented linear attack is based on finding highly probable linear expressions and presented differential attack is based on finding specific bitwise differences. Data complexity of described linear and diffe- rential attack is 228 and 227, respectively, where 8 bits of subkey are recovered. Minimal complexity of linear attack on three-round AES is bigger than d × 260, where d is a small constant.

In secure multi-party computation (MPC), n parties wish to jointly perform a computation on their private inputs in a secure way, so that no adversary corrupting a subset of the parties can learn more information than their outputs (privacy), nor can they affect the outputs of the computation other than by choosing their own inputs (correctness). The round complexity of MPC protocols is a fundamental question in the area of secure computation and its study constitutes a phenomenal body of work in the MPC literature. The research goal of this thesis is to advance the state of the art by expanding this study of round complexity to various adversarial settings and network models. Following are the main contributions of this thesis organized into three broad categories: (1) MPC for small population- We begin with the study of round-optimal (more generally, round-efficient) MPC protocols for small population, namely involving 3 (3PC) and 4 (4PC) parties tolerating single active corruption (honest majority). On the theoretical side, we settle the exact round complexity of 3PC in honest-majority setting, for a range of security notions such as selective abort (adversary can selectively deprive some honest parties of the output), unanimous abort (either all or none of the honest parties get the output), fairness (adversary gets output only if honest parties do) and guaranteed output delivery (adversary cannot prevent honest parties from obtaining the output). On the practical side, we present efficient, constant-round 3PC and 4PC protocols with fairness and guaranteed output delivery; suitable for high-latency networks such as the Internet. This work is based on [1, 2]. (2) Beyond Traditional Adversaries - We extend the study of round complexity beyond the traditional adversarial settings. First, we overcome the demarcation of study of round complexity of MPC based on resilience (i.e. honest majority or dishonest majority settings) and investigate an interesting class of protocols called the Best-of-both-Worlds (BoBW) MPC which simultaneously achieve fairness / guaranteed output delivery in honest majority and unanimous abort in dishonest majority. We nearly settle the question of exact round complexity of BoBW protocols for several popular setups of MPC such as the plain model, public setup and private setup. This work is based on [3]. Second, we overcome the demarcation of study of round complexity of MPC based on single type of corruption i.e. either purely passive (adversary follows the protocol steps but tries to learn more information) or active (adversary is allowed to deviate from the protocol in any arbitrary way). We consider a generalized adversarial setting where the adversary can simultaneously perform both kinds of corruptions. We settle the question of exact round complexity of MPC protocols achieving fairness and guaranteed output delivery against two such generalized and powerful adversaries called the dynamic and boundary adversaries; in the public setup model. These results appear in [4]. (3) Power of Hybrid Networks - A popular categorization of study of MPC based on network is the synchronous and asynchronous setting. On one hand, asynchronous networks (channels are allowed to have arbitrary delays) are more realistic but on the other, synchronous protocols (channels have bounded delay) are known to have better fault tolerance and properties compared to their asynchronous counterparts. With the goal of combining their best features, we explore hybrid networks that is asynchronous in nature and yet supports a few synchronous rounds at the onset of a protocol execution. We address fundamental questions that throw light on the minimal synchrony assumption needed (in terms of the number of initial synchronous rounds in the hybrid network) to achieve the properties of the fully synchronous protocols. We bridge the existing theoretical feasibility gap between perfectly-secure (tolerate unbounded adversaries with no error) synchronous and asynchronous VSS and MPC protocols; where verifiable secret sharing (VSS) constitutes a fundamental building block of MPC. These results appear in [5]. References: [1] Arpita Patra and Divya Ravi. On the exact round complexity of secure three-party computation. In CRYPTO, 2018. [2] Megha Byali, Arun Joseph, Arpita Patra, and Divya Ravi. Fast secure computation for small population over the internet. In ACM Conference of Computer and Communications Security (CCS), 2018. [3] Arpita Patra, Divya Ravi and Swati Singla. On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation. In ASIACRYPT, 2020. [4] Arpita Patra and Divya Ravi. Beyond honest majority: The round complexity of fair and robust multi-party computation. In ASIACRYPT, 2019. [5] Arpita Patra and Divya Ravi. On the power of hybrid networks in multi-party computation. IEEE Trans. Inf. Theory, 64(6):4207–4227, 2018.

碩士
國立雲林科技大學
電子與資訊工程研究所
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.

Research in Multi-Party Computation is constantly evolving over the years. Starting from the very first result by Yao in 1982, to serve new and more practical scenarios, a lot of different protocols with stronger security properties have been introduced and proven for several assumptions. For some functionalities, properties like public verifiability, fairness and round-optimality can be considered nowadays a minimal set of assumption to consider an MPC protocol practical. Asynchrony, in the sense that different parties should be able to join a protocol at different times, is fundamental for applications like decentralized lotteries, where the protocol execution can last even days. In such case, due to the involvement of monetary payments, parties must also be aware of what happens to their pockets when such protocols are run. In particular, they must be sure that the execution of a certain class of protocols is financially sustainable. We list below our three contributions to the thesis. We firstly introduce a new theoretical result, showing how to achieve low round MPC from new assumptions. In particular, we show how to construct maliciously secure oblivious transfer (M-OT) from a mild strengthening of key agreement (KA) which we call strongly uniform KA (SU-KA), where the latter roughly means that the messages sent by one party are computationally close to uniform, even if the other party is malicious. Our transformation is black-box, almost round preserving (adding only a constant overhead of two rounds), and achieves standard simulation-based security in the plain model. As we show, 2-round SU-KA can be realized from cryptographic assumptions such as low-noise LPN, high-noise LWE, Subset Sum, DDH, CDH and RSA---all with polynomial hardness---thus yielding a black-box construction of fully-simulatable, round-optimal, M-OT from the same set of assumptions (some of which were not known before). By invoking a recent result of Benhamouda and Lin (EUROCRYPT 2017), we also obtain (non-black-box) 5-round maliciously secure MPC in the plain model, from the same assumptions. Our second and third contributions are focused on the concrete application of MPC protocols achieving the aforementioned properties in real-world scenarios. In applications like decentralized lotteries, decentralized payment mechanisms like blockchains relying on smart contracts can be considered a powerful tool to enforce the correct behavior of cheating players with the aid of monetary incentives or punishments. In fact, a weaker version of fairness called fairness with penalties, firstly introduced in the lottery protocol of Andrychowicz et al. (S&P '14) and then formally defined by Bentov et al. (CRYPTO'14), can be used to ensure that corrupted players are incentivized to reveal the output to honest players. This can be done successfully through Bitcoin scripts or Ethereum smart contracts. In our second contribution, we consider executions of smart contracts on forking blockchains (e.g., Ethereum) and study security and delay issues due to forks. As security notion for modeling executions of smart contracts, we focus on MPC. In particular, we consider on-chain MPC executions with the aid of smart contracts. The classical double-spending problem tells us that messages of the MPC protocol should be confirmed on-chain before playing the next ones, thus slowing down the entire execution. This contribution consists of two results: - For the concrete case of fairly tossing multiple coins with penalties, we notice that the lottery protocol of Andrychowicz et al. becomes insecure if players do not wait for the confirmations of several transactions. In addition, we present a smart contract that instead retains security even when all honest players immediately answer to transactions appearing on-chain. We analyze the performance using Ethereum as testbed. - We design a compiler that takes any "digital and universally composable'' MPC protocol (with or without honest majority), and transforms it into another one (for the same task and same setup) which maintains security even if all messages are played on-chain without delays. The special requirements on the starting protocol mean that messages consists only of bits (e.g., no hardware token is sent) and security holds also in the presence of other protocols. We further show that our compiler satisfies fairness with penalties as long as honest players only wait for confirmations once. By reducing the number of confirmations, our protocols can be significantly faster than natural constructions, maintaining at the same time public verifiability, asynchrony (obtained by making the parties posting messages to the blockchain via smart contracts), and fairness with penalties. As a third contribution, we survey the state-of-the-art blockchain based penalty protocols (i.e achieving fairness with penalties) and pioneer another type of fairness, financial fairness, that is closer to the real-world valuation of financial transactions. Intuitively, a penalty protocol is financially fair if the net present cost of participation of honest parties--- i.e., the difference between the total value of cash inflows and the total value of cash outflows at the end of the protocol, weighted by the relative discount rate---is the same, even when some parties cheat. Then, we show that the ladder protocol (CRYPTO'14), and its variants (CCS'15 and CCS'16), fail to achieve financial fairness both in theory and in practice, while the penalty protocols of Kumaresan and Bentov (CCS'14) and Baum, David and Dowsley (FC'20) are financially fair. Moreover, it can be inferred that the fair with penalties extension of the generic compiler presented in our second contribution, based on CCS'14, is financially fair. Hence, our compiler is also financially sustainable.

Nous introduisons un nouveau modèle de la communication à deux parties dans lequel nous nous intéressons au temps que prennent deux participants à effectuer une tâche à travers un canal avec délai d. Nous établissons quelques bornes supérieures et inférieures et comparons ce nouveau modèle aux modèles de communication classiques et quantiques étudiés dans la littérature. Nous montrons que la complexité de la communication d’une fonction sur un canal avec délai est bornée supérieurement par sa complexité de la communication modulo un facteur multiplicatif d/ lg d. Nous présentons ensuite quelques exemples de fonctions pour lesquelles une stratégie astucieuse se servant du temps mort confère un avantage sur une implémentation naïve d’un protocole de communication optimal en terme de complexité de la communication. Finalement, nous montrons qu’un canal avec délai permet de réaliser un échange de bit cryptographique, mais que, par lui-même, est insuffisant pour réaliser la primitive cryptographique de transfert équivoque.
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.

In his 1927 study, Aspects of the Novel, E.M. Forster divided characters into two categories: ‘flat’ and ‘round’. Shakespeare’s ability to create distinct, memorable characters has long been singled out for praise. Shakespeare’s most memorable creations—such as Bottom, Falstaff, and Malvolio—tend to have a complicating element of sadness, which can knock comedy off course: there is always an element of unease. How does Shakespeare combine complexity with laughter? And make pathos compatible with farce? One answer is that his characters are shape-shifters. Shakespeare adapts their level of self-awareness to the moment so that, dependant on the requirements of the drama, they can be both ‘flat’ and ‘round’.

What does it take to reform a post-Soviet police force? Across the region, the countries inherited remarkably similar police forces with identical structures, chains of command, and politicized relationships with the political elite. Centralized in control but decentralized in their reach, the police remain one of the least reformed post-communist institutions. As a powerful state organ, the Soviet-style militarized police have resisted change despite democratic transformations in the overall political context, including rounds of competitive elections and growing civil society. This book explores the conditions in which a meaningful transformation of the police is likely to succeed and when it will fail. Based on the analysis of five post-Soviet countries (Ukraine, Georgia, Kyrgyzstan, Kazakhstan, and Tajikistan) that have officially embarked on police reform efforts, the book examines various pathways to transforming how the state relates to society through policing. It develops a new understanding of both police and police reform. Departing from the conventional interpretation of the police as merely an institution of coercion, this study defines it as a medium for state-society consensus on the limits of the state’s legitimate use of violence. Police are, according to a common Russian saying, a “mirror of society”—serving as a counterweight to its complexity. Police reform, in turn, is a process of consensus-building on the rationale of the use of violence through discussions, debates, media, and advocacy.

Nationalism: Past as Prologue began as a single volume being compiled by Ad Akande, a scholar from South Africa, who proposed it to me as co-author about two years ago. The original idea was to examine how the damaging roots of nationalism have been corroding political systems around the world, and creating dangerous obstacles for necessary international cooperation. Since I (Bruce E. Johansen) has written profusely about climate change (global warming, a.k.a. infrared forcing), I suggested a concerted effort in that direction. This is a worldwide existential threat that affects every living thing on Earth. It often compounds upon itself, so delays in reducing emissions of fossil fuels are shortening the amount of time remaining to eliminate the use of fossil fuels to preserve a livable planet. Nationalism often impedes solutions to this problem (among many others), as nations place their singular needs above the common good. Our initial proposal got around, and abstracts on many subjects arrived. Within a few weeks, we had enough good material for a 100,000-word book. The book then fattened to two moderate volumes and then to four two very hefty tomes. We tried several different titles as good submissions swelled. We also discovered that our best contributors were experts in their fields, which ranged the world. We settled on three stand-alone books:” 1/ nationalism and racial justice. Our first volume grew as the growth of Black Lives Matter following the brutal killing of George Floyd ignited protests over police brutality and other issues during 2020, following the police assassination of Floyd in Minneapolis. It is estimated that more people took part in protests of police brutality during the summer of 2020 than any other series of marches in United States history. This includes upheavals during the 1960s over racial issues and against the war in Southeast Asia (notably Vietnam). We choose a volume on racism because it is one of nationalism’s main motive forces. This volume provides a worldwide array of work on nationalism’s growth in various countries, usually by authors residing in them, or in the United States with ethnic ties to the nation being examined, often recent immigrants to the United States from them. Our roster of contributors comprises a small United Nations of insightful, well-written research and commentary from Indonesia, New Zealand, Australia, China, India, South Africa, France, Portugal, Estonia, Hungary, Russia, Poland, Kazakhstan, Georgia, and the United States. Volume 2 (this one) describes and analyzes nationalism, by country, around the world, except for the United States; and 3/material directly related to President Donald Trump, and the United States. The first volume is under consideration at the Texas A & M University Press. The other two are under contract to Nova Science Publishers (which includes social sciences). These three volumes may be used individually or as a set. Environmental material is taken up in appropriate places in each of the three books. * * * * * What became the United States of America has been strongly nationalist since the English of present-day Massachusetts and Jamestown first hit North America’s eastern shores. The country propelled itself across North America with the self-serving ideology of “manifest destiny” for four centuries before Donald Trump came along. Anyone who believes that a Trumpian affection for deportation of “illegals” is a new thing ought to take a look at immigration and deportation statistics in Adam Goodman’s The Deportation Machine: America’s Long History of Deporting Immigrants (Princeton University Press, 2020). Between 1920 and 2018, the United States deported 56.3 million people, compared with 51.7 million who were granted legal immigration status during the same dates. Nearly nine of ten deportees were Mexican (Nolan, 2020, 83). This kind of nationalism, has become an assassin of democracy as well as an impediment to solving global problems. Paul Krugman wrote in the New York Times (2019:A-25): that “In their 2018 book, How Democracies Die, the political scientists Steven Levitsky and Daniel Ziblatt documented how this process has played out in many countries, from Vladimir Putin’s Russia, to Recep Erdogan’s Turkey, to Viktor Orban’s Hungary. Add to these India’s Narendra Modi, China’s Xi Jinping, and the United States’ Donald Trump, among others. Bit by bit, the guardrails of democracy have been torn down, as institutions meant to serve the public became tools of ruling parties and self-serving ideologies, weaponized to punish and intimidate opposition parties’ opponents. On paper, these countries are still democracies; in practice, they have become one-party regimes….And it’s happening here [the United States] as we speak. If you are not worried about the future of American democracy, you aren’t paying attention” (Krugmam, 2019, A-25). We are reminded continuously that the late Carl Sagan, one of our most insightful scientific public intellectuals, had an interesting theory about highly developed civilizations. Given the number of stars and planets that must exist in the vast reaches of the universe, he said, there must be other highly developed and organized forms of life. Distance may keep us from making physical contact, but Sagan said that another reason we may never be on speaking terms with another intelligent race is (judging from our own example) could be their penchant for destroying themselves in relatively short order after reaching technological complexity. This book’s chapters, introduction, and conclusion examine the worldwide rise of partisan nationalism and the damage it has wrought on the worldwide pursuit of solutions for issues requiring worldwide scope, such scientific co-operation public health and others, mixing analysis of both. We use both historical description and analysis. This analysis concludes with a description of why we must avoid the isolating nature of nationalism that isolates people and encourages separation if we are to deal with issues of world-wide concern, and to maintain a sustainable, survivable Earth, placing the dominant political movement of our time against the Earth’s existential crises. Our contributors, all experts in their fields, each have assumed responsibility for a country, or two if they are related. This work entwines themes of worldwide concern with the political growth of nationalism because leaders with such a worldview are disinclined to co-operate internationally at a time when nations must find ways to solve common problems, such as the climate crisis. Inability to cooperate at this stage may doom everyone, eventually, to an overheated, stormy future plagued by droughts and deluges portending shortages of food and other essential commodities, meanwhile destroying large coastal urban areas because of rising sea levels. Future historians may look back at our time and wonder why as well as how our world succumbed to isolating nationalism at a time when time was so short for cooperative intervention which is crucial for survival of a sustainable earth. Pride in language and culture is salubrious to individuals’ sense of history and identity. Excess nationalism that prevents international co-operation on harmful worldwide maladies is quite another. As Pope Francis has pointed out: For all of our connectivity due to expansion of social media, ability to communicate can breed contempt as well as mutual trust. “For all our hyper-connectivity,” said Francis, “We witnessed a fragmentation that made it more difficult to resolve problems that affect us all” (Horowitz, 2020, A-12). The pope’s encyclical, titled “Brothers All,” also said: “The forces of myopic, extremist, resentful, and aggressive nationalism are on the rise.” The pope’s document also advocates support for migrants, as well as resistance to nationalist and tribal populism. Francis broadened his critique to the role of market capitalism, as well as nationalism has failed the peoples of the world when they need co-operation and solidarity in the face of the world-wide corona virus pandemic. Humankind needs to unite into “a new sense of the human family [Fratelli Tutti, “Brothers All”], that rejects war at all costs” (Pope, 2020, 6-A). Our journey takes us first to Russia, with the able eye and honed expertise of Richard D. Anderson, Jr. who teaches as UCLA and publishes on the subject of his chapter: “Putin, Russian identity, and Russia’s conduct at home and abroad.” Readers should find Dr. Anderson’s analysis fascinating because Vladimir Putin, the singular leader of Russian foreign and domestic policy these days (and perhaps for the rest of his life, given how malleable Russia’s Constitution has become) may be a short man physically, but has high ambitions. One of these involves restoring the old Russian (and Soviet) empire, which would involve re-subjugating a number of nations that broke off as the old order dissolved about 30 years ago. President (shall we say czar?) Putin also has international ambitions, notably by destabilizing the United States, where election meddling has become a specialty. The sight of Putin and U.S. president Donald Trump, two very rich men (Putin $70-$200 billion; Trump $2.5 billion), nuzzling in friendship would probably set Thomas Jefferson and Vladimir Lenin spinning in their graves. The road of history can take some unanticipated twists and turns. Consider Poland, from which we have an expert native analysis in chapter 2, Bartosz Hlebowicz, who is a Polish anthropologist and journalist. His piece is titled “Lawless and Unjust: How to Quickly Make Your Own Country a Puppet State Run by a Group of Hoodlums – the Hopeless Case of Poland (2015–2020).” When I visited Poland to teach and lecture twice between 2006 and 2008, most people seemed to be walking on air induced by freedom to conduct their own affairs to an unusual degree for a state usually squeezed between nationalists in Germany and Russia. What did the Poles then do in a couple of decades? Read Hlebowicz’ chapter and decide. It certainly isn’t soft-bellied liberalism. In Chapter 3, with Bruce E. Johansen, we visit China’s western provinces, the lands of Tibet as well as the Uighurs and other Muslims in the Xinjiang region, who would most assuredly resent being characterized as being possessed by the Chinese of the Han to the east. As a student of Native American history, I had never before thought of the Tibetans and Uighurs as Native peoples struggling against the Independence-minded peoples of a land that is called an adjunct of China on most of our maps. The random act of sitting next to a young woman on an Air India flight out of Hyderabad, bound for New Delhi taught me that the Tibetans had something to share with the Lakota, the Iroquois, and hundreds of other Native American states and nations in North America. Active resistance to Chinese rule lasted into the mid-nineteenth century, and continues today in a subversive manner, even in song, as I learned in 2018 when I acted as a foreign adjudicator on a Ph.D. dissertation by a Tibetan student at the University of Madras (in what is now in a city called Chennai), in southwestern India on resistance in song during Tibet’s recent history. Tibet is one of very few places on Earth where a young dissident can get shot to death for singing a song that troubles China’s Quest for Lebensraum. The situation in Xinjiang region, where close to a million Muslims have been interned in “reeducation” camps surrounded with brick walls and barbed wire. They sing, too. Come with us and hear the music. Back to Europe now, in Chapter 4, to Portugal and Spain, we find a break in the general pattern of nationalism. Portugal has been more progressive governmentally than most. Spain varies from a liberal majority to military coups, a pattern which has been exported to Latin America. A situation such as this can make use of the term “populism” problematic, because general usage in our time usually ties the word into a right-wing connotative straightjacket. “Populism” can be used to describe progressive (left-wing) insurgencies as well. José Pinto, who is native to Portugal and also researches and writes in Spanish as well as English, in “Populism in Portugal and Spain: a Real Neighbourhood?” provides insight into these historical paradoxes. Hungary shares some historical inclinations with Poland (above). Both emerged from Soviet dominance in an air of developing freedom and multicultural diversity after the Berlin Wall fell and the Soviet Union collapsed. Then, gradually at first, right wing-forces began to tighten up, stripping structures supporting popular freedom, from the courts, mass media, and other institutions. In Chapter 5, Bernard Tamas, in “From Youth Movement to Right-Liberal Wing Authoritarianism: The Rise of Fidesz and the Decline of Hungarian Democracy” puts the renewed growth of political and social repression into a context of worldwide nationalism. Tamas, an associate professor of political science at Valdosta State University, has been a postdoctoral fellow at Harvard University and a Fulbright scholar at the Central European University in Budapest, Hungary. His books include From Dissident to Party Politics: The Struggle for Democracy in Post-Communist Hungary (2007). Bear in mind that not everyone shares Orbán’s vision of what will make this nation great, again. On graffiti-covered walls in Budapest, Runes (traditional Hungarian script) has been found that read “Orbán is a motherfucker” (Mikanowski, 2019, 58). Also in Europe, in Chapter 6, Professor Ronan Le Coadic, of the University of Rennes, Rennes, France, in “Is There a Revival of French Nationalism?” Stating this title in the form of a question is quite appropriate because France’s nationalistic shift has built and ebbed several times during the last few decades. For a time after 2000, it came close to assuming the role of a substantial minority, only to ebb after that. In 2017, the candidate of the National Front reached the second round of the French presidential election. This was the second time this nationalist party reached the second round of the presidential election in the history of the Fifth Republic. In 2002, however, Jean-Marie Le Pen had only obtained 17.79% of the votes, while fifteen years later his daughter, Marine Le Pen, almost doubled her father's record, reaching 33.90% of the votes cast. Moreover, in the 2019 European elections, re-named Rassemblement National obtained the largest number of votes of all French political formations and can therefore boast of being "the leading party in France.” The brutality of oppressive nationalism may be expressed in personal relationships, such as child abuse. While Indonesia and Aotearoa [the Maoris’ name for New Zealand] hold very different ranks in the United Nations Human Development Programme assessments, where Indonesia is classified as a medium development country and Aotearoa New Zealand as a very high development country. In Chapter 7, “Domestic Violence Against Women in Indonesia and Aotearoa New Zealand: Making Sense of Differences and Similarities” co-authors, in Chapter 8, Mandy Morgan and Dr. Elli N. Hayati, from New Zealand and Indonesia respectively, found that despite their socio-economic differences, one in three women in each country experience physical or sexual intimate partner violence over their lifetime. In this chapter ther authors aim to deepen understandings of domestic violence through discussion of the socio-economic and demographic characteristics of theit countries to address domestic violence alongside studies of women’s attitudes to gender norms and experiences of intimate partner violence. One of the most surprising and upsetting scholarly journeys that a North American student may take involves Adolf Hitler’s comments on oppression of American Indians and Blacks as he imagined the construction of the Nazi state, a genesis of nationalism that is all but unknown in the United States of America, traced in this volume (Chapter 8) by co-editor Johansen. Beginning in Mein Kampf, during the 1920s, Hitler explicitly used the westward expansion of the United States across North America as a model and justification for Nazi conquest and anticipated colonization by Germans of what the Nazis called the “wild East” – the Slavic nations of Poland, the Baltic states, Ukraine, and Russia, most of which were under control of the Soviet Union. The Volga River (in Russia) was styled by Hitler as the Germans’ Mississippi, and covered wagons were readied for the German “manifest destiny” of imprisoning, eradicating, and replacing peoples the Nazis deemed inferior, all with direct references to events in North America during the previous century. At the same time, with no sense of contradiction, the Nazis partook of a long-standing German romanticism of Native Americans. One of Goebbels’ less propitious schemes was to confer honorary Aryan status on Native American tribes, in the hope that they would rise up against their oppressors. U.S. racial attitudes were “evidence [to the Nazis] that America was evolving in the right direction, despite its specious rhetoric about equality.” Ming Xie, originally from Beijing, in the People’s Republic of China, in Chapter 9, “News Coverage and Public Perceptions of the Social Credit System in China,” writes that The State Council of China in 2014 announced “that a nationwide social credit system would be established” in China. “Under this system, individuals, private companies, social organizations, and governmental agencies are assigned a score which will be calculated based on their trustworthiness and daily actions such as transaction history, professional conduct, obedience to law, corruption, tax evasion, and academic plagiarism.” The “nationalism” in this case is that of the state over the individual. China has 1.4 billion people; this system takes their measure for the purpose of state control. Once fully operational, control will be more subtle. People who are subject to it, through modern technology (most often smart phones) will prompt many people to self-censor. Orwell, modernized, might write: “Your smart phone is watching you.” Ming Xie holds two Ph.Ds, one in Public Administration from University of Nebraska at Omaha and another in Cultural Anthropology from the Chinese Academy of Social Sciences, Beijing, where she also worked for more than 10 years at a national think tank in the same institution. While there she summarized news from non-Chinese sources for senior members of the Chinese Communist Party. Ming is presently an assistant professor at the Department of Political Science and Criminal Justice, West Texas A&M University. In Chapter 10, analyzing native peoples and nationhood, Barbara Alice Mann, Professor of Honours at the University of Toledo, in “Divide, et Impera: The Self-Genocide Game” details ways in which European-American invaders deprive the conquered of their sense of nationhood as part of a subjugation system that amounts to genocide, rubbing out their languages and cultures -- and ultimately forcing the native peoples to assimilate on their own, for survival in a culture that is foreign to them. Mann is one of Native American Studies’ most acute critics of conquests’ contradictions, and an author who retrieves Native history with a powerful sense of voice and purpose, having authored roughly a dozen books and numerous book chapters, among many other works, who has traveled around the world lecturing and publishing on many subjects. Nalanda Roy and S. Mae Pedron in Chapter 11, “Understanding the Face of Humanity: The Rohingya Genocide.” describe one of the largest forced migrations in the history of the human race, the removal of 700,000 to 800,000 Muslims from Buddhist Myanmar to Bangladesh, which itself is already one of the most crowded and impoverished nations on Earth. With about 150 million people packed into an area the size of Nebraska and Iowa (population less than a tenth that of Bangladesh, a country that is losing land steadily to rising sea levels and erosion of the Ganges river delta. The Rohingyas’ refugee camp has been squeezed onto a gigantic, eroding, muddy slope that contains nearly no vegetation. However, Bangladesh is majority Muslim, so while the Rohingya may starve, they won’t be shot to death by marauding armies. Both authors of this exquisite (and excruciating) account teach at Georgia Southern University in Savannah, Georgia, Roy as an associate professor of International Studies and Asian politics, and Pedron as a graduate student; Roy originally hails from very eastern India, close to both Myanmar and Bangladesh, so he has special insight into the context of one of the most brutal genocides of our time, or any other. This is our case describing the problems that nationalism has and will pose for the sustainability of the Earth as our little blue-and-green orb becomes more crowded over time. The old ways, in which national arguments often end in devastating wars, are obsolete, given that the Earth and all the people, plants, and other animals that it sustains are faced with the existential threat of a climate crisis that within two centuries, more or less, will flood large parts of coastal cities, and endanger many species of plants and animals. To survive, we must listen to the Earth, and observe her travails, because they are increasingly our own.

In the first two phases of this project, the accuracy and reliability of both conventional and more advanced nondestructive inspection techniques were evaluated by way of a round-robin program of blind inspections The results indicate that there is much variability in the accuracy and reliability of discontinuity detection and sizing depending on details of the NDT procedures adopted, which includes specification of equipment, techniques, calibration methods, and reporting requirements. In Phase III, optimized procedures for sleeve fillet welds and a limited number of branch groove welds were developed in the laboratory using fabricated assemblies containing Intentionally placed discontinuities. In response to a recommendation in Phase Ill, the current phase developed optimized procedures for a wide range of branch groove welds. The results of this phase indicate that the reliability and accuracy of nondestructive inspection techniques is not as high as obtained for sleeve fillet welds in the previous phase of the program In particular, the detection of sub-surface discontinuities by ultrasonic inspection is made more difficult by the added complexity of the branch weld geometries. As with sleeve fillet welds however, the probability of detecting weld toe cracks of a significant size can be quite good.

Because where potentially serious damage is found it is dug and dealt with, models that assess damage severity have no relevance in that context. But, as in-line inspection tools become better adept in identifying and characterizing potential damage, models will be needed to screen the ILI results, to determine whether a dig is warranted, and when that must happen. While criteria like B31G might be used to assess metal loss due to a gouge, the usual complexity of mechanical damage cannot be assessed simply in terms of length and depth, so validated models that can account for the complexity are required. Such models could then be evaluated parametrically to develop prioritization guidelines useful with modern inspection technologies. PRCI Projects MD-4-3 and MD-4-4 were initiated to develop such models, with the results of full-scale testing generated in Project MD-4-1 serving as the basis to assess their validity. This report presents the work done as part of PRCI Project MD-4-4, which targeted an improved model for predicting time and/or cycle-dependent failure of dent and gouge damage. In addition to meeting that objective, this project also developed the basis to predict immediate failure consistent with the scope of Project MD-4-1, which as of this reporting had not emerged from the work of Project MD-4-3. Technology framed in the context of PR3-9305 was used to predict the immediate failure due to burst testing of gouged pipe done as part of MD-4-1, and found to accurately predict those collapse-controlled failures. Technology framed in that same context also was used to predict the delayed failure due to fatigue that developed in cyclic pressure testing of gouged pipes that also was done as part of MD-4-1, and found to reasonably predict those outcomes. However, there were some results that indicated the need to better quantify the crack driving force in terms of re-rounding, and the population of defects that can develop when the damaged pipe re-rounds in the wake of damage.