Search For:

Displaying 1-41 out of 41 total
Secure Encounter-Based Mobile Social Networks: Requirements, Designs, and Tradeoffs
Found in: IEEE Transactions on Dependable and Secure Computing
By Abedelaziz Mohaien,Denis Foo Kune,Eugene Y. Vasserman, Myungsun Kim, Yongdae Kim
Issue Date:November 2013
pp. 380-393
Encounter-based social networks and encounter-based systems link users who share a location at the same time, as opposed to the traditional social network paradigm of linking users who have an offline friendship. This new approach presents challenges that ...
 
Peer Pressure: Exerting Malicious Influence on Routers at a Distance
Found in: 2013 IEEE 33rd International Conference on Distributed Computing Systems (ICDCS)
By Max Schuchard,Christopher Thompson,Nicholas Hopper, Yongdae Kim
Issue Date:July 2013
pp. 571-580
Both academic research and historical incidents have shown that unstable BGP speakers can have extreme, undesirable impacts on network performance and reliability. Large amounts of time and energy have been invested in improving router stability. In this p...
 
Understanding Social Networks Properties for Trustworthy Computing
Found in: Distributed Computing Systems Workshops, International Conference on
By Abedelaziz Mohaisen, Huy Tran, Nicholas Hopper, Yongdae Kim
Issue Date:June 2011
pp. 154-159
The ever-increasing popularity of social networks opens new directions for leveraging social networks to build primitives for security and communication, in many contexts. Such primitives utilize the trust in these social networks to ensure collaboration a...
 
On Homomorphic Signatures for Network Coding
Found in: IEEE Transactions on Computers
By Aaram Yun, Jung Hee Cheon, Yongdae Kim
Issue Date:September 2010
pp. 1295-1296
In this paper, we examine homomorphic signatures that can be used to protect the integrity of network coding. In particular, Yu et al. proposed an RSA-based homomorphic signature scheme recently for this purpose. We show that their scheme in fact does not ...
 
Exploring In-Situ Sensing Irregularity in Wireless Sensor Networks
Found in: IEEE Transactions on Parallel and Distributed Systems
By Joengmin Hwang, Tian He, Yongdae Kim
Publication Date: June 2009
pp. 547-561
The circular sensing model has been widely used to estimate performance of sensing applications in existing analyses and simulations. While this model provides valuable high-level guidelines, the quantitative results obtained may not reflect the true perfo...
 
Logical Network Boundary Controller
Found in: Conference For Homeland Security, Cybersecurity Applications & Technology
By John Wu, Yongdae Kim, Ryan Marotz, Ranga Ramanujan, James Tyra
Issue Date:March 2009
pp. 261-266
Secure and timely information and intelligence sharing is essential in combatting terrorism and/or responding to emergency situations. Adequate security boundary controls are needed to ensure that sensitive information stays within the defined boundaries w...
 
Building Trust in Storage Outsourcing: Secure Accounting of Utility Storage
Found in: Reliable Distributed Systems, IEEE Symposium on
By Vishal Kher, Yongdae Kim
Issue Date:October 2007
pp. 55-64
We are witnessing a revival of Storage Service Providers in the form of new vendors as well as traditional players. While storage outsourcing is cost-effective, many companies are hesitating to outsource their storage due to security concerns. The success ...
 
Combating Double-Spending Using Cooperative P2P Systems
Found in: Distributed Computing Systems, International Conference on
By Ivan Osipkov, Eugene Y. Vasserman, Nicholas Hopper, Yongdae Kim
Issue Date:June 2007
pp. 41
An electronic cash system allows users to withdraw coins, represented as bit strings, from a bank or broker, and spend those coins anonymously at participating mer- chants, so that the broker cannot link spent coins to the user who withdraws them. A variet...
 
Privacy Preserving Nearest Neighbor Search
Found in: Data Mining Workshops, International Conference on
By Mark Shaneck, Yongdae Kim, Vipin Kumar
Issue Date:December 2006
pp. 541-545
Data mining is frequently obstructed by privacy concerns. In many cases data is distributed, and bringing the data together in one place for analysis is not possible due to privacy laws (e.g. HIPAA) or policies. Privacy preserving data mining techniques ha...
 
Group Key Agreement Efficient in Communication
Found in: IEEE Transactions on Computers
By Yongdae Kim, Adrian Perrig, Gene Tsudik
Issue Date:July 2004
pp. 905-921
<p><b>Abstract</b>—In recent years, collaborative and group-oriented applications and protocols have gained popularity. These applications typically involve communication over open networks; security thus is naturally an important require...
 
Secure Group Communication Using Robust Contributory Key Agreement
Found in: IEEE Transactions on Parallel and Distributed Systems
By Yair Amir, Yongdae Kim, Cristina Nita-Rotaru, John L. Schultz, Jonathan Stanton, Gene Tsudik
Issue Date:May 2004
pp. 468-480
<p><b>Abstract</b>—Contributory group key agreement protocols generate group keys based on contributions of all group members. Particularly appropriate for relatively small collaborative peer groups, these protocols are resilient to many ...
 
Decentralized Authentication Mechanisms for Object-based Storage Devices
Found in: Security in Storage Workshop, International IEEE
By Vishal Kher, Yongdae Kim
Issue Date:October 2003
pp. 1
Network-attached object-based storage separates data-path from control-path and enables direct interaction between clients and the storage devices. Clients interact with the file manager only to acquire the meta-data information and some cryptographic prim...
 
Admission Control in Peer Groups
Found in: Network Computing and Applications, IEEE International Symposium on
By Yongdae Kim, Daniele Mazzocchi, Gene Tsudik
Issue Date:April 2003
pp. 131
Security in collaborative peer groups is an active research topic. Most previous work focused on key management without addressing an important pre-requisite: admission control, i.e., how to securely admit a new member. This paper represents an initial att...
 
Secure Group Services for Storage Area Networks
Found in: Security in Storage Workshop, International IEEE
By Yongdae Kim, Maithili Narasimha, Fabio Maino, Gene Tsudik
Issue Date:December 2002
pp. 80
Storage Area Networks, with their ability to offer high data availability, reliability and scalability, are a promising solution for the large scale storage needs of many enterprises. As with any distributed storage system, a major design challenge for a S...
 
On the Performance of Group Key Agreement Protocols
Found in: Distributed Computing Systems, International Conference on
By Yair Amir, Yongdae Kim, Cristina Nita-Rotaru, Gene Tsudik
Issue Date:July 2002
pp. 463
No summary available.
   
Exploring Robustness in Group Key Agreement
Found in: Distributed Computing Systems, International Conference on
By Yair Amir, Cristina Nita-Rotaru, John Schultz, Jonathan Stanton, Yongdae Kim, Gene Tsudik
Issue Date:April 2001
pp. 0399
Abstract: Secure group communication is crucial for building distributed applications that work in dynamic environments and communicate over unsecured networks (e.g. the Internet). Key agreement is a critical part of providing security services for group c...
 
Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments
Found in: Distributed Computing Systems, International Conference on
By Yair Amir, Giuseppe Ateniese, Damian Hasse, Yongdae Kim, Cristina Nita-Rotaru, Theo Schlossnagle, John Schultz, Jonathan Stanton, Gene Tsudik
Issue Date:April 2000
pp. 330
The increasing popularity and diversity of collaborative applications prompts a need for highly secure and reliable communication platforms for dynamic peer groups. Security mechanisms for such groups tend to be both expensive and complex and their integra...
 
Efficient Cryptographic Primitives for Private Data Mining
Found in: Hawaii International Conference on System Sciences
By Mark Shaneck, Yongdae Kim
Issue Date:January 2010
pp. 1-9
Data mining is frequently obstructed by privacy concerns. In many cases data is distributed, and bringing the data together in one place for analysis is not possible due to privacy laws (e.g. HIPAA) or policies. Privacy preserving data mining techniques ha...
   
Trustworthy Distributed Computing on Social Networks
Found in: IEEE Transactions on Services Computing
By Aziz Mohaisen,Huy Tran,Abhishek Chandra,Yongdae Kim
Issue Date:December 2013
pp. 1
In this paper we investigate a new computing paradigm, called SocialCloud, in which computing nodes are governed by social ties driven from a bootstrapping trust-possessing social graph. We investigate how this paradigm differs from existing computing para...
 
Ghost Talk: Mitigating EMI Signal Injection Attacks against Analog Sensors
Found in: 2013 IEEE Symposium on Security and Privacy (SP) Conference
By D. F. Kune,J. Backes,S. S. Clark,D. Kramer,M. Reynolds,K. Fu, Yongdae Kim, Wenyuan Xu
Issue Date:May 2013
pp. 145-159
Electromagnetic interference (EMI) affects circuits by inducing voltages on conductors. Analog sensing of signals on the order of a few millivolts is particularly sensitive to interference. This work (1) measures the susceptibility of analog sensor systems...
   
The Design of a Group Key Agreement API
Found in: DARPA Information Survivability Conference and Exposition,
By Giuseppe Ateniese, Olivier Chevassut, Damian Hasse, Yongdae Kim, Gene Tsudik
Issue Date:January 2000
pp. 0115
As collaborative applications grow in popularity the need for appropriate security guarantees, services and mechanisms becomes apparent. This paper describes a protocol suite and an API geared for securing collaborative applications. The API is based on th...
 
Protecting access privacy of cached contents in information centric networks
Found in: Proceedings of the 2012 ACM conference on Computer and communications security (CCS '12)
By Abedelaziz Mohaisen, Haiyong Xie, Max Schuchard, Xinwen Zhang, Yongdae Kim
Issue Date:October 2012
pp. 1001-1003
In information centric network (ICN), contents are fetched by their names from caches deployed in the network or from origin servers. Once the contents are fetched from the origin server, it is replicated and cached in all routers along the routing and for...
     
Toward a safe integrated clinical environment: a communication security perspective
Found in: Proceedings of the 2012 ACM workshop on Medical communication systems (MedCOMM '12)
By Denis Foo Kune, Eugene Vasserman, Insup Lee, Krishna Venkatasubramanian, Yongdae Kim
Issue Date:August 2012
pp. 7-12
With a vision emerging for dynamically composable and interoperable medical devices and information systems, many communication standards have been proposed, and more are in development. However, few include sufficiently comprehensive or flexible security ...
     
The Frog-Boiling Attack: Limitations of Secure Network Coordinate Systems
Found in: ACM Transactions on Information and System Security (TISSEC)
By Eric Chan-Tin, Nicholas Hopper, Victor Heorhiadi, Yongdae Kim
Issue Date:November 2011
pp. 1-23
A network coordinate system assigns Euclidean “virtual” coordinates to every node in a network to allow easy estimation of network latency between pairs of nodes that have never contacted each other. These systems have been implemented in a var...
     
Mistaking friends for foes: an analysis of a social network-based Sybil defense in mobile networks
Found in: Proceedings of the 5th International Confernece on Ubiquitous Information Management and Communication (ICUIMC '11)
By Abedelaziz Mohaisen, DaeHun Nyang, Hun Jeong Kang, Tamer AbuHmed, Yongdae Kim
Issue Date:February 2011
pp. 1-8
The Sybil attack is very challenging in the context of distributed systems; Sybil nodes with multiple identities try to deviate the behavior of the overall system from normal behavior. Recently, there have been a lot of interests in social-network based Sy...
     
Measuring the mixing time of social graphs
Found in: Proceedings of the 10th annual conference on Internet measurement (IMC '10)
By Aaram Yun, Abedelaziz Mohaisen, Yongdae Kim
Issue Date:November 2010
pp. 383-389
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networks are fast mixing, and many recently proposed designs of such systems make c...
     
Balancing the shadows
Found in: Proceedings of the 9th annual ACM workshop on Privacy in the electronic society (WPES '10)
By Alexander W. Dean, Max Schuchard, Nicholas Hopper, Victor Heorhiadi, Yongdae Kim
Issue Date:October 2010
pp. 1-10
In this paper, we examine the ShadowWalker peer-to-peer anonymity scheme. ShadowWalker attempts to provide anonymity via circuits built using random walks over a secured topology. ShadowWalker's topology is secured through the use of shadows, peers that ce...
     
Losing control of the internet: using the data plane to attack the control plane
Found in: Proceedings of the 17th ACM conference on Computer and communications security (CCS '10)
By Abedelaziz Mohaisen, Denis Foo Kune, Eugene Y. Vasserman, Max Schuchard, Nicholas Hopper, Yongdae Kim
Issue Date:October 2010
pp. 726-728
In this work, we introduce the Coordinated Cross Plane Session Termination, or CXPST, attack, a distributed denial of service attack that attacks the control plane of the Internet. CXPST extends previous work that demonstrates a vulnerability in routers th...
     
Secure encounter-based social networks: requirements, challenges, and designs
Found in: Proceedings of the 17th ACM conference on Computer and communications security (CCS '10)
By Abedelaziz Mohaisen, Denis Foo Kune, Eugene Y. Vasserman, Max Schuchard, Yongdae Kim
Issue Date:October 2010
pp. 717-719
In this paper we outline requirements, challenges, and designs for encounter-based mobile social networks, where relationships are based on a temporarily shared location. To illustrate the challenges we examine a recently proposed design, SMILE, against a ...
     
Designs to account for trust in social network-based sybil defenses
Found in: Proceedings of the 17th ACM conference on Computer and communications security (CCS '10)
By Abedelaziz Mohaisen, Nicholas Hopper, Yongdae Kim
Issue Date:October 2010
pp. 714-716
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs. The performance of these defenses depends on the quality of the algorithmic...
     
Timing attacks on PIN input devices
Found in: Proceedings of the 17th ACM conference on Computer and communications security (CCS '10)
By Denis Foo Kune, Yongdae Kim
Issue Date:October 2010
pp. 678-680
Keypads are commonly used to enter personal identification numbers (PIN) which are intended to authenticate a user based on what they know. A number of those keypads such as ATM inputs and door keypads provide an audio feedback to the user for each button ...
     
Recruiting new tor relays with BRAIDS
Found in: Proceedings of the 17th ACM conference on Computer and communications security (CCS '10)
By Nicholas Hopper, Rob Jansen, Yongdae Kim
Issue Date:October 2010
pp. 319-328
Tor, a distributed Internet anonymizing system, relies on volunteers who run dedicated relays. Other than altruism, these volunteers have no incentive to run relays, causing a large disparity between the number of users and available relays. We introduce B...
     
Hashing it out in public: common failure modes of DHT-based anonymity schemes
Found in: Proceedings of the 8th ACM workshop on Privacy in the electronic society (WPES '09)
By Andrew Tran, Nicholas Hopper, Yongdae Kim
Issue Date:November 2009
pp. 71-80
We examine peer-to-peer anonymous communication systems that use Distributed Hash Table algorithms for relay selection. We show that common design flaws in these schemes lead to highly effective attacks against the anonymity provided by the schemes. These ...
     
On protecting integrity and confidentiality of cryptographic file system for outsourced storage
Found in: Proceedings of the 2009 ACM workshop on Cloud computing security (CCSW '09)
By Aaram Yun, Chunhui Shi, Yongdae Kim
Issue Date:November 2009
pp. 67-76
A cryptographic network file system has to guarantee confidentiality and integrity of its files, and also it has to support random access. For this purpose, existing designs mainly rely on(often ad-hoc) combination of Merkle hash tree with a block cipher m...
     
Scalable onion routing with torsk
Found in: Proceedings of the 16th ACM conference on Computer and communications security (CCS '09)
By Andrew Tran, Jon McLachlan, Nicholas Hopper, Yongdae Kim
Issue Date:November 2009
pp. 590-599
We introduce Torsk, a structured peer-to-peer low-latency anonymity protocol. Torsk is designed as an interoperable replacement for the relay selection and directory service of the popular Tor anonymity network, that decreases the bandwidth cost of relay s...
     
Membership-concealing overlay networks
Found in: Proceedings of the 16th ACM conference on Computer and communications security (CCS '09)
By Eugene Vasserman, James Tyra, Nicholas Hopper, Rob Jansen, Yongdae Kim
Issue Date:November 2009
pp. 390-399
We introduce the concept of membership-concealing overlay networks (MCONs), which hide the real-world identities of participants. We argue that while membership concealment is orthogonal to anonymity and censorship resistance, pseudonymous communication an...
     
Towards complete node enumeration in a peer-to-peer botnet
Found in: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security (ASIACCS '09)
By Brent ByungHoon Kang, Chris Nunnery, Christopher P. Lee, David Dagon, Eric Chan-Tin, Greg Sinclair, Hun Jeong Kang, James Tyra, Nicholas Hopper, Yongdae Kim, Zachariah Wadler
Issue Date:March 2009
pp. 48-54
Modern advanced botnets may employ a decentralized peer-to-peer overlay network to bootstrap and maintain their command and control channels, making them more resilient to traditional mitigation efforts such as server incapacitation. As an alternative stra...
     
Securing distributed storage: challenges, techniques, and systems
Found in: Proceedings of the 2005 ACM workshop on Storage security and survivability (StorageSS '05)
By Vishal Kher, Yongdae Kim
Issue Date:November 2005
pp. 9-25
The rapid increase of sensitive data and the growing number of government regulations that require longterm data retention and protection have forced enterprises to pay serious attention to storage security. In this paper, we discuss important security iss...
     
Revisiting random key pre-distribution schemes for wireless sensor networks
Found in: Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks (SASN '04)
By Joengmin Hwang, Yongdae Kim
Issue Date:October 2004
pp. 43-52
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerbe...
     
On the performance of group key agreement protocols
Found in: ACM Transactions on Information and System Security (TISSEC)
By Cristina Nita-Rotaru, Gene Tsudik, Yair Amir, Yongdae Kim
Issue Date:August 2004
pp. 457-488
Group key agreement is a fundamental building block for secure peer group communication systems. Several group key management techniques were proposed in the last decade, all assuming the existence of an underlying group communication infrastructure to pro...
     
Simple and fault-tolerant key agreement for dynamic collaborative groups
Found in: Proceedings of the 7th ACM conference on Computer and communications security (CCS '00)
By Adrian Perrig, Gene Tsudik, Yongdae Kim
Issue Date:November 2000
pp. 235-244
A fair exchange protocol allows two users to exchange items so that either each user gets the other's item or neither user does. In [2], verifiable encryption is introduced as a primitive that can be used to build extremely efficient fair exchange protocol...
     
 1