Latest Breaking News On - Learning with errors - Page 1 : comparemela.com

A High-Level Technical Overview of Fully Homomorphic Encryption

About two years ago, I switched teams at Google to focus on fully homomorphic encryption (abbreviated FHE, or sometimes HE). Since then I’ve got to work on a lot of interesting projects, learning along the way about post-quantum cryptography, compiler design, and the ins and outs of fully homomorphic encryption. If you’ve heard about FHE and you’re a software person, you’ve probably heard two things: it lets you run programs directly on encrypted data without ever decrypting it; and it’s still too slow to be useful for anything.

Finn plummerJeffrey sorensenJean philippe bossuatDaniel lowengrubMarc joyeHomomorphic encryption standardization consortiumLearning with errorsRing learning with errorsChinese remainder theoremBeyond schemesFourier transformFully homomorphic encryptionJonathan schneiderSeonhong minJohannes monoFully homomorphic encryption

Indistinguishability Obfuscation from Well-Founded Assumptions

Indistinguishability Obfuscation from Well-Founded Assumptions
acm.org - get the latest breaking news, showbiz & celebrity photos, sport news & rumours, viral videos and top stories from acm.org Daily Mail and Mail on Sunday newspapers.

Amit sahaiAayush jainHuijia linAcm incAssociation for computing machineryDigital libraryComputer societyGroup operationWhite box cryptographyLearning parityBoolean pseudo random generatorDecision linearDecisional linearIdentity based encryptionAttribute based encryptionFunctional encryption

"A lattice-based public key encryption scheme with delegated equality t" by Kaifeng Xiao, Xinjian Chen et al.

When data security is facing growing threats, ordinary encryption techniques cannot meet the needs of comparing, sharing, and classifying data hidden in ciphertexts. At the same time, the advent of the quantum computing era has brought unprecedented challenges to traditional cryptography. Fortunately, a lattice-based PKEET scheme can solve the above problems. In this paper, we design a lattice-based PKE-DET scheme that can support the delegated tester function with satisfying anti-quantum computing security and resisting OMRA attacks. To the best of our knowledge, this is the first PKE-DET scheme that has both kinds of security at the same time. Under the standard model, we prove the security of the scheme based on the LWE hardness assumption. Compared with existing schemes, our scheme has many advantages, such as high security, delegated tester authorization, and small storage space.

Equality testLearning with errorsFfline message recovery attackPost quantum securityPublic key encryption

"A fully secure lattice-based signcryption with designated equality tes" by Kaifeng Xiao, Xinjian Chen et al.

In hospital information systems, large volumes of electronic diagnostic records (EDRs) take up most of the storage space. While cloud server providers can reduce the local storage burden on hospitals and provide data-sharing services, the potential threat of sensitive data leakage and non-traceability of diagnoses prevents hospitals from uploading patients' diagnostic records to remote cloud servers directly. Therefore, to address security and traceability issues, we propose a new construction of post-quantum secure signcryption scheme with a designated equality test based on lattices (LB-SCDET) in this paper. Our LB-SCDET scheme allows a designated tester to perform equality tests on signcrypt-ciphertexts of EDRs without leaking what the EDRs actually are. Compared to the recent LB-SCET scheme proposed by Le et al., our LB-SCDET scheme implements a designated mechanism and is secure against offline message recovery attacks (OMRA). The comparison shows that our scheme enjoys a hig

Designated equality testLectronic diagnostic recordsLearning with errorsFfline message recovery attackShort integer solution

"Spatial Encryption Revisited: From Delegatable Multiple Inner Product " by Huy Quoc Le, Dung Hoang Duong et al.

Spatial encryption (SE), which involves encryption and decryption with affine/vector objects, was introduced by Boneh and Hamburg at Asiacrypt 2008. Since its introduction, SE has been shown as a versatile and elegant tool for implementing many other important primitives such as (Hierarchical) Identity-based Encryption ((H)IBE), Broadcast (H)IBE, Attribute-based Encryption, and Forward-secure cryptosystems. This paper revisits SE toward a more compact construction in the lattice setting. In doing that, we introduce a novel primitive called Delegatable Multiple Inner Product Encryption (DMIPE). It is a delegatable generalization of Inner Product Encryption (IPE) but different from the Hierarchical IPE (HIPE) (Okamoto and Takashima at Asiacrypt 2009). We point out that DMIPE and SE are equivalent in the sense that there are security-preserving conversions between them. As a proof of concept, we then successfully instantiate a concrete DMIPE construction relying on the hardness of the dec

Identity based encryptionAttribute based encryptionDelegatable multiple inner product encryptionInner product encryptionAllow deny list encryptionDelegatable multiple inner product encryptionIerarchical inner product encryptionInner product encryptionAttice evaluationAttice trapdoorsLearning with errorsPatial encryption