|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10 occurrences of 10 keywords
|
|
|
|
|
Results
Found 31 publication records. Showing 31 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Chandan K. Dubey, Thomas Holenstein |
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Thomas Holenstein, Renato Renner |
On the Randomness of Independent Experiments. |
IEEE Transactions on Information Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer |
Subsampling Mathematical Relaxations and Average-case Complexity. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Thomas Holenstein, Grant Schoenebeck |
General Hardness Amplification of Predicates and Puzzles - (Extended Abstract). |
TCC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandan K. Dubey, Thomas Holenstein |
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Holenstein, Robin Künzler, Stefano Tessaro |
The equivalence of the random oracle model and the ideal cipher model, revisited. |
STOC |
2011 |
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 | Thomas Holenstein, Robin Künzler, Stefano Tessaro |
Equivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Thomas Holenstein, Grant Schoenebeck |
General Hardness Amplification of Predicates and Puzzles |
CoRR |
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, Moritz Hardt, Thomas Holenstein, David Steurer |
Subsampling Semidefinite Programs and Max-Cut on the Sphere. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Thomas Holenstein |
Parallel Repetition: Simplification and the No-Signaling Case. |
Theory of Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer |
Subsampling Semidefinite Programs and Max-Cut on the Sphere |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 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, Thomas Holenstein |
On the (Im)Possibility of Key Dependent Encryption. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder |
Trace reconstruction with constant deletion probability and related results. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Liad Blumrosen, Thomas Holenstein |
Posted prices vs. negotiations: an asymptotic analysis. |
ACM Conference on Electronic Commerce |
2008 |
DBLP DOI BibTeX RDF |
first order statistics, posted prices, secretary problems, single-item auctions, von mises, mechanism design |
| 1 | Thomas Holenstein |
Parallel repetition: simplifications and the no-signaling case. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
probabilistically checkable proofs, parallel repetition |
| 1 | Thomas Holenstein |
Strengthening key agreement using hard-core sets. |
|
2006 |
RDF |
|
| 1 | Thomas Holenstein |
Parallel repetition: simplifications and the no-signaling case |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Thomas Holenstein, Renato Renner |
On the randomness of independent experiments |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Thomas Holenstein |
Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness. |
TCC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Holenstein, Renato Renner |
One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption. |
CRYPTO |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Holenstein |
Key agreement from weak bit agreement. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
hard-core sets, cryptography, key agreement |
| 1 | Thomas Holenstein |
Key Agreement from Weak Bit Agreement |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Matthias Fitzi, Thomas Holenstein, Jürg Wullschleger |
Multi-party Computation with Hybrid Security. |
EUROCRYPT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Holenstein, Ueli M. Maurer, Johan Sjödin |
Complete Classification of Bilinear Hard-Core Functions. |
CRYPTO |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming C. Hao, Umeshwar Dayal, Daniel Cotting, Thomas Holenstein, Markus H. Gross |
Accelerated Force Computation for Physics-Based Information Visualization. |
VisSym |
2003 |
DBLP BibTeX RDF |
|
| 1 | Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger |
Two-Threshold Broadcast and Detectable Multi-party Computation. |
EUROCRYPT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger |
Extended Validity and Consistency in Byzantine Agreement. |
IACR Cryptology ePrint Archive |
2002 |
DBLP BibTeX RDF |
|
| 1 | Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith |
Detectable byzantine agreement secure against faulty majorities. |
PODC |
2002 |
DBLP DOI BibTeX RDF |
quantum signatures, broadcast, public-key infrastructure, byzantine agreement, multi-party computation |
Displaying result #1 - #31 of 31 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")