Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key

DOI10.1016/j.jcss.2021.03.008zbMath1481.94137OpenAlexW3152663981MaRDI QIDQ2037197

Jin Li, Siuming Yiu, Wenbin Chen, Zoe L. Jiang, Chongzhi Gao, Zhengan Huang

Publication date: 30 June 2021

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2021.03.008

zbMATH Keywords

latticerandom oracle modelproxy re-signatureprivate re-signature key

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Leveled strongly-unforgeable identity-based fully homomorphic signatures
• Identity-based proxy re-signatures from lattices
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
• Homomorphic Signatures for Polynomial Functions
• Proxy Re-signatures in the Standard Model
• Trapdoors for hard lattices and new cryptographic constructions
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• An Efficient and Parallel Gaussian Sampler for Lattices
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Efficient Identity-Based Encryption Without Random Oracles
• Generating Shorter Bases for Hard Random Lattices
• Proxy Re-signature Schemes Without Random Oracles