Explicit non-malleable codes from bipartite graphs
From MaRDI portal
Publication:6169015
DOI10.1007/978-3-031-22944-2_14OpenAlexW4315490049MaRDI QIDQ6169015
Kouichi Sakurai, Shohei Satake, Yujie Gu
Publication date: 10 August 2023
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22944-2_14
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra of graphs
- Eigenvalues and expansion of bipartite graphs
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Ramanujan graphs
- Interlacing eigenvalues and graphs
- Spectra of regular graphs and hypergraphs and orthogonal polynomials
- Large incidence-free sets in geometries
- Linear representations of finite geometries and associated LDPC codes
- Optimal Computational Split-state Non-malleable Codes
- Non-malleable Codes from Two-Source Extractors
- Non-malleable Reductions and Applications
- New Classes of Partial Geometries and Their Associated LDPC Codes
- Explicit Concentrators from Generalized N-Gons
- LDPC Codes From Generalized Polygons
- Leakage-Resilient Storage
- A recursive approach to low complexity codes
- Nonmalleable Cryptography
- Non-Malleable Codes
- Non-Malleable Codes from Additive Combinatorics
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors
- Explicit near-Ramanujan graphs of every degree
- Recent Developments in Low-Density Parity-Check Codes
- Non-malleable extractors and codes, with their many tampered extensions
- On a combinatorial generalization of 27 lines associated with a cubic surface
This page was built for publication: Explicit non-malleable codes from bipartite graphs
