Share This Author
A security architecture for computational grids
- Ian T Foster, C. Kesselman, G. Tsudik, S. Tuecke
- Computer ScienceConference on Computer and Communications…
- 1 November 1998
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.
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 new…
Scalable and efficient provable data possession
- G. Ateniese, R. D. Pietro, L. Mancini, G. Tsudik
- Computer ScienceIACR Cryptology ePrint Archive
- 22 September 2008
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.
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
- G. Ateniese, J. Camenisch, M. Joye, G. Tsudik
- Computer Science, MathematicsAnnual International Cryptology Conference
- 20 August 2000
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.
Efficient aggregation of encrypted data in wireless sensor networks
- C. Castelluccia, E. Mykletun, G. Tsudik
- Computer ScienceThe Second Annual International Conference on…
- 17 July 2005
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.
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.
Diffie-Hellman key distribution extended to group communication
- M. Steiner, G. Tsudik, M. Waidner
- Computer Science, MathematicsConference on Computer and Communications…
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.
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.
DoS and DDoS in Named Data Networking
- Paolo Gasti, G. Tsudik, E. Uzun, Lixia Zhang
- Computer ScienceInternational Conference on Computer…
- 4 August 2012
This paper identifies and analyzing several new types of attacks in Named Data Networking and investigates their variations, effects and counter-measures, and sheds some light on the debate about relative virtues of self-certifying, as opposed to human-readable, names in the context of content-centric networking.
SMART: Secure and Minimal Architecture for (Establishing Dynamic) Root of Trust
- Karim M. El Defrawy, G. Tsudik, Aurélien Francillon, Daniele Perito
- Computer ScienceNetwork and Distributed System Security Symposium
A new primitive based on hardware-software co-design SMART, a simple, efficient and secure approach for establishing a dynamic root of trust in a remote embedded device that focuses on low-end micro-controller units (MCU) that lack specialized memory management or protection features.