Log in

Relevant bibliographies by topics / Lattice based encryption / Journal articles

To see the other types of publications on this topic, follow the link: Lattice based encryption.

Journal articles on the topic 'Lattice based encryption'

Author: Grafiati

Published: 25 May 2024

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Lattice based encryption.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

John, Michael, Ogoegbulem Ozioma, Perpetua Ngozi Obi, Henry Etaroghene Egbogho, and Otobong. G. Udoaka. "Lattices in Quantum-ERA Cryptography." International Journal of Research Publication and Reviews, V 4, no. 11 (2023): 2175–79. https://doi.org/10.5281/zenodo.10207210.

Full text

Abstract:

The use of Mathematic in cryptography can result a safe encryption scheme. Lattices have emerged as a powerful mathematical tool in the field of cryptography, offering a diverse set of applications ranging from encryption to secure multi-party computation. This research paper provides a comprehensive review of the role of lattices in cryptography, covering both theoretical foundations and practical implementations. The paper begins by introducing the basic concepts of lattices and their relevance in cryptographic protocols. Subsequently, it explores key cryptographic primitives based on lattic

APA, Harvard, Vancouver, ISO, and other styles

2

Kadykov, Victor, Alla Levina, and Alexander Voznesensky. "Homomorphic Encryption within Lattice-Based Encryption System." Procedia Computer Science 186 (2021): 309–15. http://dx.doi.org/10.1016/j.procs.2021.04.149.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bandara, Harshana, Yasitha Herath, Thushara Weerasundara, and Janaka Alawatugoda. "On Advances of Lattice-Based Cryptographic Schemes and Their Implementations." Cryptography 6, no. 4 (2022): 56. http://dx.doi.org/10.3390/cryptography6040056.

Full text

Abstract:

Lattice-based cryptography is centered around the hardness of problems on lattices. A lattice is a grid of points that stretches to infinity. With the development of quantum computers, existing cryptographic schemes are at risk because the underlying mathematical problems can, in theory, be easily solved by quantum computers. Since lattice-based mathematical problems are hard to be solved even by quantum computers, lattice-based cryptography is a promising foundation for future cryptographic schemes. In this paper, we focus on lattice-based public-key encryption schemes. This survey presents t

APA, Harvard, Vancouver, ISO, and other styles

4

Jiang, Mingming, Yupu Hu, Hao Lei, Baocang Wang, and Qiqi Lai. "Lattice-based certificateless encryption scheme." Frontiers of Computer Science 8, no. 5 (2014): 828–36. http://dx.doi.org/10.1007/s11704-014-3187-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Zeng, Fugeng, and Chunxiang Xu. "A Novel Model for Lattice-Based Authorized Searchable Encryption with Special Keyword." Mathematical Problems in Engineering 2015 (2015): 1–7. http://dx.doi.org/10.1155/2015/314621.

Full text

Abstract:

Data stored in the cloud servers, keyword search, and access controls are two important capabilities which should be supported. Public-keyword encryption with keyword search (PEKS) and attribute based encryption (ABE) are corresponding solutions. Meanwhile, as we step into postquantum era, pairing related assumption is fragile. Lattice is an ideal choice for building secure encryption scheme against quantum attack. Based on this, we propose the first mathematical model for lattice-based authorized searchable encryption. Data owners can sort the ciphertext by specific keywords such as time; dat

APA, Harvard, Vancouver, ISO, and other styles

6

Kumar, Vishnu. "Text Encryption using Lattice-Based Cryptography." IOSR Journal of Computer Engineering 16, no. 2 (2014): 148–51. http://dx.doi.org/10.9790/0661-1628148151.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Li, Zengpeng, Can Xiang, and Chengyu Wang. "Oblivious Transfer via Lossy Encryption from Lattice-Based Cryptography." Wireless Communications and Mobile Computing 2018 (September 2, 2018): 1–11. http://dx.doi.org/10.1155/2018/5973285.

Full text

Abstract:

Authentication is the first defence line to prevent malicious entities to access smart mobile devices (or SMD). Essentially, there exist many available cryptographic primitives to design authentication protocols. Oblivious transfer (OT) protocol is one of the important cryptographic primitives to design authentication protocols. The first lattice-based OT framework under universal composability (UC) model was designed by dual mode encryption and promoted us to find an alternative efficient scheme. We note that “lossy encryption” scheme is an extension of the dual mode encryption and can be use

APA, Harvard, Vancouver, ISO, and other styles

8

Cheng, Rong, and Fangguo Zhang. "Lattice-based obfuscation for re-encryption functions." Security and Communication Networks 8, no. 9 (2014): 1648–58. http://dx.doi.org/10.1002/sec.1112.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Cisneros, Mauricio, and Javier Olazabal. "Lattice-Based Cryptography in the Quantum Era: A Survey." Interfases, no. 018 (December 29, 2023): 281–99. http://dx.doi.org/10.26439/interfases2023.n018.6631.

Full text

Abstract:

The advent of quantum computing reveals current classical cryptography’s incapacity to withstand attacks within the new paradigm. Quantum algorithms break such encryption with impressive ease, with Shor and Grover algorithms being the main perpetrators. Lattice-based key encryption is the suggested solution in multiple instances, as the complexity and randomness that these methods add to message encryption make them one of the best short- and medium-term solutions. In 2016, NIST launched a contest to find algorithms to incorporate into its security standard. Four algorithms from the third roun

APA, Harvard, Vancouver, ISO, and other styles

10

Bhoi, Siddhartha Siddhiprada, Arathi Arakala, Amy Beth Corman, and Asha Rao. "Post-Quantum Homomorphic Encryption: A Case for Code-Based Alternatives." Cryptography 9, no. 2 (2025): 31. https://doi.org/10.3390/cryptography9020031.

Full text

Abstract:

Homomorphic Encryption (HE) allows secure and privacy-protected computation on encrypted data without the need to decrypt it. Since Shor’s algorithm rendered prime factorisation and discrete logarithm-based ciphers insecure with quantum computations, researchers have been working on building post-quantum homomorphic encryption (PQHE) algorithms. Most of the current PQHE algorithms are secured by Lattice-based problems and there have been limited attempts to build ciphers based on error-correcting code-based problems. This review presents an overview of the current approaches to building PQHE s

APA, Harvard, Vancouver, ISO, and other styles

11

Kadykov, V. Yu, and A. B. Levina. "HOMOMORPHIC OPERATIONS WITHIN IDEAL LATTICE BASED ENCRYPTION SYSTEMS." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 198 (December 2020): 40–46. http://dx.doi.org/10.14489/vkit.2020.12.pp.040-046.

Full text

Abstract:

By 2009 the first system of fully homomorphic encryption had been constructed, and it was thought-provoking for many future works based on it. Instead of legacy encryption systems which depend on sharing a key (public or private) among endpoints involved in exchanging en encrypted message the fully homomorphic encryption can keep service without depending on shared keys and does not necessarily need to access the content. Such property allows any third party to operate on the encrypted data without decrypting it in advance. In this work, the possibility of using the ideal lattices for the cons

APA, Harvard, Vancouver, ISO, and other styles

12

Fu, Xingbing, Yong Ding, Haifeng Li, Jianting Ning, Ting Wu, and Fagen Li. "A survey of lattice based expressive attribute based encryption." Computer Science Review 43 (February 2022): 100438. http://dx.doi.org/10.1016/j.cosrev.2021.100438.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Renteria-Mejia, Claudia P., and Jaime Velasco-Medina. "Lattice-Based Cryptoprocessor for CCA-Secure Identity-Based Encryption." IEEE Transactions on Circuits and Systems I: Regular Papers 67, no. 7 (2020): 2331–44. http://dx.doi.org/10.1109/tcsi.2020.2981089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Zhang, Guo Yan. "Fuzzy Certificateless Identity-Based Encryption Protocol from Lattice." Applied Mechanics and Materials 380-384 (August 2013): 2262–66. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.2262.

Full text

Abstract:

Due to their conjectured resistance to quantum cryptanalysis, strong worst-case/average-case security guarantees, ease of implementation and increasing practicality, lattice-based cryptography is one of the hottest and fastest moving areas in mathematical cryptography today. In this paper, we give a fuzzy certificateless identity-based encryption scheme from lattice, whose security is based on the hardness of the Learning With Errors (LWE) problem. In the scheme, the user can choose his own secret key that the KGC cannot obtain, which is an efficient approach to mitigate the key escrow problem

APA, Harvard, Vancouver, ISO, and other styles

15

B M, Chandrakala, and S. C. Lingareddy. "Proxy Re-Encryption in cloud using ALBC (adaptive lattice based cryptography)." Indonesian Journal of Electrical Engineering and Computer Science 16, no. 3 (2019): 1455. http://dx.doi.org/10.11591/ijeecs.v16.i3.pp1455-1463.

Full text

Abstract:

<p>In recent days, data sharing has provided the flexibility to share the data, store the data, and perform operation on data virtually as well as cost effectively. Data sharing in cloud is one of the feature, which is being popular and widely accepted. However, the concern here is to ensure the data security and this has led the researcher to research in this area. To provide the security several Proxy re-encryption scheme has been introduced, however all these method lacks of efficiency. Hence In this paper, we propose a scheme known as ALBC (Adaptive Lattice Based Cryptography), this

APA, Harvard, Vancouver, ISO, and other styles

16

Ye, Qing, Qiaojia Zhang, Sijie Liu, and Kaiqiang Chen. "A novel chaotic system based on coupled map lattice and its application in HEVC encryption." Mathematical Biosciences and Engineering 18, no. 6 (2021): 9410–29. http://dx.doi.org/10.3934/mbe.2021463.

Full text

Abstract:

<abstract> <p>Video information is currently widely used in various fields. Compared with image and text data, video data has the characteristics of large data volume, strong data relevance, and large data redundancy, which makes traditional cryptographic systems no longer suitable for video encryption systems. The paper proposes a new chaotic system based on coupled map lattice (CML) and applies it to high efficiency video coding (HEVC) video encryption. The chaotic system logistic-iterative chaotic map with infinite collapses-coupled map lattice (L-ICMIC-CML), which is improved o

APA, Harvard, Vancouver, ISO, and other styles

17

Sabani, Maria E., Ilias K. Savvas, Dimitrios Poulakis, Georgia Garani, and Georgios C. Makris. "Evaluation and Comparison of Lattice-Based Cryptosystems for a Secure Quantum Computing Era." Electronics 12, no. 12 (2023): 2643. http://dx.doi.org/10.3390/electronics12122643.

Full text

Abstract:

The rapid development of quantum computing devices promises powerful machines with the potential to confront a variety of problems that conventional computers cannot. Therefore, quantum computers generate new threats at unprecedented speed and scale and specifically pose an enormous threat to encryption. Lattice-based cryptography is regarded as the rival to a quantum computer attack and the future of post-quantum cryptography. So, cryptographic protocols based on lattices have a variety of benefits, such as security, efficiency, lower energy consumption, and speed. In this work, we study the

APA, Harvard, Vancouver, ISO, and other styles

18

ROZLOMII, Inna. "METHOD OF CONSTRUCTION MATRIX CARDANO’S GRIDS FOR COMPRESSION OF INFORMATION." Herald of Khmelnytskyi National University 305, no. 1 (2022): 84–89. http://dx.doi.org/10.31891/2307-5732-2022-305-1-84-89.

Full text

Abstract:

Due to the rapid development of computer technology and the information field, issues related to information security are becoming increasingly important. Knowledge of information security tools is required for the effective organization of the process of transmission and storage of classified information. The main means of information protection such as encryption, compression and covert transmission of information are present in the article . Information security techniques, including cryptographic data protection systems, play an important role in today’s information-filled world. The means

APA, Harvard, Vancouver, ISO, and other styles

19

Ma, Chunguang, Juyan Li, and Weiping Ouyang. "Lattice-Based Identity-Based Homomorphic Conditional Proxy Re-Encryption for Secure Big Data Computing in Cloud Environment." International Journal of Foundations of Computer Science 28, no. 06 (2017): 645–60. http://dx.doi.org/10.1142/s0129054117400111.

Full text

Abstract:

With the arrival of the era of big data, more and more users begin to adopt public cloud storage to store data and compute data. Sharing large amounts of sensitive data in the public cloud will arouse privacy concerns. Data encryption is a widely accepted method to prevent information leakage. How to achieve the cloud sharing and cloud computing of big data is a challenging problem. Conditional proxy re-encryption can solve cloud sharing, and homomorphic encryption can achieve cloud computing. In this paper, we combine conditional proxy re-encryption with homomorphic encryption to construct a

APA, Harvard, Vancouver, ISO, and other styles

20

Zhao, You, Mingyan Yan, Kaien Yan, and Juyan Li. "Lattice-Based Revocable Certificateless Public Key Encryption for Team Score Orienteering." Mathematics 12, no. 11 (2024): 1706. http://dx.doi.org/10.3390/math12111706.

Full text

Abstract:

Team score orienteering, a challenging and interesting sport, is gradually becoming known by the majority of sports enthusiasts. Integrating team score orienteering with the Internet can enhance the interactive experience for athletes. However, this integration increases the risk of the leakage of the athletes’ information. In order to protect the privacy of athletes, it is necessary to employ encryption. Therefore, this paper proposes an efficient lattice-based revocable certificateless public key encryption (RCL-PKE) scheme with decryption key exposure resistance (DKER). The adoption of cert

APA, Harvard, Vancouver, ISO, and other styles

21

Jiang, M. M., Y. P. Hu, B. C. Wang, F. H. Wang, and Q. Q. Lai. "Lattice-based multi-use unidirectional proxy re-encryption." Security and Communication Networks 8, no. 18 (2015): 3796–803. http://dx.doi.org/10.1002/sec.1300.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Liu, Yuan, Licheng Wang, Xiaoying Shen, and Lixiang Li. "New Constructions of Identity-Based Dual Receiver Encryption from Lattices." Entropy 22, no. 6 (2020): 599. http://dx.doi.org/10.3390/e22060599.

Full text

Abstract:

Dual receiver encryption (DRE), being originally conceived at CCS 2004 as a proof technique, enables a ciphertext to be decrypted to the same plaintext by two different but dual receivers and becomes popular recently due to itself useful application potentials such secure outsourcing, trusted third party supervising, client puzzling, etc. Identity-based DRE (IB-DRE) further combines the bilateral advantages/facilities of DRE and identity-based encryption (IBE). Most previous constructions of IB-DRE are based on bilinear pairings, and thus suffers from known quantum algorithmic attacks. It is i

APA, Harvard, Vancouver, ISO, and other styles

23

Li, Juyan, Zhiqi Qiao, Kejia Zhang, and Chen Cui. "A Lattice-Based Homomorphic Proxy Re-Encryption Scheme with Strong Anti-Collusion for Cloud Computing." Sensors 21, no. 1 (2021): 288. http://dx.doi.org/10.3390/s21010288.

Full text

Abstract:

The homomorphic proxy re-encryption scheme combines the characteristics of a homomorphic encryption scheme and proxy re-encryption scheme. The proxy can not only convert a ciphertext of the delegator into a ciphertext of the delegatee, but also can homomorphically calculate the original ciphertext and re-encryption ciphertext belonging to the same user, so it is especially suitable for cloud computing. Yin et al. put forward the concept of a strong collusion attack on a proxy re-encryption scheme, and carried out a strong collusion attack on the scheme through an example. The existing homomorp

APA, Harvard, Vancouver, ISO, and other styles

24

K. Aruna Kumari. "Cryptographic Algorithms and Computational Complexity: A Mathematical Approach to Securing IT Networks." Journal of Information Systems Engineering and Management 10, no. 25s (2025): 409–20. https://doi.org/10.52783/jisem.v10i25s.4037.

Full text

Abstract:

Cryptographic algorithms are at the core of IT network protection through data confidentiality, integrity, and authentication. This study explores the computational efficiency and complexity of four cryptographic algorithms: Advanced Encryption Standard (AES), Rivest-Shamir-Adleman (RSA), Lattice-Based Cryptography (LBC), and Hyperelliptic Curve Cryptography (HECC). The investigation compares these algorithms using encryption time, decryption time, key generation time, and security strength. Experiment outcome shows that AES has the optimal encryption time of 2.3 ms for real-time applicability

APA, Harvard, Vancouver, ISO, and other styles

25

Wang, Ziwei, Ruwei Huang, and Xiyi Wei. "A Compact Multi-Identity Fully Homomorphic Encryption Scheme Without Fresh Ciphertexts." Applied Sciences 15, no. 1 (2025): 473. https://doi.org/10.3390/app15010473.

Full text

Abstract:

The lattice-based multi-identity fully homomorphic encryption scheme combines the quantum security of lattice cryptography with the advantage of identity-based encryption. However, existing schemes face challenges such as large key sizes, inefficient ciphertext expansion processes, and reliance on outdated trapdoor designs, limiting their compactness and practicality. In this study, we propose a novel Compact Multi-Identity Fully Homomorphic Encryption Scheme (WZ-MIBFHE) that eliminates the need for fresh ciphertexts during expansion. First, we construct a compact identity-based encryption sch

APA, Harvard, Vancouver, ISO, and other styles

26

Zhang, Hongyi, Mengxue Shang, Hanzhuo Liu, and Dandan Zhang. "Lattice-Based Multi-Key Homomorphic Encryption Scheme Without Common Random Strings." Symmetry 17, no. 5 (2025): 722. https://doi.org/10.3390/sym17050722.

Full text

Abstract:

Multi-key homomorphic encryption is widely applied into outsourced computing and privacy-preserving applications in multi-user scenarios. However, the existence of Common Random Strings (CRSs) weakens the ability of users to independently generate public keys, and it is difficult to implement in decentralized systems or scenarios with low trust requirements. In order to reduce excessive reliance on public parameters, a multi-key homomorphic encryption scheme without pre-setting CRSs is proposed based on a distributed key generation protocol. The proposed scheme does not require the pre-generat

APA, Harvard, Vancouver, ISO, and other styles

27

Dong, Xingting, Yanhua Zhang, Baocang Wang, and Jiangshan Chen. "Server-Aided Revocable Attribute-Based Encryption from Lattices." Security and Communication Networks 2020 (February 12, 2020): 1–13. http://dx.doi.org/10.1155/2020/1460531.

Full text

Abstract:

Attribute-based encryption (ABE) can support a fine-grained access control to encrypted data. When the user’s secret-key is compromised, the ABE system has to revoke its decryption privileges to prevent the leakage of encrypted data. Although there are many constructions about revocable ABE from bilinear maps, the situation with lattice-based constructions is less satisfactory, and a few efforts were made to close this gap. In this work, we propose the first lattice-based server-aided revocable attribute-based encryption (SR-ABE) scheme and thus the first such construction that is believed to

APA, Harvard, Vancouver, ISO, and other styles

28

Singh, Kunwar, C. Pandu Rangan, and A. K. Banerjee. "Lattice-based identity-based resplittable threshold public key encryption scheme." International Journal of Computer Mathematics 93, no. 2 (2014): 289–307. http://dx.doi.org/10.1080/00207160.2014.928286.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

WANG, FENGHE, XU AN WANG, and CHUNXIAO WANG. "Lattice-based Dynamical and Anonymous Broadcast Encryption Scheme for Wireless Ad Hoc Networks." Journal of Interconnection Networks 15, no. 03n04 (2015): 1540005. http://dx.doi.org/10.1142/s0219265915400058.

Full text

Abstract:

A lattice-based broadcast encryption scheme is proposed for ad hoc networks in this paper. The proposed scheme is dynamical and anonymous simultaneously. The achievements of the dynamic and anonymity properties are efficient. In fact, the broadcaster can send the message to any receivers set without any added operations. The anonymity properties of the proposed scheme can protect the identity of an authorized receiver. Both dynamic and anonymity properties are important for broadcast encryption to used in many cases like wireless ad hoc network. The semantic security of the proposed scheme is

APA, Harvard, Vancouver, ISO, and other styles

30

González de la Torre, Miguel Ángel, Luis Hernández Encinas, and Araceli Queiruga-Dios. "Analysis of the FO Transformation in the Lattice-Based Post-Quantum Algorithms." Mathematics 10, no. 16 (2022): 2967. http://dx.doi.org/10.3390/math10162967.

Full text

Abstract:

Newer variants of the Fujisaki–Okamoto transformation are used in most candidates of the third round of the NIST Post-Quantum Cryptography standardization call in the category of public key encryption schemes. These transformations are applied to obtain a highly secure key encapsulation mechanism from a less secure public key encryption scheme. Furthermore, there are five candidates (three finalists and two alternatives) that passed to the third round of the process and whose security is based in lattice problems. This work analyzes the different ways in which the lattice-based candidates of t

APA, Harvard, Vancouver, ISO, and other styles

31

Ling, San, Khoa Nguyen, Huaxiong Wang, and Juanyang Zhang. "Server-Aided Revocable Predicate Encryption: Formalization and Lattice-Based Instantiation." Computer Journal 62, no. 12 (2019): 1849–62. http://dx.doi.org/10.1093/comjnl/bxz079.

Full text

Abstract:

Abstract Efficient user revocation is a necessary but challenging problem in many multi-user cryptosystems. Among known approaches, server-aided revocation yields a promising solution, because it allows to outsource the major workloads of system users to a computationally powerful third party, called the server, whose only requirement is to carry out the computations correctly. Such a revocation mechanism was considered in the settings of identity-based encryption and attribute-based encryption by Qin et al. (2015, ESORICS) and Cui et al. (2016, ESORICS ), respectively. In this work, we consid

APA, Harvard, Vancouver, ISO, and other styles

32

Song, Kyunghwan, and Yun Am Seo. "A Study on the Average Number of LLL-based Using Statistical Learning." International Journal on Advanced Science, Engineering and Information Technology 14, no. 3 (2024): 906–11. http://dx.doi.org/10.18517/ijaseit.14.3.19890.

Full text

Abstract:

Lattice-based Cryptography is known as one of the key technologies in modern cryptography. This encryption scheme has the basis vectors from the lattice as the public key and a short-length vector in the lattice consisting of an integer combination of the basis vectors as the secret key. To break this encryption, we need to solve the Shortest Vector Problem (SVP), known as NP-hard. Therefore, instead of finding the shortest vector, LLL algorithm is often used to find a vector of sufficiently short length to break the encryption. The LLL algorithm is a well-known method for breaking this encryp

APA, Harvard, Vancouver, ISO, and other styles

33

Adeyemi Afolayan Adesola, Awele Mary-rose Ilusanmi, and Peter Chimee. "A review of the cryptographic approaches to data security: The impact of quantum computing, evolving challenges and future solutions." World Journal of Advanced Research and Reviews 25, no. 2 (2025): 1916–24. https://doi.org/10.30574/wjarr.2025.25.2.0434.

Full text

Abstract:

Cryptography plays a fundamental role in defending digital data against cyberthreats and emerging quantum computer capabilities. This review discusses core cryptographic techniques such as symmetric encryption, asymmetric encryption and cryptographic hashing, as well as advanced techniques like lattice-based cryptography , code-based cryptography, multi-variate polynomial cryptography and hash-based cryptography that are quantum resistant. The review share insight into the applications of cryptographic techniques in securing communications, encrypting databases, blockchain technology, and heal

APA, Harvard, Vancouver, ISO, and other styles

34

Zhang, Xiaojun, Chunxiang Xu, Liming Mu, and Jie Zhao. "Identity-based encryption with keyword search from lattice assumption." China Communications 15, no. 4 (2018): 164–78. http://dx.doi.org/10.1109/cc.2018.8357694.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Yao, Yanqing, Zhengde Zhai, Jianwei Liu, and Zhoujun Li. "Lattice-Based Key-Aggregate (Searchable) Encryption in Cloud Storage." IEEE Access 7 (2019): 164544–55. http://dx.doi.org/10.1109/access.2019.2952163.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Solé, P., C. Charnes, and B. Martin. "A lattice-based McEliece scheme for encryption and signature." Electronic Notes in Discrete Mathematics 6 (April 2001): 402–11. http://dx.doi.org/10.1016/s1571-0653(04)00192-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Behnia, Rouzbeh, Muslum Ozgur Ozmen, and Attila Altay Yavuz. "Lattice-Based Public Key Searchable Encryption from Experimental Perspectives." IEEE Transactions on Dependable and Secure Computing 17, no. 6 (2020): 1269–82. http://dx.doi.org/10.1109/tdsc.2018.2867462.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Wei, Yuchong. "A Survey of Lattice Cryptography." Applied and Computational Engineering 135, no. 1 (2025): 210–16. https://doi.org/10.54254/2755-2721/2025.21190.

Full text

Abstract:

Lattice cryptography has become one of the focal points in the era of quantum computing development. RSA and ECC, traditional public key cryptosystems, may become insecure in the face of quantum computers. In contrast, lattice cryptography is considered a potential solution for cryptographic security in the quantum computing age due to its inherent mathematical problems that require the use of quantum computers to solve. Moreover, lattice cryptographic algorithms can achieve efficient encryption and decryption processes and support a variety of cryptographic constructions, including encryption

APA, Harvard, Vancouver, ISO, and other styles

39

Del Rey, A. Martín, and G. Rodríguez Sánchez. "An image encryption algorithm based on 3D cellular automata and chaotic maps." International Journal of Modern Physics C 26, no. 01 (2015): 1450069. http://dx.doi.org/10.1142/s0129183114500697.

Full text

Abstract:

A novel encryption algorithm to cipher digital images is presented in this work. The digital image is rendering into a three-dimensional (3D) lattice and the protocol consists of two phases: the confusion phase where 24 chaotic Cat maps are applied and the diffusion phase where a 3D cellular automata is evolved. The encryption method is shown to be secure against the most important cryptanalytic attacks.

APA, Harvard, Vancouver, ISO, and other styles

40

Shangzhe, Zhang. "Theoretical Research on Encryption Methods Based on Quantum Computing and Quantum-Resistant Attack Algorithm." 国际科技促进 International Science & Technology Advancement 1, no. 1 (2025): 23–26. https://doi.org/10.63385/spij.v1.i1.74.

Full text

Abstract:

This paper explores the impact of quantum computing on modern information security technologies, especially the threat to traditional encryption methods. The parallel processing capability of quantum computing and Shor algorithm make traditional encryption methods face the risk of being cracked. To address this challenge, this paper introduces novel cryptographic methods based on quantum computing, including quantum walking (QW) and quantum entanglement based cryptographic schemes, as well as quantum attack-resistant cryptographic algorithms (PQC). The computing principles, advantages and disa

APA, Harvard, Vancouver, ISO, and other styles

41

Chen, Qihong, Mingming Jiang, Yuyan Guo, Dongbing Zhang, Weina Jia, and Wen Zheng. "Efficient Multibit Function Encryption for Data Security in Internet of Things." Security and Communication Networks 2022 (April 14, 2022): 1–10. http://dx.doi.org/10.1155/2022/3227712.

Full text

Abstract:

The development of the Internet of Things (IoT) has been facing severe security threats, and the security and fine-grained access control of data in the IoT is one of the security problems that urgently need to deal with. Attribute-based encryption (ABE) schemes over lattice can not only achieve fine-grained access control but also resist quantum attacks. However, most schemes are single-bit encryption, which is inefficient. In this study, a multibit inner product predicate encryption (PE) scheme over lattice is proposed, which effectively expands the plaintext space. The scheme can realize mu

APA, Harvard, Vancouver, ISO, and other styles

42

Lv, Xiupin, Xiaofeng Liao, and Bo Yang. "Bit-level plane image encryption based on coupled map lattice with time-varying delay." Modern Physics Letters B 32, no. 10 (2018): 1850124. http://dx.doi.org/10.1142/s0217984918501245.

Full text

Abstract:

Most of the existing image encryption algorithms had two basic properties: confusion and diffusion in a pixel-level plane based on various chaotic systems. Actually, permutation in a pixel-level plane could not change the statistical characteristics of an image, and many of the existing color image encryption schemes utilized the same method to encrypt R, G and B components, which means that the three color components of a color image are processed three times independently. Additionally, dynamical performance of a single chaotic system degrades greatly with finite precisions in computer simul

APA, Harvard, Vancouver, ISO, and other styles

43

Abusham, Eimad, Basil Ibrahim, Kashif Zia, and Sanad Al Maskari. "An Integration of New Digital Image Scrambling Technique on PCA-Based Face Recognition System." Scientific Programming 2022 (November 25, 2022): 1–17. http://dx.doi.org/10.1155/2022/2628885.

Full text

Abstract:

Systems using biometric authentication offer greater security than traditional textual and graphical password-based systems for granting access to information systems. Although biometric-based authentication has its benefits, it can be vulnerable to spoofing attacks. Those vulnerabilities are inherent to any biometric-based subsystem, including face recognition systems. The problem of spoofing attacks on face recognition systems is addressed here by integrating a newly developed image encryption model onto the principal component pipeline. A new model of image encryption is based on a cellular

APA, Harvard, Vancouver, ISO, and other styles

44

Luo, Fucai, and Saif Al-Kuwari. "Revocable attribute-based proxy re-encryption." Journal of Mathematical Cryptology 15, no. 1 (2021): 465–82. http://dx.doi.org/10.1515/jmc-2020-0039.

Full text

Abstract:

Abstract Attribute-based proxy re-encryption (ABPRE), which combines the notions of proxy re-encryption (PRE) and attribute-based encryption (ABE), allows a semi-trusted proxy with re-encryption key to transform a ciphertext under a particular access policy into a ciphertext under another access policy, without revealing any information about the underlying plaintext. This primitive is very useful in applications where encrypted data need to be stored in untrusted environments, such as cloud storage. In many practical applications, and in order to address scenarios where users misbehave or the

APA, Harvard, Vancouver, ISO, and other styles

45

Chillali, Abdelhakim, Mohammed Elhassani, and Ali Mouhib. "Cryptosystem based on lattice and elliptic curve." Gulf Journal of Mathematics 8, no. 2 (2020): 27–34. http://dx.doi.org/10.56947/gjom.v8i2.362.

Full text

Abstract:

In this work, we propose a new way to use lattice theory to build a public key cryptosystem and digital signature scheme. This cryptosystem based on the approximate closest vector problem and the problem of the discrete logarithm on an elliptic curve defined on a finite local ring. At first, we choose a point on the elliptic curve and we will make the exchange of keys to the Diffie-Hellman. We transform the coordinates of this point into a matrix which gives us the private key which will serve us for encryption and decryption.

APA, Harvard, Vancouver, ISO, and other styles

46

He, Hong, Hong Dong, Tong Yang, Lin He, and Yi Wu. "A Design of a Method of Chaos-Based Secure Communication." Advanced Materials Research 204-210 (February 2011): 508–11. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.508.

Full text

Abstract:

In resent years, secure communication is becoming one of the study hotspot in information safety. Secure communication is a way of correspondence, which transmits the desired information in the channel by adopting encryption measure, and then carries on decryption in receiver to recover the messages. Chaotic encryption is making use of random-like characteristic of the chaotic signal to encrypt the plaintext, and secure the real time communication. Taking one sine and square wave signal for examples respectively, the information can be encrypted by using the model of one-way coupled map lattic

APA, Harvard, Vancouver, ISO, and other styles

47

WANG, XING-YUAN, and TIAN WANG. "A NOVEL ALGORITHM FOR IMAGE ENCRYPTION BASED ON COUPLE CHAOTIC SYSTEMS." International Journal of Modern Physics B 26, no. 30 (2012): 1250175. http://dx.doi.org/10.1142/s0217979212501755.

Full text

Abstract:

In this paper, an image encryption algorithm based on couple multiple chaotic systems is presented. It made the one-dimensional Coupled Map Lattice (CML) formed by Skew Tent map as spatiotemporal chaotic system and made its output sequence as the initial value of logistic and meanwhile did iterative of specific times to get the final key sequence, and then did XOR operations with corresponding pixels to finish the encryption. Numerical analysis expresses that this algorithm has large enough space and high security.

APA, Harvard, Vancouver, ISO, and other styles

48

Chadrakala and C. Lingareddy S. "Secure and Efficient Bi-Directional Proxy Re-Encyrption Technique." Indonesian Journal of Electrical Engineering and Computer Science 12, no. 3 (2018): 1143–50. https://doi.org/10.11591/ijeecs.v12.i3.pp1143-1150.

Full text

Abstract:

The low cost availability of smart devices and broadband connection has led to rapid growth of communication over Internet. As of today the internet based communication service is widely used in various application services such as in E-Mail transaction of sensitive data (medical data), online money transaction etc. all these services requires a strong security. There has been continuous ongoing research by various cryptanalyst to enhance security of cryptography especially in semi-untrusted server. However, performance, computation time and ease of use play a significant role in using the alg

APA, Harvard, Vancouver, ISO, and other styles

49

Yan, Jianhua, Licheng Wang, Lihua Wang, Yixian Yang, and Wenbin Yao. "Efficient Lattice-Based Signcryption in Standard Model." Mathematical Problems in Engineering 2013 (2013): 1–18. http://dx.doi.org/10.1155/2013/702539.

Full text

Abstract:

Signcryption is a cryptographic primitive that can perform digital signature and public encryption simultaneously at a significantly reduced cost. This advantage makes it highly useful in many applications. However, most existing signcryption schemes are seriously challenged by the booming of quantum computations. As an interesting stepping stone in the post-quantum cryptographic community, two lattice-based signcryption schemes were proposed recently. But both of them were merely proved to be secure in the random oracle models. Therefore, the main contribution of this paper is to propose a ne

APA, Harvard, Vancouver, ISO, and other styles

50

Yu, Xiaoling, Chungen Xu, Lei Xu, and Yuntao Wang. "Lattice-Based Searchable Encryption Scheme Against Inside Keywords Guessing Attack." Computers, Materials & Continua 64, no. 2 (2020): 1107–25. http://dx.doi.org/10.32604/cmc.2020.09680.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!