The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marten van Dijk: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Margreta Kuijper, Marten van Dijk, Henk D. L. Hollmann, Job Oostveen
    A Unifying System-Theoretic Framework for Errors-and-Erasures Reed-Solomon Decoding. [Citation Graph (0, 0)][DBLP]
    AAECC, 2001, pp:343-352 [Conf]
  2. Blaise Gassend, Dwaine E. Clarke, Marten van Dijk, Srinivas Devadas
    Controlled Physical Random Functions. [Citation Graph (0, 0)][DBLP]
    ACSAC, 2002, pp:149-160 [Conf]
  3. Dwaine E. Clarke, Srinivas Devadas, Marten van Dijk, Blaise Gassend, G. Edward Suh
    Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2003, pp:188-207 [Conf]
  4. Blaise Gassend, Dwaine E. Clarke, Marten van Dijk, Srinivas Devadas
    Silicon physical random functions. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2002, pp:148-160 [Conf]
  5. Marten van Dijk, David P. Woodruff
    Asymptotically Optimal Communication for Torus-Based Cryptography. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:157-178 [Conf]
  6. Marten van Dijk
    A Linear Construction of Perfect Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1994, pp:23-34 [Conf]
  7. Marten van Dijk, Robert Granger, Dan Page, Karl Rubin, Alice Silverberg, Martijn Stam, David P. Woodruff
    Practical Cryptography in High Dimensional Tori. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:234-250 [Conf]
  8. David P. Woodruff, Marten van Dijk
    Cryptography in an Unbounded Computational Model. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2002, pp:149-164 [Conf]
  9. Blaise Gassend, G. Edward Suh, Dwaine E. Clarke, Marten van Dijk, Srinivas Devadas
    Caches and Hash Trees for Efficient Memory Integrity. [Citation Graph (0, 0)][DBLP]
    HPCA, 2003, pp:295-306 [Conf]
  10. Ton Kalker, Jean-Paul M. G. Linnartz, Marten van Dijk
    Watermark Estimation through Detector Analysis. [Citation Graph (0, 0)][DBLP]
    ICIP (1), 1998, pp:425-429 [Conf]
  11. G. Edward Suh, Dwaine E. Clarke, Blaise Gassend, Marten van Dijk, Srinivas Devadas
    AEGIS: architecture for tamper-evident and tamper-resistant processing. [Citation Graph (0, 0)][DBLP]
    ICS, 2003, pp:160-171 [Conf]
  12. Jean-Paul M. G. Linnartz, Marten van Dijk
    Analysis of the Sensitivity Attack against Electronic Watermarks in Images. [Citation Graph (0, 0)][DBLP]
    Information Hiding, 1998, pp:258-272 [Conf]
  13. G. Edward Suh, Dwaine E. Clarke, Blaise Gassend, Marten van Dijk, Srinivas Devadas
    Efficient Memory Integrity Verification and Encryption for Secure Processors. [Citation Graph (0, 0)][DBLP]
    MICRO, 2003, pp:339-350 [Conf]
  14. Dwaine E. Clarke, Blaise Gassend, Thomas Kotwal, Matt Burnside, Marten van Dijk, Srinivas Devadas, Ronald L. Rivest
    The Untrusted Computer Problem and Camera-Based Authentication. [Citation Graph (0, 0)][DBLP]
    Pervasive, 2002, pp:114-124 [Conf]
  15. Blaise Gassend, Dwaine E. Clarke, Marten van Dijk, Srinivas Devadas
    Delay-Based Circuit Authentication and Applications. [Citation Graph (0, 0)][DBLP]
    SAC, 2003, pp:294-301 [Conf]
  16. Dwaine E. Clarke, G. Edward Suh, Blaise Gassend, Ajay Sudan, Marten van Dijk, Srinivas Devadas
    Towards Constant Bandwidth Overhead Integrity Checking of Untrusted Data. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2005, pp:139-153 [Conf]
  17. Pim Tuyls, Tom A. M. Kevenaar, Geert Jan Schrijen, Toine Staring, Marten van Dijk
    Visual Crypto Displays Enabling Secure Communications. [Citation Graph (0, 0)][DBLP]
    SPC, 2003, pp:271-284 [Conf]
  18. Blaise Gassend, Charles W. O'Donnell, William Thies, Andrew Lee, Marten van Dijk, Srinivas Devadas
    Predicting Secondary Structure of All-Helical Proteins Using Hidden Markov Support Vector Machines. [Citation Graph (0, 0)][DBLP]
    PRIB, 2006, pp:93-104 [Conf]
  19. Blaise Gassend, Daihyun Lim, Dwaine E. Clarke, Marten van Dijk, Srinivas Devadas
    Identification and authentication of integrated circuits. [Citation Graph (0, 0)][DBLP]
    Concurrency - Practice and Experience, 2004, v:16, n:11, pp:1077-1098 [Journal]
  20. Marten van Dijk
    On the Information Rate of Perfect Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1995, v:6, n:2, pp:143-169 [Journal]
  21. Marten van Dijk
    A Linear Construction of Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:12, n:2, pp:161-201 [Journal]
  22. Marten van Dijk, Christian Gehrmann, Ben J. M. Smeets
    Unconditionally Secure Group Authentication. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:14, n:3, pp:281-296 [Journal]
  23. Marten van Dijk, Wen-Ai Jackson, Keith M. Martin
    A General Decomposition Construction for Incomplete Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:15, n:3, pp:301-321 [Journal]
  24. Shengli Liu, Henk C. A. van Tilborg, Marten van Dijk
    A Practical Protocol for Advantage Distillation and Information Reconciliation. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:30, n:1, pp:39-62 [Journal]
  25. Marten van Dijk, Dwaine E. Clarke, Blaise Gassend, G. Edward Suh, Srinivas Devadas
    Speeding up Exponentiation using an Untrusted Computational Resource. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:39, n:2, pp:253-273 [Journal]
  26. Marten van Dijk
    More Information Theoretical Inequalities to be Used in Secret Sharing? [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:1, pp:41-44 [Journal]
  27. Marten van Dijk, Tom A. M. Kevenaar, Geert Jan Schrijen, Pim Tuyls
    Improved constructions of secret sharing schemes by applying (lambda, omega)-decompositions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:4, pp:154-157 [Journal]
  28. Marten van Dijk
    On a special class of broadcast channels with confidential messages. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:2, pp:712-714 [Journal]
  29. Marten van Dijk, Sebastian Egner, Marcus Greferath, Alfred Wassermann
    On two doubly even self-dual binary codes of length 160 and minimum weight 24. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:408-411 [Journal]
  30. Marten van Dijk, Sebastian Egner, Ravi Motwani, Arie G. C. Koppelaar
    Simultaneous zero-tailing of parallel concatenated codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:9, pp:2236-2241 [Journal]
  31. Marten van Dijk, Ludo M. G. M. Tolhuizen
    Efficient encoding for a class of subspace subcodes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:2142-2146 [Journal]
  32. Frans M. J. Willems, Marten van Dijk
    Capacity and codes for embedding information in gray-scale signals. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:1209-1214 [Journal]
  33. Daihyun Lim, Jae W. Lee, Blaise Gassend, G. Edward Suh, Marten van Dijk, Srinivas Devadas
    Extracting secret keys from integrated circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. VLSI Syst., 2005, v:13, n:10, pp:1200-1205 [Journal]
  34. Marten van Dijk, Emina Torlak, Blaise Gassend, Srinivas Devadas
    A Generalized Two-Phase Analysis of Knowledge Flows in Security Protocols [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  35. Emina Torlak, Marten van Dijk, Blaise Gassend, Daniel Jackson, Srinivas Devadas
    Knowledge Flow Analysis for Security Protocols [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  36. The Trusted Execution Module: Commodity General-Purpose Trusted Computing. [Citation Graph (, )][DBLP]


  37. Offline untrusted storage with immediate detection of forking and replay attacks. [Citation Graph (, )][DBLP]


  38. Virtual monotonic counters and count-limited objects using a TPM without a trusted OS. [Citation Graph (, )][DBLP]


  39. Fully Homomorphic Encryption over the Integers. [Citation Graph (, )][DBLP]


  40. Application-aware deadlock-free oblivious routing. [Citation Graph (, )][DBLP]


  41. Offline count-limited certificates. [Citation Graph (, )][DBLP]


  42. Learning biophysically-motivated parameters for alpha helix prediction. [Citation Graph (, )][DBLP]


Search in 0.018secs, Finished in 0.021secs
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