Relevant bibliographies by topics / Lattice based encryption

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Lattice based encryption"

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
More sources

Dissertations / Theses on the topic "Lattice based encryption"

1

Xia, Andrew. "Thresholdizing lattice based encryption schemes." Thesis, Massachusetts Institute of Technology, 2018. https://hdl.handle.net/1721.1/121688.

Full text
Abstract:
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 77-80).<br>In this thesis, we examine a variety of constructions based on secret sharing techniques applied on lattice-based cryptographic primitives constructed from the learning with erros (LWE) assumption. Using secret shar
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Qinyi. "Lattice public-key encryption: Richer, tighter, stronger." Thesis, Queensland University of Technology, 2017. https://eprints.qut.edu.au/107651/1/Qinyi_Li_Thesis.pdf.

Full text
Abstract:
Public-key encryption allows anyone to encrypt messages that only the intended recipient can decrypt. It is an essential component of most network security protocols; however, the algorithms in widespread use are inherently vulnerable to attacks by quantum computers, should they become a practical reality. This thesis looks at public-key encryption from computationally hard problems based on high-dimensional lattices, believed to resist classical and quantum attacks. On those foundations, it proposes three post-quantum public-key encryption schemes, respectively featuring richer access control
APA, Harvard, Vancouver, ISO, and other styles
3

Magalhães, Karina Mochetti de 1982. "Lattice-based predicate encryption = Encriptação com predicados baseada em reticulados." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275543.

Full text
Abstract:
Orientadores: Ricardo Dahab, Michel Abdalla<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-27T04:48:10Z (GMT). No. of bitstreams: 1 Magalhaes_KarinaMochettide_D.pdf: 1527439 bytes, checksum: bde8a4343d856fa31a8cd9e9f0b1d2b7 (MD5) Previous issue date: 2014<br>Resumo: Em um sistema de criptografia funcional, uma autoridade de posse de uma chave mestra pode gerar uma chave secreta que permite o cálculo de uma função sobre a mensagem nos dados criptografados. Assim, é possível calcular tal função no texto cifrado usando som
APA, Harvard, Vancouver, ISO, and other styles
4

Chinthamani, Dwarakanath Nagarjun. "Theoretical and practical contributions to homomorphic encryption." Electronic Thesis or Diss., université Paris-Saclay, 2021. http://www.theses.fr/2021UPASG103.

Full text
Abstract:
Dans les schémas de chiffrement classique, l'objectif principal du schéma est d'assurer la confidentialité des données. Le chiffrement totalement homomorphe, une variante réalisée pour la première fois par Gentry, est un schéma de chiffrement qui permet également le calcul sur les données chiffrées, sans jamais avoir besoin de les déchiffrer. En l'utilisant, tout tiers non fiable avec le matériel de clé pertinent peut effectuer des calculs homomorphes, conduisant à de nombreuses applications où un tiers non fiable peut toujours être autorisée à calculer sur des chiffrements de données sensible
APA, Harvard, Vancouver, ISO, and other styles
5

Prest, Thomas. "Gaussian sampling in lattice-based cryptography." Thesis, Paris, Ecole normale supérieure, 2015. http://www.theses.fr/2015ENSU0045/document.

Full text
Abstract:
Bien que relativement récente, la cryptographie à base de réseaux euclidiens s’est distinguée sur de nombreux points, que ce soit par la richesse des constructions qu’elle permet, par sa résistance supposée à l’avènement des ordinateursquantiques ou par la rapidité dont elle fait preuve lorsqu’instanciée sur certaines classes de réseaux. Un des outils les plus puissants de la cryptographie sur les réseaux est le Gaussian sampling. À très haut niveau, il permet de prouver qu’on connaît une base particulière d’un réseau, et ce sans dévoiler la moindre information sur cette base. Il permet de réa
APA, Harvard, Vancouver, ISO, and other styles
6

Minelli, Michele. "Fully homomorphic encryption for machine learning." Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLEE056/document.

Full text
Abstract:
Le chiffrement totalement homomorphe permet d’effectuer des calculs sur des données chiffrées sans fuite d’information sur celles-ci. Pour résumer, un utilisateur peut chiffrer des données, tandis qu’un serveur, qui n’a pas accès à la clé de déchiffrement, peut appliquer à l’aveugle un algorithme sur ces entrées. Le résultat final est lui aussi chiffré, et il ne peut être lu que par l’utilisateur qui possède la clé secrète. Dans cette thèse, nous présentons des nouvelles techniques et constructions pour le chiffrement totalement homomorphe qui sont motivées par des applications en apprentissag
APA, Harvard, Vancouver, ISO, and other styles
7

Lippold, Georg. "Encryption schemes and key exchange protocols in the certificateless setting." Thesis, Queensland University of Technology, 2010. https://eprints.qut.edu.au/41697/1/Georg_Lippold_Thesis.pdf.

Full text
Abstract:
The contributions of this thesis fall into three areas of certificateless cryptography. The first area is encryption, where we propose new constructions for both identity-based and certificateless cryptography. We construct an n-out-of- n group encryption scheme for identity-based cryptography that does not require any special means to generate the keys of the trusted authorities that are participating. We also introduce a new security definition for chosen ciphertext secure multi-key encryption. We prove that our construction is secure as long as at least one authority is uncompromised, and s
APA, Harvard, Vancouver, ISO, and other styles
8

Ricosset, Thomas. "Lattice-based digital signature and discrete gaussian sampling." Phd thesis, 2018. http://oatao.univ-toulouse.fr/23886/1/ricosset.pdf.

Full text
Abstract:
Lattice-based cryptography has generated considerable interest in the last two decades due toattractive features, including conjectured security against quantum attacks, strong securityguarantees from worst-case hardness assumptions and constructions of fully homomorphicencryption schemes. On the other hand, even though it is a crucial part of many lattice-basedschemes, Gaussian sampling is still lagging and continues to limit the effectiveness of this newcryptography. The first goal of this thesis is to improve the efficiency of Gaussian sampling forlattice-based hash-and-sign signature schem
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Pin-Chun, and 陳品君. "A Study of the Applicability of Ideal Lattice-Based Fully Homomorphic Encryption Scheme to Ethereum Blockchain." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/74baqx.

Full text
Abstract:
碩士<br>國立臺灣大學<br>資訊網路與多媒體研究所<br>107<br>Without the requirement of trusted third-parties, Blockchain guarantees an environment which can be trusted to everyone. However, the transparency property caused a hazard to real-world application that every on-chain information can be viewed by every user. That is to say, the application which contains sensitive data and personal information which require privacy protection cannot be implemented into Blockchain. We propose Fully Homomorphic Encryption scheme into Blockchain, combining the trusty and privacy protection, build up a new framework to obtain
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Lattice based encryption"

1

Zhang, Jiang, and Zhenfeng Zhang. "Identity-Based Encryption." In Lattice-Based Cryptosystems. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-8427-5_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Jiang, and Zhenfeng Zhang. "Attribute-Based Encryption." In Lattice-Based Cryptosystems. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-8427-5_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Jiang, and Zhenfeng Zhang. "Public-key Encryption." In Lattice-Based Cryptosystems. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-8427-5_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Georgescu, Adela. "Anonymous Lattice-Based Broadcast Encryption." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36818-9_39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Abdalla, Michel, Angelo De Caro, and Karina Mochetti. "Lattice-Based Hierarchical Inner Product Encryption." In Progress in Cryptology – LATINCRYPT 2012. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33481-8_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bouillaguet, Charles, Claire Delaplace, Pierre-Alain Fouque, and Paul Kirchner. "Fast Lattice-Based Encryption: Stretching Spring." In Post-Quantum Cryptography. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59879-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sinha Roy, Sujoy, and Ingrid Verbauwhede. "Ring-LWE Public Key Encryption Processor." In Lattice-Based Public-Key Cryptography in Hardware. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-32-9994-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Prayesi, Kumari Pragya, Sonal Kumari, Akshay Anand, and Diwakar. "Implementation of lattice-based cryptography cyberforensic system." In Next Generation Mechanisms for Data Encryption. CRC Press, 2024. https://doi.org/10.1201/9781003508632-13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Fan, Chun-I., Zhen-Yu Jia, and Er-Shuo Zhuang. "Lattice-Based Anonymous Multi-Receiver ID-Based Encryption." In 2021 International Conference on Security and Information Technologies with AI, Internet Computing and Big-data Applications. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-05491-4_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Oder, Tobias, Tobias Schneider, and Tim Güneysu. "Secure Implementation of Lattice-Based Encryption Schemes." In Advanced Boolean Techniques. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-20323-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Lattice based encryption"

1

Chen, Abel C. H. "Lattice-Based Post-Quantum Cryptography for Homomorphic Encryption." In 2025 3rd International Conference on Smart Systems for applications in Electrical Sciences (ICSSES). IEEE, 2025. https://doi.org/10.1109/icsses64899.2025.11009905.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Xu, Yinghao Wu, Yang Liu, Baosheng Wang, Bei Wang, and Yijun Cui. "Lattice-based Multi-Stage Secret Sharing 3D Secure Encryption Scheme." In 2024 IEEE 23rd International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom). IEEE, 2024. https://doi.org/10.1109/trustcom63139.2024.00061.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Liang, Yikuan, Yao Hao, Kaijun Wu, and Yuxiang Chen. "Secure Multi-Party Computation on the Encrypted Network: a Lattice-based Multi-Party Homomorphic Encryption Protocol." In 2024 9th International Conference on Communication, Image and Signal Processing (CCISP). IEEE, 2024. https://doi.org/10.1109/ccisp63826.2024.10765563.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Howe, J., C. Moore, M. O'Neill, F. Regazzoni, T. Güneysu, and K. Beeden. "Lattice-based Encryption Over Standard Lattices In Hardware." In DAC '16: The 53rd Annual Design Automation Conference 2016. ACM, 2016. http://dx.doi.org/10.1145/2897937.2898037.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Huiyan, Dongmei Chen, and Yanshuo Zhang. "Efficient Identity-Based Encryption from Lattice." In 2013 International Conference on Information Science and Cloud Computing Companion (ISCC-C). IEEE, 2013. http://dx.doi.org/10.1109/iscc-c.2013.67.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kadykov, Victor, and Alla Levina. "Homomorphic Properties Within Lattice-Based Encryption Systems." In 2021 10th Mediterranean Conference on Embedded Computing (MECO). IEEE, 2021. http://dx.doi.org/10.1109/meco52532.2021.9460165.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Melchor, Carlos Aguilar, Guilhem Castagnos, and Philippe Gaborit. "Lattice-based homomorphic encryption of vector spaces." In 2008 IEEE International Symposium on Information Theory - ISIT. IEEE, 2008. http://dx.doi.org/10.1109/isit.2008.4595310.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Troncoso-Pastoriza, Juan Ramon, Alberto Pedrouzo-Ulloa, and Fernando Perez-Gonzalez. "Secure genomic susceptibility testing based on lattice encryption." In 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2017. http://dx.doi.org/10.1109/icassp.2017.7952520.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Fenghe, Wang, Wang Xuan, and Wang Chunxiao. "Lattice-Based Dynamical and Anonymous Broadcast Encryption Scheme." In 2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC). IEEE, 2015. http://dx.doi.org/10.1109/3pgcic.2015.35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Xuyang, Aiqun Hu, and Hao Fang. "Feasibility Analysis of Lattice-based Proxy Re-Encryption." In the 2017 International Conference. ACM Press, 2017. http://dx.doi.org/10.1145/3058060.3058080.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Lattice based encryption' for particular source types:
Journal articles
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!

To the bibliography