The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Holenstein: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thomas Holenstein, Ueli M. Maurer, Johan Sjödin
    Complete Classification of Bilinear Hard-Core Functions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:73-91 [Conf]
  2. Thomas Holenstein, Renato Renner
    One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2005, pp:478-493 [Conf]
  3. Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger
    Two-Threshold Broadcast and Detectable Multi-party Computation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:51-67 [Conf]
  4. Matthias Fitzi, Thomas Holenstein, Jürg Wullschleger
    Multi-party Computation with Hybrid Security. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:419-438 [Conf]
  5. Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith
    Detectable byzantine agreement secure against faulty majorities. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:118-126 [Conf]
  6. Thomas Holenstein
    Key agreement from weak bit agreement. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:664-673 [Conf]
  7. Thomas Holenstein
    Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:443-461 [Conf]
  8. Ming C. Hao, Umeshwar Dayal, Daniel Cotting, Thomas Holenstein, Markus H. Gross
    Accelerated Force Computation for Physics-Based Information Visualization. [Citation Graph (0, 0)][DBLP]
    VisSym, 2003, pp:- [Conf]
  9. Thomas Holenstein
    Key Agreement from Weak Bit Agreement [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:102, pp:- [Journal]
  10. Thomas Holenstein
    Parallel repetition: simplifications and the no-signaling case. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:411-419 [Conf]
  11. Thomas Holenstein
    Parallel repetition: simplifications and the no-signaling case [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  12. Thomas Holenstein, Renato Renner
    On the randomness of independent experiments [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  13. Universal One-Way Hash Functions via Inaccessible Entropy. [Citation Graph (, )][DBLP]


  14. Posted prices vs. negotiations: an asymptotic analysis. [Citation Graph (, )][DBLP]


  15. Trace reconstruction with constant deletion probability and related results. [Citation Graph (, )][DBLP]


  16. On the (Im)Possibility of Key Dependent Encryption. [Citation Graph (, )][DBLP]


  17. Subsampling Semidefinite Programs and Max-Cut on the Sphere [Citation Graph (, )][DBLP]


  18. General Hardness Amplification of Predicates and Puzzles [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002