The purpose of this study is to discuss epidemic communication for drones to share information in flight and to develop a wireless system for implementation. Various theoretical studies have been ...conducted on epidemic communication, but their applications are not clear, so a system that assumes practical use is developed. As the main evaluation items, we analyzed the effect of communication interference between drones on the amount of data transmission, and furthermore, proposed an optimal transmission method depending on the flight speed. In these analysis results, we designed functions to be implemented in drones, developed wireless devices, and confirmed their operation through demonstration tests using actual drones. Based on the results of this research, we succeeded in identifying issues to be addressed in order to implement the system on drones and in developing an epidemic communication system based on the results of demonstration experiments, thereby contributing to the realization of inter-drone communication in the future.
In the situation where there are one sender and multiple receivers and the sender transmits ciphertexts of correlated plaintexts, a receiver selective opening (RSO) attack for a public key encryption ...(PKE) scheme considers adversaries that can corrupt some of the receivers and get their secret keys and plaintexts. Security against RSO attacks for a PKE scheme ensures confidentiality of ciphertexts of uncorrupted receivers. Simulation-based RSO security against chosen ciphertext attacks (SIM-RSO-CCA) is the strongest security notion in all RSO attack scenarios. Jia, Lu, and Li (2016) 19 proposed the first SIM-RSO-CCA secure PKE scheme. However, their scheme used indistinguishability obfuscation, which is not known to be constructed from any standard computational assumption. In this paper, we give two contributions for constructing SIM-RSO-CCA secure PKE from standard computational assumptions. Firstly, we propose a generic construction of SIM-RSO-CCA secure PKE using an IND-CPA secure PKE scheme and a non-interactive zero-knowledge proof system satisfying one-time simulation soundness. Secondly, we propose an efficient and concrete construction of SIM-RSO-CCA secure PKE based on the decisional Diffie-Hellman (DDH) assumption. Moreover, we give a method for efficiently expanding the plaintext space of the DDH-based construction. By applying this method to the construction, we obtain the first DDH-based SIM-RSO-CCA secure PKE scheme supporting a super-polynomially large plaintext space with compact ciphertexts.
Aggregate signature schemes enable us to aggregate multiple signatures into a single short signature. One of its typical applications is sensor networks, where a large number of users and devices ...measure their environments, create signatures to ensure the integrity of the measurements, and transmit their signed data. However, if an invalid signature is mixed into aggregation, the aggregate signature becomes invalid, thus if an aggregate signature is invalid, it is necessary to identify the invalid signature. Furthermore, we need to deal with a situation where an invalid sensor generates invalid signatures probabilistically. In this paper, we introduce a model of aggregate signature schemes with interactive tracing functionality that captures such a situation, and define its functional and security requirements and propose aggregate signature schemes that can identify all rogue sensors. More concretely, based on the idea of Dynamic Traitor Tracing, we can trace rogue sensors dynamically and incrementally, and eventually identify all rogue sensors of generating invalid signatures even if the rogue sensors adaptively collude. In addition, the efficiency of our proposed method is also sufficiently practical.
The taxonomy of Pseudolachnea and Pseudolachnella is controversial. Some authors have regarded them as congeneric, whereas others have considered them to be distinct genera differentiated merely on ...the number of conidial septa. A total of 26 isolates of Pseudolachnea-like fungi were subjected to morphological examination and phylogenetic analyses of nuc rDNA internal transcribed spacers 1 and 2 and partial 28S sequences and partial sequence of the translation elongation factor 1α gene. The results indicated that our materials should be classified in four genera: Pseudolachnea, Pseudolachnella, and two new genera, Neopseudolachnella and Pseudodinemasporium. Although the monophyly of both Pseudolachnea and Pseudolachnella was confirmed, it was concluded that differences observed in the conidiomatal structure, such as thickness of basal stroma and the excipulum, were more reliable for their circumscription, instead of conidial septation. Neopseudolachnella was similar to Pseudolachnea and Pseudolachnella in conidial morphology but was characterized by the conidiomata lacking an excipulum, unlike members of the latter two genera. Pseudodinemasporium bore conidia morphologically similar to those of Dinemasporium but was differentiated from the latter by the conidiomata, which was composed of a well developed peridial structure. A total of 12 new species, namely three in Neopseudolachnella (N. acutispora, N. magnispora, N. uniseptata), one in Pseudodinemasporium (P. fabiforme) and eight in Pseudolachnella (P. asymmetrica, P. botulispora, P. brevicoronata, P. campylospora, P. complanata, P. falcatispora, P. fusiformis and P. pachyderma) are described and illustrated.
We consider a UAV (Unmanned Aerial Vehicle) relay network whereby each UAV senses data and forwards it to dedicated ground stations by means of multi-hop relaying. In particular, we focus on a UAV ...relay network with a simple yet realistic linear topology for which we propose an adaptive direction control scheme to achieve a high throughput performance. In the proposed scheme, each UAV, equipped with multiple directional antennas, selects either the Decode-and-Forward (DF) straight relaying method or the orthogonal relaying method , for full-duplex data transfer, i.e., data is transmitted and received simultaneously on the same frequency, but at different antennas. The originality of our proposed method is to make each UAV rotate relatively to the position of its neighbouring UAVs, in order to optimize its antenna radiation direction, according to the selected relaying method. The key advantage of the proposed method is that signal direction can be controlled without the need of heavy adaptive signal processing as in conventional beamforming techniques. In order to clarify the decision parameters for selecting a relaying method, we first evaluate the throughput performance of the two-hop relay network under the severe interference conditions of UAV networks, and next, propose a procedure for selecting a multihop relaying method. Numerical experiments show that the proposed scheme enables to achieve a high throughput performance, with low computational costs.
In a large-scale information-sharing platform, such as a cloud storage, it is often required to not only securely protect sensitive information but also recover it in a reliable manner. Public-key ...encryption with non-interactive opening (PKENO) is considered as a suitable cryptographic tool for this requirement. This primitive is an extension of public-key encryption which enables a receiver to provide a non-interactive proof which confirms that a given ciphertext is decrypted to some public plaintext. In this paper, we present a Tag-KEM/DEM framework for PKENO. In particular, we define a new cryptographic primitive called a Tag-KEM with non-interactive opening (Tag-KEMNO), and prove the KEM/DEM composition theorem for this primitives, which ensures a key encapsulation mechanism (KEM) and a data encapsulation mechanism (DEM) can be, under certain conditions, combined to form a secure PKENO scheme. This theorem provides a secure way of combining a Tag-KEMNO scheme with a DEM scheme to construct a secure PKENO scheme. Using this framework, we explain the essence of existing constructions of PKENO. Furthermore, we present four constructions of Tag-KEMNO, which yields four PKENO constructions. These PKENO constructions coincide with the existing constructions, thereby we explain the essence of these existing constructions. In addition, our Tag-KEMNO framework enables us to expand the plaintext space of a PKENO scheme. Some of the previous PKENO schemes are only able to encrypt a plaintext of restricted length, and there has been no known way to expand this restricted plaintext space to the space of arbitrary-length plaintexts. Using our framework, we can obtain a PKENO scheme with the unbounded-length plaintext space by modifying and adapting such a PKENO scheme with a bounded-length plaintext space.
The concept of threshold public key encryption (TPKE) with the special property called key re-splittability (re-splittable TPKE, for short) was introduced by Hanaoka et al. (CT-RSA 2012), and used as ...one of the building blocks for constructing their proxy re-encryption scheme. In a re-splittable TPKE scheme, a secret key can be split into a set of secret key shares not only once, but also multiple times, and the security of the TPKE scheme is guaranteed as long as the number of corrupted secret key shares under the same splitting is smaller than the threshold. In this paper, we show several new constructions of a re-splittable TPKE scheme by extending the previous (ordinary) TPKE schemes. All of our proposed schemes are based on discrete logarithm (DL)-type assumptions. Therefore, our results suggest that key re-splittability is a very natural property for DL-type TPKE schemes.
A raindrop size distribution (DSD) retrieval method for a weather radar network consisting of several X-band dual-polarization radars is proposed. An iterative maximum likelihood (ML) estimator for ...DSD retrieval in a single radar was developed in the authors' previous work, and the proposed algorithm in this paper extends the single-radar retrieval to radar-networked retrieval, where ML solutions in each single-radar node are integrated based on a Bayesian scheme in order to reduce estimation errors and to enhance accuracy. Statistical evaluations of the proposed algorithm were carried out using numerical simulations. The results with eight radar nodes showed that the bias and standard errors are -0.05 and 0.09 in log(N sub(w)); and N sub(w) (mm super(-1) m super(-3)) and 0.04 and 0.09 in D sub(0) (mm) in an environment with fluctuations in dual-polarization radar measurements (normal distributions with standard deviations of 0.8 dBZ, 0.2 dB, and 1.5 degree in Z sub(Hm), Z sub(DRm), and Phi sub(DPm), respectively). Further error analyses indicated that the estimation accuracy depended on the number of radar nodes, the ranges of varying mu , the raindrop axis ratio model, and the system bias errors in dual-polarization radar measurements.
Celotno besedilo
Dostopno za:
DOBA, IZUM, KILJ, NUK, PILJ, PNG, SAZU, UILJ, UKNU, UL, UM, UPUK
Machine learning models inherently memorize significant amounts of information, and thus hiding not only prediction processes but also trained models, i.e., model obliviousness, is desirable in the ...cloud setting. Several works achieved model obliviousness with the MNIST dataset, but datasets that include complicated samples, e.g., CIFAR-10 and CIFAR-100, are also used in actual applications, such as face recognition. Secret sharing-based secure prediction for CIFAR-10 is difficult to achieve. When a deep layer architecture such as CNN is used, the calculation error when performing secret calculation becomes large and the accuracy deteriorates. In addition, if detailed calculations are performed to improve accuracy, a large amount of calculation is required. Therefore, even if the conventional method is applied to CNN as it is, good results as described in the paper cannot be obtained. In this paper, we propose two approaches to solve this problem. Firstly, we propose a new protocol named Batch-normalizedActivation that combines BatchNormalization and Activation. Since BatchNormalization includes real number operations, when performing secret calculation, parameters must be converted into integers, which causes a calculation error and decrease accuracy. By using our protocol, calculation errors can be eliminated, and accuracy degradation can be eliminated. Further, the processing is simplified, and the amount of calculation is reduced. Secondly, we explore a secret computation friendly and high accuracy architecture. Related works use a low-accuracy, simple architecture, but in reality, a high accuracy architecture should be used. Therefore, we also explored a high accuracy architecture for the CIFAR10 dataset. Our proposed protocol can compute prediction of CIFAR-10 within 15.05 seconds with 87.36% accuracy while providing model obliviousness.
PDF
