|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 16 occurrences of 11 keywords
|
|
|
|
|
Results
Found 42 publication records. Showing 42 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Itay Berman, Iftach Haitner |
From Non-adaptive to Adaptive Pseudorandom Functions.  |
TCC  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yevgeniy Dodis, Iftach Haitner, Aris Tentes |
On the Instantiability of Hash-and-Sign RSA Signatures. |
TCC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yevgeniy Dodis, Iftach Haitner, Aris Tentes |
On the (In)Security of RSA Signatures. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Itay Berman |
From Non-Adaptive to Adaptive Pseudorandom Functions. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
Black-Box Constructions of Protocols for Secure Computation. |
SIAM J. Comput. |
2011 |
DBLP DOI 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 | Iftach Haitner, Eran Omri |
Coin Flipping with Constant Bias Implies One-Way Functions. |
FOCS |
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 | Iftach Haitner, Mohammad Mahmoody, David Xiao |
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
Black-Box Constructions of Protocols for Secure Computation. |
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. |
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 | Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai |
Bounded Key-Dependent Message Security. |
EUROCRYPT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Mohammad Mahmoody, David Xiao |
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
sampling protocols, constant-round statistically hiding commitments, black-box lower bounds, collision-resistant hash functions |
| 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 | Iftach Haitner |
A Parallel Repetition Theorem for Any Interactive Argument. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai |
Bounded Key-Dependent Message Security. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel |
Reducing Complexity Assumptions for Statistically-Hiding Commitment. |
J. Cryptology |
2009 |
DBLP DOI BibTeX RDF |
Statistical hiding, Regular one way functions, Bit commitment |
| 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 | Iftach Haitner, Alon Rosen, Ronen Shaltiel |
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
Witness-Hiding, Arthur Merlin protocols, Zero-Knowledge, Black-box reductions |
| 1 | Iftach Haitner, Thomas Holenstein |
On the (Im)Possibility of Key Dependent Encryption. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
Key-dependent input, Black-box separations, One-way functions |
| 1 | Iftach Haitner |
A Parallel Repetition Theorem for Any Interactive Argument. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
interactive arguments, computationally sound proofs, parallel repetition, hardness amplification |
| 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 | Iftach Haitner, Thomas Holenstein |
On the (Im)Possibility of Key Dependent Encryption. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner |
Semi-honest to Malicious Oblivious Transfer - The Black-Box Way. |
TCC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Jonathan J. Hoch, Gil Segev |
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. |
TCC |
2008 |
DBLP DOI 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 | Iftach Haitner, Jonathan J. Hoch, Gil Segev |
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. |
IACR Cryptology ePrint Archive |
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 | 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 | Iftach Haitner, Omer Reingold |
Statistically-Hiding Commitment from Any One-Way Function. |
IACR Cryptology ePrint Archive |
2006 |
DBLP 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 | Iftach Haitner, Danny Harnik, Omer Reingold |
On the Power of the Randomized Iterate |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel |
Reducing Complexity Assumptions for Statistically-Hiding Commitment. |
EUROCRYPT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Ronen Shaltiel |
Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner, Ronen Shaltiel |
Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | Iftach Haitner |
Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations. |
TCC |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #42 of 42 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")