Candidate One-Way Functions Based on Expander Graphs (Q3088178): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Public-key cryptography from different assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography in $NC^0$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators in Propositional Proof Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Security of Goldreich’s One-Way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit constructions of linear-sized superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank

Latest revision as of 09:25, 4 July 2024

scientific article
Language Label Description Also known as
English
Candidate One-Way Functions Based on Expander Graphs
scientific article

    Statements

    Identifiers