Now showing items 1-4 of 4

    • The Complexity of Collision-Resistant Hashing 

      Pass, Rafael; Tseng, Wei-Lung Dustin; Venkitasubramaniam, Muthuramakrishnan (2009-10-24)
      A long-standing open problem on the intersection of Complexity Theory and Cryptography is whether the security of cryptographic primitives can be based on the worst-case hardness of NP. We show that, unless coNP $\subseteq$ ...
    • Election Verifiability: Cryptographic Definitions and an Analysis of Helios and JCJ 

      Smyth, Ben; Frink, Steven; Clarkson, Michael R. (2017-02-13)
      Definitions of election verifiability in the computational model of cryptography are proposed. The definitions formalize notions of voters verifying their own votes, auditors verifying the tally of votes, and auditors ...
    • Genus: Making Generics Object-Oriented, Expressive, and Lightweight 

      Zhang, Yizhou; Loring, Matthew C.; Salvaneschi, Guido; Liskov, Barbara; Myers, Andrew C. (2015-06)
      The support for generic programming in modern object-oriented programming languages is awkward and lacks desirable expressive power. We introduce an expressive genericity mechanism that adds expressive power and strengthens ...
    • Graphical Multi-Task Learning 

      Sheldon, Daniel (2008-10-31)
      We investigate the problem of learning multiple tasks that are related according to a network structure, using the multi-task kernel framework proposed by Evgeniou, Micchelli and Pontil. Our method combines a graphical ...