With recent advancements in cloud services, the demand for data security during outsourced computations has been increasing. Fully Homomorphic encryption (FHE) offers a promising solution to this demand by enabling th...
详细信息
In an attempt to reduce encryption time, we would want to compare the Chipper text-policy-attribute based encryption method with a new lightweight cryptography strategy for secure cloud data sharing. Tools and Methods...
详细信息
This article evaluates the possibility of using Russian Standardized Crypto algorithms (also known as GOST algorithms) in the QUIC transport protocol. The conclusion is that it is generally feasible to use these algor...
详细信息
This article evaluates the possibility of using Russian Standardized Crypto algorithms (also known as GOST algorithms) in the QUIC transport protocol. The conclusion is that it is generally feasible to use these algorithms in QUIC, provided that some additional tasks, identified in this article, are completed. The article also identifies potential problems with some GOST algorithms when used in QUIC.
Abstract: This paper is devoted to the construction of a time-optimal method for measuring themaximum permissible (critical) value of the supply voltage (as well as other parameters) of thedevice on which the cryptogr...
详细信息
In order to solve the problem of researching the distribution of returns on trustworthy "dual contribution" data assets, the authors propose a research on the distribution mechanism of returns on trustworthy...
详细信息
With the continuous progress of communication technology, traditional encryption algorithms cannot meet the demands of modern wireless communication security. Secure communication based on physical layer encryption em...
详细信息
This study focuses on enhancing the security of image transmission in Networking Systems of Artificial Intelligence (NSAI) by implementing an advanced encryption algorithm (AEA) based on chaotic algorithms. The resear...
详细信息
With the development and application of network technology, digital images, as a form of information transmission, are at high risk of being stolen or decrypted. Our scheme utilizes the nature of low dimensional chaos...
详细信息
We introduce new lattice-based techniques for building ABE for circuits with unbounded attribute length based on the LWE assumption, improving upon the previous constructions of Brakerski and Vaikuntanathan (CRYPTO 16...
详细信息
ISBN:
(纸本)9789819608935;9789819608942
We introduce new lattice-based techniques for building ABE for circuits with unbounded attribute length based on the LWE assumption, improving upon the previous constructions of Brakerski and Vaikuntanathan (CRYPTO 16) and Goyal, Koppula, and Waters (TCC 16). Our main result is a simple and more efficient unbounded ABE scheme for circuits where only the circuit depth is fixed at set-up;this is the first unbounded ABE scheme for circuits that rely only on blackbox access to cryptographic and lattice algorithms. The scheme achieves semi-adaptive security against unbounded collusions under the LWE assumption. The encryption time and ciphertext size are roughly 3x larger than the prior bounded ABE of Boneh et al. (EUROCRYPT 2014), substantially improving upon the encryption times in prior works. As a secondary contribution, we present an analogous result for unbounded inner product predicate encryption that satisfies weak attribute-hiding.
In this paper, we describe an algorithm to compute chains of (2, 2)-isogenies between products of elliptic curves in the theta model. The description of the algorithm is split into various subroutines to allow for a p...
详细信息
ISBN:
(纸本)9789819608904;9789819608911
In this paper, we describe an algorithm to compute chains of (2, 2)-isogenies between products of elliptic curves in the theta model. The description of the algorithm is split into various subroutines to allow for a precise field operation count. We present a constant time implementation of our algorithm in Rust and an alternative implementation in SageMath. Our work in SageMath runs ten times faster than a comparable implementation of an isogeny chain using the Richelot correspondence. The Rust implementation runs up to forty times faster than the equivalent isogeny in SageMath and has been designed to be portable for future research in higher-dimensional isogeny-based cryptography.
暂无评论