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 (Author), Goldwasser, Shafi (Contributor), Nussboim, Asaf (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Society of Industrial and Applied Mathematics (SIAM),
2011-02-11T15:56:32Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
On the Possibilities and Limitations of Pseudodeterministic Algorithms
by: Goldreich, Oded, et al.
Published: (2021) -
Collision-Free Hashing from Lattice Problems
by: Goldreich, Oded, et al.
Published: (2019) -
Local access to huge random objects through partial sampling
by: Yodpinyanee, Anak, et al.
Published: (2021) -
Design and Application of Huge Hyperchaotic Random Number Generators
by: Pei-Yen Wan, et al.
Published: (2018) -
The Research and Implementation of Huge Amount on Media Streaming in Security Layer
by: Chu-Ting Wang, et al.
Published: (2013)