A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds
From MaRDI portal
Publication:2988852
DOI10.1007/978-3-319-55911-7_42zbMATH Open1462.94047OpenAlexW2601648491MaRDI QIDQ2988852FDOQ2988852
Authors: Maciej Skórski 
Publication date: 19 May 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_42
Recommendations
- Limits of a conjecture on a leakage-resilient cryptosystem
- A uniform-complexity treatment of encryption and zero-knowledge
- A uniform min-max theorem with applications in cryptography
- On the power of nonuniformity in proofs of security
- A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- scientific article; zbMATH DE number 1759457
- Leakage-resilient cryptography over large finite fields: theory and practice
- Regular lossy functions and their applications in leakage-resilient cryptography
- Number theoretic methods in cryptography. Complexity lower bounds
boostingconvex optimizationregularity lemmascomputational indistinguishabilitylow-complexity approximations
Cites Work
- Quick approximation to matrices and applications
- Szemerédi's lemma for the analyst
- A uniform min-max theorem with applications in cryptography
- How to fake auxiliary input
- Lower bounds of tower type for Szemerédi's uniformity lemma
- A simple algorithm for constructing Szemerédi's regularity partition
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
This page was built for publication: A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988852)
