Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1993636.1993661acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article
Free access

From affine to two-source extractors via approximate duality

Published: 06 June 2011 Publication History

Abstract

Two-source and affine extractors and dispersers are fundamental objects studied in the context of derandomization. This paper shows how to construct two-source extractors and dispersers for arbitrarily small min-entropy rate in a black-box manner given affine extractors with sufficiently good parameters. Our analysis relies on the study of approximate duality, a concept related to the polynomial Freiman-Ruzsa conjecture (PFR) from additive combinatorics. Two black-box constructions of two-source extractors from affine ones are presented. Both constructions work for min-entropy rate ρ< 1/2. One of them can potentially reach arbitrarily small min-entropy rate provided the the affine extractor used to construct it outputs, on affine sources of min-entropy rate 1/2, a relatively large number of output bits, and has sufficiently small error.
Our results are obtained by first showing that each of our constructions yields a two-source disperser for a certain min-entropy rate ρ< 1/2 and then using a general extractor-to-disperser reduction that applies to a large family of constructions. This reduction says that any two-source disperser for min-entropy rate ρ coming from this family is also a two-source extractor with constant error for min-entropy rate ρ+ε for arbitrarily small ε>0. We show that assuming the PFR conjecture, the error of this two-source extractor is exponentially small.
The extractor-to-disperser reduction arises from studying approximate duality, a notion related to additive combinatorics. The duality measure of two sets A,B ⊆ F_2n aims to quantify how "close" these sets are to being dual and is defined as [u(A,B)=|Ea ∈ A, b ∈ B[(-1)i=1n ai bi]|] Notice that u(A,B)=1 implies that A is contained in an affine shift of B --- the space dual to the F2span of B. We study what can be said of A,B when their duality measure is large but strictly smaller than 1 and show that A,B contain subsets A',B' of nontrivial size for which u(A',B')=1 and consequently A' is contained in an affine shift of (B'). This implies that our constructions are two-source extractors with constant error. Surprisingly, the PFR implies that such A',B' exist exist when A,B are large, even if the duality measure is exponentially small in $n$, and this implication leads to two-source extractors with exponentially small error.

Supplementary Material

JPG File (stoc_3b_3.jpg)
MP4 File (stoc_3b_3.mp4)

References

[1]
B. Barak, R. Impagliazzo, and A. Wigderson. Extracting randomness using few independent sources. SIAM Journal on Computing, 36(4):1095--1118, 2006. Preliminary version in FOCS' 04.
[2]
B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson. Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors. In Proc. 37th STOC. ACM, 2005.
[3]
B. Barak, A. Rao, R. Shaltiel, and A. Wigderson. 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. In Proc. 38th Symposium on Theory of Computing (STOC), pages 671--680. ACM, 2006.
[4]
E. Ben-Sasson, S. Hoory, E. Rozenman, S. Vadhan, and A. Wigderson. Extractors for afine sources, unpublished manuscript. 2001.
[5]
E. Ben-Sasson and S. Kopparty. Affine dispersers from subspace polynomials. In M. Mitzenmacher, editor, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pages 65--74. ACM, 2009.
[6]
J. Bourgain. More on the sum-product phenomenon in prime fields and its application. International Journal of Number Theory, 1:1--32, 2005.
[7]
J. Bourgain. On the construction of affine extractors. Geometric and Functional Analysis, 17(1):33--57, 2007.
[8]
B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput., 17(2):230--261, 1988.
[9]
M. DeVos and A. Gabizon. Simple affine extractors using dimension expansion. Electronic Colloquium on Computational Complexity (ECCC), (63), 2009.
[10]
P. Erdos. Some remarks on the theory of graphs. B.A.M.S., 53:292--294, 1947.
[11]
G. A. Freiman. Foundations of a structural theory of set addition, volume 37. American Mathematical Society, 1973.
[12]
A. Gabizon and R. Raz. Deterministic extractors for affine sources over large fields. Combinatorica, 28(4):415--440, 2008.
[13]
B. Green. Finite field models in additive combinatorics. In B. S. Webb, editor, Surveys in Combinatorics, number 327 in London Mathematical Society Lecture Note Series, pages 1--27. Cambridge University press, 2005.
[14]
B. Green. Finite field models in additive combinatorics. In London Mathematical Society Lecture Note Series, volume 324. Cambridge University Press, 2005.
[15]
B. Green and T. Tao. A note on the Freiman and Balog{Szemeredi{Gowers theorems in finite fields. Journal of the Australian Mathematical Society, 86(01):61{74, 2009.
[16]
X. Li. A new approach to affine extractors and dispersers. Electronic Colloquium on Computational Complexity (ECCC), (064), 2010.
[17]
P. Pudlak and V. Rodl. Pseudorandom sets and explicit constructions of Ramsey graphs. Quaderni di Matematica, Dipartimanto di Matematica, Seconda Universita di Napoli, Caserta, 13:327{346, 2004.
[18]
A. Rao. An exposition of bourgain's 2-source extractor. In ECCCTR: Electronic Colloquium on Computational Complexity, technical reports, 2007.
[19]
R. Raz. Extractors with weak random seeds. In STOC: ACM Symposium on Theory of Computing (STOC), 2005.
[20]
I. Z. Ruzsa. An analog of Freiman's theorem in groups. Asterique, 258:323--326, 1999.
[21]
R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of the EATCS, 77:67--95, 2002.
[22]
T. Tau and V. Vu. Additive Combinatorics. Cambridge University Press, Cambridge, 2006.
[23]
Y. Tauman Kalai, X. Li, and A. Rao. 2-source extractors under computational assumptions and cryptography with defective randomness. In Proc. 50th Foundations of Computer Science (FOCS). IEEE, 2009.
[24]
A. Yehudayo . Affine extractors over prime fields. 2009.
[25]
D. I. Zuckerman. Computing efficiently using general weak random sources. PhD thesis, University of California, Berkeley, 1991.

Cited By

View all
  • (2017)Towards optimal two-source extractors and Ramsey graphsProceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3055399.3055429(1157-1170)Online publication date: 19-Jun-2017
  • (2016)Extractors for sumset sourcesProceedings of the forty-eighth annual ACM symposium on Theory of Computing10.1145/2897518.2897643(299-311)Online publication date: 19-Jun-2016
  • (2016)The Complexity of DNF of ParitiesProceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science10.1145/2840728.2840734(47-58)Online publication date: 14-Jan-2016
  • Show More Cited By

Index Terms

  1. From affine to two-source extractors via approximate duality

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '11: Proceedings of the forty-third annual ACM symposium on Theory of computing
    June 2011
    840 pages
    ISBN:9781450306911
    DOI:10.1145/1993636
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 06 June 2011

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Ramsey graphs
    2. affine sources
    3. approximate duality
    4. discrepancy
    5. dispersers
    6. extractors
    7. independent sources
    8. polynomial Freiman-Ruzsa conjecture

    Qualifiers

    • Research-article

    Conference

    STOC'11
    Sponsor:
    STOC'11: Symposium on Theory of Computing
    June 6 - 8, 2011
    California, San Jose, USA

    Acceptance Rates

    STOC '11 Paper Acceptance Rate 84 of 304 submissions, 28%;
    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)46
    • Downloads (Last 6 weeks)7
    Reflects downloads up to 25 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2017)Towards optimal two-source extractors and Ramsey graphsProceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3055399.3055429(1157-1170)Online publication date: 19-Jun-2017
    • (2016)Extractors for sumset sourcesProceedings of the forty-eighth annual ACM symposium on Theory of Computing10.1145/2897518.2897643(299-311)Online publication date: 19-Jun-2016
    • (2016)The Complexity of DNF of ParitiesProceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science10.1145/2840728.2840734(47-58)Online publication date: 14-Jan-2016
    • (2016)Communication is Bounded by Root of RankJournal of the ACM10.1145/272470463:1(1-9)Online publication date: 12-Feb-2016
    • (2016) Revisiting the Sanders-Bogolyubov-Ruzsa theorem in Fp n and its application to non-malleable codes 2016 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT.2016.7541513(1322-1326)Online publication date: Jul-2016
    • (2016)On Public Key Encryption from Noisy CodewordsProceedings, Part II, of the 19th IACR International Conference on Public-Key Cryptography --- PKC 2016 - Volume 961510.1007/978-3-662-49387-8_16(417-446)Online publication date: 6-Mar-2016
    • (2014)An Additive Combinatorics Approach Relating Rank to Communication ComplexityJournal of the ACM10.1145/262959861:4(1-18)Online publication date: 1-Jul-2014
    • (2014)Communication is bounded by root of rankProceedings of the forty-sixth annual ACM symposium on Theory of computing10.1145/2591796.2591799(842-846)Online publication date: 31-May-2014
    • (2013)New bounds for matching vector familiesProceedings of the forty-fifth annual ACM symposium on Theory of Computing10.1145/2488608.2488713(823-832)Online publication date: 1-Jun-2013
    • (2012)Subspace evasive setsProceedings of the forty-fourth annual ACM symposium on Theory of computing10.1145/2213977.2214010(351-358)Online publication date: 19-May-2012
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media