Inner-product functional encryption from random linear codes: trial and challenges
From MaRDI portal
Publication:2697925
DOI10.1007/978-3-030-90402-9_14OpenAlexW3210400152MaRDI QIDQ2697925
Fangguo Zhang, Zhuoran Zhang, Zheng Zhang
Publication date: 13 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90402-9_14
Linear codes (general theory) (94B05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Uses Software
Cites Work
- Unnamed Item
- Function-hiding inner product encryption is practical
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Adaptively secure inner product encryption from LWE
- Function-Hiding Inner Product Encryption
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Simple Functional Encryption Schemes for Inner Products
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Functional Encryption: Definitions and Challenges
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Information-Set Decoding for Linear Codes over F q
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- On the inherent intractability of certain coding problems (Corresp.)
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Fuzzy Identity-Based Encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
This page was built for publication: Inner-product functional encryption from random linear codes: trial and challenges
