| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev |
Incremental Deterministic Public-Key Encryption.  |
IACR Cryptology ePrint Archive  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev |
Incremental Deterministic Public-Key Encryption. |
EUROCRYPT |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel |
Fairness through awareness. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder |
Balls and Bins: Smaller Hash Families and Faster Evaluation. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan |
The Limits of Two-Party Differential Privacy. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kai-Min Chung, Omer Reingold, Salil P. Vadhan |
S-T connectivity on digraphs with a known stationary distribution. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel |
Fairness Through Awareness |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Danny Harnik, Omer Reingold |
On the Power of the Randomized Iterate. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Babaioff, Liad Blumrosen, Nicolas S. Lambert, Omer Reingold |
Only valuable experts can be valued. |
ACM Conference on Electronic Commerce |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder |
Balls and Bins: Smaller Hash Families and Faster Evaluation. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman |
Pseudorandom generators for combinatorial shapes. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Omer Reingold, Salil P. Vadhan |
Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman |
Pseudorandom Generators for Combinatorial Shapes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ronen Gradwohl, Omer Reingold |
Partial exposure in large games. |
Games and Economic Behavior |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
Universal One-Way Hash Functions via Inaccessible Entropy. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
Universal One-Way Hash Functions via Inaccessible Entropy. |
EUROCRYPT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan |
The Limits of Two-Party Differential Privacy. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Omer Reingold, Salil P. Vadhan |
Efficiency improvements in constructing pseudorandom generators from one-way functions. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
security preserving, one-way function, pseudorandom generator |
| 1 | Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
Inaccessible Entropy. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eyal Kaplan, Moni Naor, Omer Reingold |
Derandomized Constructions of k-Wise (Almost) Independent Permutations. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Card shuffling, Connectivity, Block ciphers, Random walk, Pseudo-randomness |
| 1 | Ronen Gradwohl, Omer Reingold, Ariel Yadin, Amir Yehudayoff |
Players' Effects Under Limited Independence. |
Math. Oper. Res. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, Omer Reingold, Salil P. Vadhan |
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Reingold (eds.) |
Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings |
TCC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilya Mironov, Omkant Pandey, Omer Reingold, Salil P. Vadhan |
Computational Differential Privacy. |
CRYPTO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Klim Efremenko, Omer Reingold |
How Well Do Random Walks Parallelize?. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
Markov Chains, Random Walks |
| 1 | Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan |
Pseudorandom Bit Generators That Fool Modular Sums. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan |
On the complexity of differentially private data release: efficient algorithms and hardness results. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
exponential mechanism, privacy, cryptography, traitor tracing, differential privacy |
| 1 | Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
Inaccessible entropy. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
interactive hashing, computational complexity, cryptography, zero knowledge, one-way functions, commitment schemes |
| 1 | Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan |
Dense Subsets of Pseudorandom Sets. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Omer Reingold |
Undirected connectivity in log-space. |
J. ACM |
2008 |
DBLP DOI BibTeX RDF |
bounded space algorithms, Derandomization, pseudorandom generator |
| 1 | Ronen Gradwohl, Omer Reingold |
Fault tolerance in large games. |
ACM Conference on Electronic Commerce |
2008 |
DBLP DOI BibTeX RDF |
large games, nash equilibrium, byzantine faults |
| 1 | Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan |
Dense Subsets of Pseudorandom Sets. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai-Min Chung, Omer Reingold, Salil P. Vadhan |
S-T Connectivity on Digraphs with a Known Stationary Distribution. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev |
Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev |
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, Klaus Jansen, Omer Reingold, José D. P. Rolim (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings |
APPROX-RANDOM |
2007 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev |
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai-Min Chung, Omer Reingold, Salil P. Vadhan |
S-T Connectivity on Digraphs with a Known Stationary Distribution. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Omer Reingold |
A New Interactive Hashing Theorem. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Omer Reingold |
Statistically-hiding commitment from any one-way function. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
statistically hiding and computationally binding commitment, cryptography, one-way functions |
| 1 | Iftach Haitner, Omer Reingold |
A New Interactive Hashing Theorem. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Eyal Kaplan, Moni Naor, Omer Reingold |
Derandomized Constructions of k-Wise (Almost) Independent Permutations |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Omer Reingold |
Statistically-Hiding Commitment from Any One-Way Function. |
IACR Cryptology ePrint Archive |
2006 |
DBLP BibTeX RDF |
|
| 1 | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
Completeness in Two-Party Secure Computation: A Computational View. |
J. Cryptology |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Omer Reingold |
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Reingold, Ronen Shaltiel, Avi Wigderson |
Extracting Randomness via Repeated Condensing. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Danny Harnik, Omer Reingold |
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Danny Harnik, Omer Reingold |
On the Power of the Randomized Iterate. |
CRYPTO |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Reingold, Luca Trevisan, Salil P. Vadhan |
Pseudorandom walks on regular digraphs and the RL vs. L problem. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
universal traversal sequence, zig-zag product, derandomization, expander graphs, mixing time, space-bounded computation |
| 1 | Omer Reingold, Luca Trevisan, Salil P. Vadhan |
Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Danny Harnik, Omer Reingold |
On the Power of the Randomized Iterate |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma |
On the Error Parameter of Dispersers |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright |
Tight bounds for shared memory systems accessed by Byzantine processes. |
Distributed Computing |
2005 |
DBLP DOI BibTeX RDF |
Sticky bits, Shared memory, Byzantine agreement, Distributed consensus |
| 1 | Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen |
On Robust Combiners for Oblivious Transfer and Other Primitives. |
EUROCRYPT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold |
Keyword Search and Oblivious Pseudorandom Functions. |
TCC |
2005 |
DBLP DOI BibTeX RDF |
Secure keyword search, oblivious pseudorandom functions, secure two-party protocols, private information retrieval, privacy-preserving protocols |
| 1 | Eyal Kaplan, Moni Naor, Omer Reingold |
Derandomized Constructions of k-Wise (Almost) Independent Permutations. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma |
On the Error Parameter of Dispersers. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Reingold |
Undirected ST-connectivity in log-space. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Reingold |
Undirected ST-Connectivity in Log-Space |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold |
Number-theoretic constructions of efficient pseudo-random functions. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
constant-depth threshold circuits, decision Diffie-Hellman, natural proofs, factoring, learning theory, Pseudo-random functions |
| 1 | William Aiello, Steven M. Bellovin, Matt Blaze, Ran Canetti, John Ioannidis, Angelos D. Keromytis, Omer Reingold |
Just fast keying: Key agreement in a hostile internet. |
ACM Trans. Inf. Syst. Secur. |
2004 |
DBLP DOI BibTeX RDF |
Cryptography, denial-of-service attacks |
| 1 | Cynthia Dwork, Moni Naor, Omer Reingold |
Immunizing Encryption Schemes from Decryption Errors. |
EUROCRYPT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Reingold, Luca Trevisan, Salil P. Vadhan |
Notions of Reducibility between Cryptographic Primitives. |
TCC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Omer Reingold |
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
Completeness in two-party secure computation: a computational view. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
oblivious tansfer, completeness, secure computation |
| 1 | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
Completeness in Two-Party Secure Computation - A Computational View |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer |
Magic Functions. |
J. ACM |
2003 |
DBLP DOI BibTeX RDF |
Fiat-Shamir methodology, interactive argument, magic function, selective decommitment, Digital signature, zero knowledge, interactive proof system |
| 1 | Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson |
Extractors: optimal up to constant factors. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
locally decodable error-correcting codes, pseudorandomness, condensers, randomness extractors, mergers |
| 1 | Moni Naor, Omer Reingold |
Constructing Pseudo-Random Permutations with a Prescribed Structure. |
J. Cryptology |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Omer Reingold, Salil P. Vadhan |
Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold, Alon Rosen |
Pseudorandom Functions and Factoring. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright |
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. |
DISC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel |
Streaming Computation of Combinatorial Objects. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
error-correcting codes, extractors, dispersers, streaming computation, universal hash functions, online computation |
| 1 | Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson |
Randomness Conductors and Constant-Degree Lossless Expanders. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
expander graphs, extractors, condensers, graph products |
| 1 | Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson |
Randomness conductors and constant-degree lossless expanders. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
expander graphs, extractors, condensers, graph products |
| 1 | William Aiello, Steven M. Bellovin, Matt Blaze, John Ioannidis, Omer Reingold, Ran Canetti, Angelos D. Keromytis |
Efficient, DoS-resistant, secure key exchange for internet protocols. |
ACM Conference on Computer and Communications Security |
2002 |
DBLP DOI BibTeX RDF |
cryptography, denial of service attacks |
| 1 | Moni Naor, Omer Reingold, Alon Rosen |
Pseudo-Random Functions and Factoring |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Omer Reingold, Salil P. Vadhan, Avi Wigderson |
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold, Alon Rosen |
Pseudo-Random Functions and Factoring. |
IACR Cryptology ePrint Archive |
2001 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold |
Constructing pseudo-random permutations with a prescribed structure. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | William Aiello, Steven M. Bellovin, Matt Blaze, Ran Canetti, John Ioannidis, Angelos D. Keromytis, Omer Reingold |
Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols. |
Security Protocols Workshop |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | William Aiello, Yuval Ishai, Omer Reingold |
Priced Oblivious Transfer: How to Sell Digital Goods. |
EUROCRYPT |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Gertner, Tal Malkin, Omer Reingold |
On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Reingold, Ronen Shaltiel, Avi Wigderson |
Extracting Randomness via Repeated Condensing |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold |
Constructing Pseudo-Random Permutations with a Prescribed Structure. |
IACR Cryptology ePrint Archive |
2000 |
DBLP BibTeX RDF |
|
| 1 | Yael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, Mahesh Viswanathan |
The Relationship between Public Key Encryption and Oblivious Transfer. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
trapdoor predicates, cryptography, protocols, protocols, public key cryptography, key agreement, public key encryption, public-key encryption, oblivious transfer, secure multi-party computation, primitives, black-box reductions, trapdoor permutations |
| 1 | Omer Reingold, Ronen Shaltiel, Avi Wigderson |
Extracting Randomness via Repeated Condensing. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
repeated condensing, input probability distribution, maximum entropy rate, output distribution, block extraction scheme, recursive win-win case analysis, random sources, polynomial loss, computational complexity, probability, entropy, entropy, error correction, random processes, condenser, randomness extraction |
| 1 | Omer Reingold, Salil P. Vadhan, Avi Wigderson |
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
entropy waves, zig-zag graph product, constant-degree expanders, constant-degree extractors, constructive interference, explicit extractors, high min-entropy sources, eigenvalue bound, graph theory, probability, entropy, probability distributions, eigenvalues and eigenfunctions |
| 1 | Moni Naor, Omer Reingold, Alon Rosen |
Pseudo-random functions and factoring (extended abstract). |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Biham, Dan Boneh, Omer Reingold |
Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Omer Reingold, Salil P. Vadhan |
Extracting All the Randomness and Reducing the Error in Trevisan's Extractors |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold |
On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. |
J. Cryptology |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold |
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions. |
J. Comput. Syst. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Benny Pinkas, Omer Reingold |
Distributed Pseudo-random Functions and KDCs. |
EUROCRYPT |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer |
Magic Functions. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
interactive argument, magic function, selective decommitment, three-round protocol, cryptography, distributed computing, zero knowledge, complexity theory, signature scheme, commitment scheme |
| 1 | Ran Raz, Omer Reingold, Salil P. Vadhan |
Error Reduction for Extractors. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
extractors |
| 1 | Ran Raz, Omer Reingold |
On Recycling the Randomness of States in Space Bounded Computation. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Omer Reingold, Salil P. Vadhan |
Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold |
From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract). |
CRYPTO |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Canetti, Daniele Micciancio, Omer Reingold |
Perfectly One-Way Probabilistic Hash Functions (Preliminary Version). |
STOC |
1998 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")