On the Implementation of Huge Random Objects
We initiate a general study of the feasibility of implementing (huge) random objects, and demonstrate its applicability to a number of areas in which random objects occur naturally. We highlight two types of measures of the quality of the implementation (with respect to the desired specification): T...
Main Authors: | Goldreich, Oded, Goldwasser, Shafi, Nussboim, Asaf |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Society of Industrial and Applied Mathematics (SIAM)
2011
|
Online Access: | http://hdl.handle.net/1721.1/60920 https://orcid.org/0000-0003-4728-1535 |
Similar Items
-
Testing Distributions of Huge Objects
by: Oded Goldreich, et al.
Published: (2023-12-01) -
How to Construct Random Functions
by: Goldreich, Oded, et al.
Published: (2023) -
On the Possibilities and Limitations of Pseudodeterministic Algorithms
by: Goldreich, Oded, et al.
Published: (2021) -
Public-Key Cryptosystems from Lattice Reduction Problems
by: Goldreich, Oded, et al.
Published: (2023) -
Collision-Free Hashing from Lattice Problems
by: Goldreich, Oded, et al.
Published: (2019)