Skip to Main Content Area
  • CPS-VO
    • Contact Support
  • Browse
    • Calendar
    • Announcements
    • Repositories
    • Groups
  • Search
    • Search for Content
    • Search for a Group
    • Search for People
    • Search for a Project
    • Tagcloud
      
 
Not a member?
Click here to register!
Forgot username or password?
 
Home
National Science Foundation

Cyber-Physical Systems Virtual Organization

Read-only archive of site from September 29, 2023.

CPS-VO

Pseudorandomness

biblio

Visible to the public NP-Hardness of Learning Programs and Partial MCSP

Submitted by aekwall on Fri, 03/31/2023 - 9:39am
  • computer science
  • encryption
  • pubcrawl
  • Metrics
  • Resiliency
  • composability
  • Computational efficiency
  • Complexity theory
  • Generators
  • Closed box
  • circuit size problem
  • Kolmogorov Complexity
  • PAC learning
  • Pseudorandomness
  • black box encryption
biblio

Visible to the public Non-malleable Extractors and Codes, with Their Many Tampered Extensions

Submitted by grigby1 on Tue, 10/03/2017 - 11:57am
  • Computing Theory
  • Computing Theory and Resilience
  • Non-Malleable Codes
  • Non-Malleable Extractors
  • privacy
  • Privacy Amplification
  • Pseudorandomness
  • pubcrawl
  • Randomness Extractor
  • resilience
  • Resiliency
  • Scalability
biblio

Visible to the public Explicit Two-source Extractors and Resilient Functions

Submitted by grigby1 on Mon, 06/05/2017 - 12:25pm
  • Computing Theory
  • graph theory
  • Human behavior
  • Malware Analysis
  • Metrics
  • Pseudorandomness
  • pubcrawl
  • Ramsey graph
  • random key generation
  • Randomness Extractor
  • resilience
  • Resiliency
  • Resilient Function
  • Scalability
  • Two-Source Extractor

Terms of Use  |  ©2023. CPS-VO