In this paper, given a set of research papers with only title and author information, a mining strategy is proposed to discover and organize the communities of authors according to...
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold...
This paper discusses our ongoing work on constructing an annotated corpus of children's stories for further studies on the linguistic, computational, and cognitive aspects of...
In this paper, we build, in a generic way, two asymmetric cryptosystems with a careful study of their security. We present first an additively homomorphic scheme which generalizes,...
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...