Results 21 to 30 of about 1,743,904 (288)
Revocable attribute-based proxy re-encryption
Journal of Mathematical Cryptology, 2021 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 ...
Luo Fucai, Al-Kuwari Saif
doaj +1 more source
Attribute-Based Verifiable Conditional Proxy Re-Encryption Scheme
Entropy, 2023 There are mostly semi-honest agents in cloud computing, so agents may perform unreliable calculations during the actual execution process. In this paper, an attribute-based verifiable conditional proxy re-encryption (AB-VCPRE) scheme using a homomorphic ...
Yongli Tang +4 more
doaj +1 more source
Ring Learning With Errors: A crossroads between postquantum cryptography, machine learning and number theory [PDF]
, 2020 The present survey reports on the state of the art of the different cryptographic functionalities built upon the ring learning with errors problem and its interplay with several classical problems in algebraic number theory.
Chacón, Iván Blanco
core +2 more sources
Classical hardness of learning with errors [PDF]
Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013 Preliminary version in STOC ...
Brakerski, Zvika +4 more
openaire +3 more sources
On the Possibility of Classical Client Blind Quantum Computing
Cryptography, 2021 Classical client remote state preparation (CC − RSP) is a primitive where a fully classical party (client) can instruct the preparation of a sequence of random quantum states on some distant party (server) in a way that the description is known to the ...
Alexandru Cojocaru +3 more
doaj +1 more source
Revocable Cryptography from Learning with Errors
, 2023 92 pages. Revised version.
Prabhanjan Ananth +2 more
openaire +2 more sources
, 2022 AbstractLearning with error was proposed by O. Regev in 2005 (see Regev, 2009), which can be regarded as a dual form of SIS problem. LWE has very important applications in modern cryptography, such as LWE-based fully homomorphic encryption. The main purpose of this chapter is to explain the mathematical principles of the LWE problem in detail ...
Zhiyong Zheng, Kun Tian, Fengxia Liu
openaire +1 more source
New Constructions of Identity-Based Dual Receiver Encryption from Lattices
Entropy, 2020 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 ...
Yuan Liu +3 more
doaj +1 more source
A Mathematical Perspective on Post-Quantum Cryptography
Mathematics, 2022 In 2016, the National Institute of Standards and Technology (NIST) announced an open competition with the goal of finding and standardizing suitable algorithms for quantum-resistant cryptography.
Maximilian Richter +3 more
doaj +1 more source
Learning with Physical Noise or Errors [PDF]
IEEE Transactions on Dependable and Secure Computing, 2020 Hard learning problems have recently attracted significant attention within the cryptographic community, both as a versatile assumption on which to build various protocols, and as a potentially sound basis for lightweight (possibly side-channel and fault resistant) implementations.
Dina Kamel +4 more
openaire +3 more sources