Large-scale Broadcast Research Articles

Secure and Efficient Authentication using Linkage for permissionless Bitcoin network

The cryptocurrency’s permissionless and large-scale broadcasting requirements prohibit the traditional authentication implementation on the blockchain’s underlying peer-to-peer (P2P) networking. Thus, blockchain networking implementations remain vulnerable to networking integrity threats such as spoofing or hijacking. We design Secure and Efficient Authentication using Linkage (SEAL) to build connection security for permissionless Bitcoin networking. SEAL uses the linkage between the packets for a symmetric operation, in contrast to the traditional authentication approach relying on identity-credential-based trust. To make it appropriate for cryptocurrency networking, SEAL utilizes the packet header, protects the end-to-end connection, and separates the online process and the offline process so that the real-time overhead is minimal for greater efficiency and practicality. We implement SEAL on a functioning Bitcoin node and demonstrate that SEAL operates efficiently with minimal overhead. Specifically, it reduces the hash rate by only 1.3% compared to an unsecured node. Additionally, we use a network simulator to emulate the Bitcoin Mainnet and analyze SEAL’s impact on block propagation delay. SEAL yields 2.04 times smaller delay and 1.25 times smaller delay in block propagation than HMAC and ChaCha20-Poly1305, respectively. The key advantage of SEAL is that it requires fewer hash computations and simpler mixing operations, resulting in significantly lower computational overhead compared to traditional authentication schemes based on message authentication codes (MACs).

Blockchain Handshaking with Software Assurance: Version++ Protocol for Bitcoin Cryptocurrency

Cryptocurrency software implements cryptocurrency operations (including the distributed consensus protocol and peer-to-peer networking) and often involves the open-source community. We design a software assurance scheme for cryptocurrency and advance the cryptocurrency handshaking protocol by providing the verification capability of the Bitcoin software by peers and preventing any potential peer from establishing a connection with modified Bitcoin software. Since we focus on Bitcoin (the most popular cryptocurrency) for implementation and integration, we call our scheme Version++, built on and advancing the current Bitcoin handshaking protocol based on the Version message. Our Version++ protocol providing software assurance is distinguishable from previous research because it is permissionless, distributed, and lightweight for its cryptocurrency application. Our scheme is permissionless since it does not require a centralized trusted authority (unlike the remote software attestation techniques from trusted computing); it is distributed since the peer checks the software assurances of its own peer connections; and it is designed for efficiency/lightweight to support the dynamic nature of the peer connections and large-scale broadcasting in cryptocurrency networking. Utilizing Merkle Tree for the efficiency of the proof verification, we implement and test Version++ on Bitcoin software and conduct experiments in an active Bitcoin node prototype connected to the Bitcoin Mainnet. Our prototype-based performance analyses demonstrate the lightweight design of Version++. The peer-specific verification grows logarithmically with the number of software files in processing time and in storage. Furthermore, the Version++ verification overhead is small compared to the version-verack handshaking process; we measure the overhead to be 0.524% in our local networking environment between virtual machines and between 0.057% and 0.282% (depending on the peer location) in our more realistic cloud-based experiments with remote peer machines.

The problem of environmental discourse in the works of chingiz aitmatov

The article is devoted to the urgent problem of understanding the impending environmental crisis by modern society, which was the result of ill-considered policy of the states of the world in the field of protecting natural resources. In this regard, in many countries, work is being carried out aimed at urgently correcting environmental problems, carrying out the necessary environmen- tal measures, as well as broadly informing the public about them. The mass media and publicists are entrusted with the task of large-scale broadcasting of environmental discourse, which is not limited only to coverage of environmental problems, but also expands the scope of human aware- ness of his role in saving the planet from an environmental catastrophe. The purpose of the article is to consider the problems and main directions of environmental discourse in the artistic and philosophical understanding of the great writer and publicist Ch. T. Aitmatov. The scientific sig- nificance of the article is determined by the actualization of the definition of ecological discourse from the point of view of philosophical, artistic and persuasive intentions, which is being under- taken for the first time. The research methodology provides for a systematic approach, a method of selection, analysis. The result of the research is to systematize the typological characteristics of environmental discourse. Modern media terminology requires a historical and humanitarian basis, which determines the scientific value of this article. The practical significance lies in the possibil- ity of introducing the research results into the learning process at the faculties of journalism in specialized and elective disciplines. Key words: ecology, ecological discourse, media discourse, environmental discourse, journalism, ecological journalism, Chingiz Aitmatov.

Research on trusted DNP3-BAE protocol based on hash chain

To solve the security problem of industrial Ethernet DNP3 protocol broadcast authentication, the attack vector and security requirements of trusted DNP3 protocol are analysed. First, the paper adopts a trusted platform into the control network and authenticates the identity and security status of the DNP3 client and server to prevent node sensitive information from being compromised. Second, a trusted DNP3-BAE broadcast authentication encryption protocol is proposed based on the hash chain method to solve the problem of missing message security authentication mechanism in broadcast mode, which only needs a key to complete the broadcast message authentication for multiple slaves. The new scheme can use the DNP3-SA encryption primitive, without a major upgrade to the existing platform. The protocol is verified by the SPAN tool; the results show that there is no intrusion path, which ensures the integrity, authenticity, freshness, and confidentiality of the communication nodes. At present, there is no public document to introduce a trusted platform into the DNP3 protocol to solve security problems. Performance analysis shows that our solution reduces the overhead of large-scale broadcast authentication at the expense of increased less processing and storage overhead.

Channel Pre-Inversion and Max-SINR Vector Perturbation for Large-Scale Broadcast Channels

We study channel pre-inversion and vector perturbation (VP) schemes for large-scale broadcast channels, wherein a transmitter has ${M}$ transmit antennas and is transmitting to ${K}$ single-antenna non-cooperating receivers. We provide results which predict the capacity of MMSE pre-inversion as $\boldsymbol {K\rightarrow \infty }$ . We construct a new VP strategy, max-SINR VP (MSVP), which maximizes a sharp estimate of the signal-to-interference-plus-noise ratio. We provide results which predict the performance of MSVP and demonstrate that MSVP outperforms other VP methods. Lastly, we combine MSVP with the low-complexity sorted QR precoding method to show that MSVP has the potential to efficiently deliver data to a very large number of users at close to channel capacity.

Randomized parity forwarding in large-scale cooperative broadcast network

We present a randomized cooperative broadcasting technique that is flexible to topology changes and robust to transmission errors in large-scale wireless networks. A single source sends a common message (codeword) to all nodes, and those nodes that decode the message correctly then generate a parity bit (a partial information on the message) and broadcast it to the remaining nodes. The remaining nodes integrate the original codeword from the source with the network-generated parity bits to construct a lower rate, and thus more powerful, error correcting code. The protocol overhead is significantly reduced by allowing each node to randomly generate a parity bit independent of other nodes. We show that the probability of decoding error decreases exponentially with the number of nodes in the network, and that the performance degradation relative to the deterministic parity generation (that requires a centralized coordination of nodes) becomes smaller as the number of nodes increases. We also show that the proposed approach enables all nodes to correctly receive the message within the first cooperation stage if the number of nodes is sufficiently large. Hence, the proposed approach is promising for applications in large-scale wireless broadcast networks.

Proposal of an Information Compilation Method for Massive News Video Data Based on their Time-Series Semantic Structure

Recent increase of digital storage capacity has enabled the creation of large-scale on-line broadcast video archives. In order to make full use of the data in the archive, it is necessary to let a user easily grasp the availability of certain video data and their contents. Considering this problem, we have been investigating efficient and effective retrieval and reusing methodologies of archived video data. The archive used as a test-bed consists of more than 1,000 hours of news video obtained from a Japanese news program during the past six years. This paper first proposes a news topic tracking and structuring method. A structure called the `topic thread structure', is organized so that it should represent the temporal flow of news topics originating from a specified news story. The paper next introduces a browsing and editing interface that enables the user to browse through news stories along the topic thread structure, and also assists the compilation of selected news stories as a customized video summary or a documentary. The method was applied to the archived news video data in order to observe the quality of the topic thread structure and the usability of the prototype interface. As a result, some structures represented the flow of topics quite close to real-world comprehension. In addition, experiments showed that when the structure could be considered meaningful, the interface combined with the structure could drastically reduce the time needed to browse through the archive for news stories related to the user's interest.

An Overlay Subscription Network for Live Internet TV Broadcast

We propose a framework, called overlay subscription network (OSN), for live Internet TV broadcast, where a subscriber can choose to watch at any time. This framework allows the source server to incrementally build a topology graph that contains the network connections not only from the server to each subscriber, but also among the subscribers themselves. With such a topology graph in place, we consider efficient overlay multicast for scalable OSN services. We first show that idling nodes, which do not receive video data for their own playback, can actually be used for data forwarding to significantly reduce the cost of overlay multicast. In light of this observation, we then propose a novel overlay multicast technique that distinguishes itself from existing schemes with these three aspects. First, the proposed technique is centered on the topology graph and can take advantage of the actual network connections among the subscribing nodes. Second, the new scheme is able to find and incorporate appropriate idling nodes in multicast to reduce network traffic. Third, with our approach, a node can be used in multiple multicast trees for data forwarding to improve the overall system performance. We evaluate the performance of the proposed technique through simulation. Our extensive studies show that the proposed framework has the potential to enable the Internet, a vehicle up to date mainly for transferring text and image data, for large-scale and cost-effective TV broadcast

Portinari e a arte social

O interesse pela pintura mural suscitou várias tomadas de posição no século XX, dentre elas, a defesa da difusão em ampla escala de imagens eivadas do compromisso do artista para com o próprio tempo e o próprio povo. No conjunto dos “ciclos econômicos”, Portinari demonstra que é possível “narrar uma história” sem aderir à versão oficial, apresentando uma visão crítica da sociedade brasileira a partir do tema nuclear do trabalho. Abstract The interest in mural painting has resulted in many decision-makings in the 20th Century, among them the defense of large scale broadcasting of images shot through with the commitment of the artist with his own time and people. In the set of “economical cycles”, Portinari demonstrates that it is possible to “narrate a story” without the attachment to the official version, presenting a critical view of the Brazilian society from the nuclear theme of work. Palavras-chave: Portinari. Arte social. Muralismo. Key words: Portinari. Social art. Muralism.

Scattercast: an adaptable broadcast distribution framework

Internet broadcasting - the simultaneous distribution of live content streams to a large audience - has a number of interesting applications ranging from real-time broadcasts of audio/video streams for online concerts or sporting events to efficient and reliable large-scale software distribution. We identify three fundamental requirements for scalable broadcasting services: an efficient infrastructure for large-scale broadcasting, an ability to adapt the infrastructure to suit the requirements of a wide range of applications, and ease of deployment of the infrastructure. Although solutions such as the network-layer IP multicast approach and a slew of overlay distribution networks exist today, none of these technologies satisfactorily addresses all of the above concerns.In this paper, we argue that an application-customizable hybrid overlay is well suited to meet these challenges. To this end, we propose an architecture called scattercast that relies on a network of strategically located agents called Scatter-Cast proXies or SCXs. These agents collaboratively provide the broadcast service for a session. Clients locate a nearby SCX and tap into the session via that SCX. Scattercast constructs a hybrid overlay network composed of unicast links between SCXs that interconnect locally scoped multicast regions. Rather than define a single standardized service model for transmitting data on top of the overlay, scattercast builds a customizable transport framework that provides adaptability by leveraging application-defined semantics to drive the distribution of content. We demonstrate the ability of our architecture to provide efficient distribution via a set of simulation experiments. Finally, we present our experience with the adaptability of the framework by describing two applications, a real-time Internet radio and an online slide-presentation tool, both of which we have built on top of a prototype implementation of the architecture.

Bait Preference by the Argentine Ant (Hymenoptera: Formicidae) in Haleakala National Park, Hawaii

The Argentine ant, Linepithema humile (Mayr), has proven to be a threat to native arthropod species in Haleakala National Park, Maui, HI, and is also a potential threat to the park's native flora. As it continues to expand its range, an effort has been undertaken to eradicate it, or at the least, control its spread. The 1st part of this effort focused on finding a bait carrier for subsequent toxicant-based control tests. A year-long bait preference test was implemented at each of the ant's 2 infestation sites in Haleakala National Park, in which 6 solid baits and 2 liquid baits were assessed for attractiveness and feasibility for large scale control. At both sites, a toxicant-free formulation of Maxforce, a protein-based granular bait made from ground silkworm, Bombyx mori (L.), pupae, and a 25% sugar water solution were the most attractive baits. Ants took more Maxforce (without toxicant) and sugar water than all other baits, including honey granules and a fish protein bait. Sugar water, however, is difficult to distribute over large natural areas. Maxforce was therefore concluded to be the best bait carrier for toxicant-based control at Haleakala National Park because of its attractiveness and its ease for large scale broadcast dispersal.