• Publications
  • Influence
A security architecture for computational grids
The unique security requirements of large-scale distributed (grid) computing are analyzed and a security policy and a corresponding security architecture are developed and an implementation of the architecture within the Globus metacomputing toolkit is discussed. Expand
Named Data Networking (NDN) Project
A global center for commercial innovation, PARC, a Xerox company, works closely with enterprises, entrepreneurs, government program partners and other clients to discover, develop, and deliver newExpand
Scalable and efficient provable data possession
This paper constructs a highly efficient and provably secure PDP technique based entirely on symmetric key cryptography, while not requiring any bulk encryption, and allows outsourcing of dynamic data, i.e, it efficiently supports operations, such as block modification, deletion and append. Expand
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
This work introduces a new provably secure group signature and a companion identity escrow scheme that are significantly more efficient than the state of the art. Expand
Efficient aggregation of encrypted data in wireless sensor networks
This paper proposes a simple and provably secure additively homomorphic stream cipher that allows efficient aggregation of encrypted data and shows that aggregation based on this cipher can be used to efficiently compute statistical values such as mean, variance and standard deviation of sensed data, while achieving significant bandwidth gain. Expand
Tree-based group key agreement
This work investigates a novel group key agreement approach which blends key trees with Diffie--Hellman key exchange and yields a secure protocol suite called Tree-based Group Diffie-Hellman (TGDH) that is both simple and fault-tolerant. Expand
Diffie-Hellman key distribution extended to group communication
This paper considers a class of protocols that are natural extensions of DiffieHellman to the n-party case and argues that these protocols are optimal with respect to certain aspects of protocol complexity. Expand
Simple and fault-tolerant key agreement for dynamic collaborative groups
This work investigates a novel approach to group key agreement by blending binary key trees with DiAEe-Hellman key exchange, resulting in a protocol suite that is very simple, secure and fault-tolerant. Expand
Key Agreement in Dynamic Peer Groups
This paper discusses all group key agreement operations and presents a concrete protocol suite, CLIQUES, which offers complete key agreement services and is based on multiparty extensions of the well-known Diffie-Hellman key exchange method. Expand
ALARM: Anonymous Location-Aided Routing in Suspicious MANETs
This work addresses a number of issues arising in suspicious location-based MANET settings by designing and analyzing a privacy-preserving and secure link-state based routing protocol (ALARM), which provides both security and privacy features, including node authentication, data integrity, anonymity, and untraceability. Expand