Tag Archives: Cryptography and Security

Internet of Spacecraft for Multi-planetary Defense and Prosperity [IMA]

Posted on by

http://arxiv.org/abs/2205.08567


Recent years have seen unprecedentedly fast-growing prosperity in the commercial space industry. Several privately funded aerospace manufacturers, such as Space Exploration Technologies Corporation (SpaceX) and Blue Origin have innovated what we used to know about this capital-intense industry and gradually reshaped the future of human civilization. As private spaceflight and multi-planetary immigration gradually become realities from science fiction (sci-fi) and theory, both opportunities and challenges are presented. In this article, a review of the progress in space exploration and the underlying space technologies is firstly provided. For the next, a revisit and a prediction are paid and made to the K-Pg extinction event, the Chelyabinsk event, extra-terrestrialization, terraforming, planetary defense, including the emerging near-Earth object (NEO) observation and NEO impact avoidance technologies and strategies. Furthermore, a framework of the Solar Communication and Defense Networks (SCADN) with advanced algorithms and high efficacy is proposed to enable an internet of distributed deep-space sensing, communications, and defense to cope with disastrous incidents such as asteroid/comet impacts. Furthermore, the perspectives on the legislation, management, and supervision of founding the proposed SCADN are also discussed in depth.

Read this paper on arXiv…

Y. Huo
Thu, 19 May 22
42/61

Comments: 28 pages, 19 figures, submitted to a journal as an invited paper

The Case for Technosignatures: Why They May Be Abundant, Long-lived, Highly Detectable, and Unambiguous [EPA]

Posted on by

http://arxiv.org/abs/2203.10899


The intuition suggested by the Drake equation implies that technology should be less prevalent than biology in the galaxy. However, it has been appreciated for decades in the SETI community that technosignatures could be more abundant, longer-lived, more detectable, and less ambiguous than biosignatures. We collect the arguments for and against technosignatures’ ubiquity and discuss the implications of some properties of technological life that fundamentally differ from nontechnological life in the context of modern astrobiology: It can spread among the stars to many sites, it can be more easily detected at large distances, and it can produce signs that are unambiguously technological. As an illustration in terms of the Drake equation, we consider two Drake-like equations, for technosignatures (calculating N(tech)) and biosignatures (calculating N(bio)). We argue that Earth and humanity may be poor guides to the longevity term L and that its maximum value could be very large, in that technology can outlive its creators and even its host star. We conclude that while the Drake equation implies that N(bio)>>N(tech), it is also plausible that N(tech)>>N(bio). As a consequence, as we seek possible indicators of extraterrestrial life, for instance, via characterization of the atmospheres of habitable exoplanets, we should search for both biosignatures and technosignatures. This exercise also illustrates ways in which biosignature and technosignature searches can complement and supplement each other and how methods of technosignature search, including old ideas from SETI, can inform the search for biosignatures and life generally.

Read this paper on arXiv…

J. Wright, J. Haqq-Misra, A. Frank, et. al.
Tue, 22 Mar 22
36/82

Comments: Published in ApJ Letters

Computing on Masked Data: a High Performance Method for Improving Big Data Veracity [CL]

Posted on by

http://arxiv.org/abs/1406.5751


The growing gap between data and users calls for innovative tools that address the challenges faced by big data volume, velocity and variety. Along with these standard three V’s of big data, an emerging fourth “V” is veracity, which addresses the confidentiality, integrity, and availability of the data. Traditional cryptographic techniques that ensure the veracity of data can have overheads that are too large to apply to big data. This work introduces a new technique called Computing on Masked Data (CMD), which improves data veracity by allowing computations to be performed directly on masked data and ensuring that only authorized recipients can unmask the data. Using the sparse linear algebra of associative arrays, CMD can be performed with significantly less overhead than other approaches while still supporting a wide range of linear algebraic operations on the masked data. Databases with strong support of sparse operations, such as SciDB or Apache Accumulo, are ideally suited to this technique. Examples are shown for the application of CMD to a complex DNA matching algorithm and to database operations over social media data.

Read this paper on arXiv…

J. Kepner, V. Gadepally, P. Michaleas, et. al.
Tue, 24 Jun 14
66/82

Comments: to appear in IEEE High Performance Extreme Computing 2014 (ieee-hpec.org)