Lattice-based HRA-secure attribute-based proxy re-encryption in standard model

DOI10.1007/978-3-030-88428-4_9MaRDI QIDQ2148757zbMATH OpenOpenAlexFDO

Authors Willy Susilo, Priyanka Dutta, Dung Hoang Duong, Partha Sarathi Roy

Publication date 24 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-88428-4_9

zbMATH Keywords

learning with errorsattribute-based encryptionproxy re-encryptionHRA security

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer security (68M25)

Recommendations

• Attribute-based proxy re-encryption from standard lattices
• Attribute-based conditional proxy re-encryption in the standard model under LWE
• Efficient attribute-based proxy re-encryption with constant size ciphertexts
• Key-private proxy re-encryption under LWE
• Proxy re-encryption in a stronger security model extended from CT-RSA2012

Cites work

• scientific article; zbMATH DE number 1303118 (Why is no real title available?)
• scientific article; zbMATH DE number 1341870 (Why is no real title available?)
• scientific article; zbMATH DE number 1405637 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• A CCA-secure key-policy attribute-based proxy re-encryption in the adaptive corruption model for dropbox data sharing system
• Adaptively secure proxy re-encryption
• Bonsai trees, or how to delegate a lattice basis
• Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
• Classical hardness of learning with errors
• Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model
• Efficient lattice (H)IBE in the standard model
• Fully homomorphic encryption using ideal lattices
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
• Functional Re-encryption and Collusion-Resistant Obfuscation
• Generating shorter bases for hard random lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Improved proxy re-encryption schemes with applications to secure distributed storage
• Obfuscation of probabilistic circuits and applications
• On lattices, learning with errors, random linear codes, and cryptography
• Public-key cryptosystems from the worst-case shortest vector problem
• Securely Obfuscating Re-encryption
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Universal proxy re-encryption
• What about Bob? The inadequacy of CPA security for proxy reencryption

Cited in

(5)

• Zero-knowledge range arguments for signed fractional numbers from lattices
• Fine-grained proxy re-encryption: definitions and constructions from LWE
• HRA-secure attribute-based threshold proxy re-encryption from lattices
• Attribute-based proxy re-encryption from standard lattices
• Time-based attribute-based proxy re-encryption with decryption key update

This page was built for publication: Lattice-based HRA-secure attribute-based proxy re-encryption in standard model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148757)