N
Nikos Triandopoulos
Researcher at Stevens Institute of Technology
Publications - 65
Citations - 3444
Nikos Triandopoulos is an academic researcher from Stevens Institute of Technology. The author has contributed to research in topics: Set operations & Authentication. The author has an hindex of 29, co-authored 62 publications receiving 3219 citations. Previous affiliations of Nikos Triandopoulos include Boston University & Dartmouth College.
Papers
More filters
Proceedings ArticleDOI
Anonysense: privacy-aware people-centric sensing
TL;DR: AnonySense allows applications to submit sensing tasks that will be distributed across anonymous participating mobile devices, later receiving verified, yet anonymized, sensor data reports back from the field, thus providing the first secure implementation of this participatory sensing model.
Proceedings ArticleDOI
Delegatable pseudorandom functions and applications
TL;DR: Two DPRF constructions are built upon the well-known tree-based GGM PRF family and feature only logarithmic delegation size in the number of values conforming to the policy predicate, and it is shown that the second construction is also policy private.
Posted Content
Delegatable Pseudorandom Functions and Applications.
TL;DR: In this paper, the problem of delegating the evaluation of a pseudorandom function (PRF) to an untrusted proxy and introduce a novel cryptographic primitive called delegatable pseudo-random functions, or DPRFs for short, enables a proxy to evaluate a PRF on a strict subset of its domain using a trapdoor derived from the DPRF secret key.
Journal ArticleDOI
AnonySense: A system for anonymous opportunistic sensing
TL;DR: AnonySense is described, a privacy-aware system for realizing pervasive applications based on collaborative, opportunistic sensing by personal mobile devices, and how AnonySense can support extended security features that can be useful for different applications.
Proceedings ArticleDOI
Authenticated hash tables
TL;DR: This is the first construction for authenticating a hash table with a constant query cost and sublinear update cost, and employs the RSA accumulator in a nested way over the stored data, strictly improving upon previous accumulator-based solutions.