2 research outputs found
Visual Execution Analysis for Multiagent Systems
Multiagent systems have become increasingly important in developing complex software systems. Multiagent systems introduce collective intelligence and provide benefits such as flexibility, scalability, decentralization, and increased reliability. A software agent is a high-level software abstraction that is capable of performing given tasks in an environment without human intervention. Although multiagent systems provide a convenient and powerful way to organize complex software systems, developing such system is very complicated. To help manage this complexity this research develops a methodology and technique for analyzing, monitoring and troubleshooting multiagent systems execution. This is accomplished by visualizing a multiagent system at multiple levels of abstraction to capture the relationships and dependencies among the agents
Optimization techniques and new methods for boradcast encryption and traitor tracing schemes
Ankara : The Department of Computer Engineering and the Graduate School of Engineering and Science of Bilkent University, 2012.Thesis (Ph. D.) -- Bilkent University, 2012.Includes bibliographical refences.In the last few decades, the use of digital content increased dramatically. Many
forms of digital products in the form of CDs, DVDs, TV broadcasts, data over
the Internet, entered our life. Classical cryptography, where encryption is
done for only one recipient, was not able to handle this change, since its direct
use leads to intolerably expensive transmissions. Moreover, new concerns
regarding the commercial aspect arised. Since digital commercial contents are
sold to various customers, unauthorized copying by malicious actors became
a major concern and it needed to be prevented carefully. Therefore, a new
research area called digital rights management (DRM) has emerged. Within
the scope of DRM, new cryptographic primitives are proposed. In this thesis,
we consider three of these: broadcast encryption (BE), traitor tracing (TT),
and trace and revoke (T&R) schemes and propose methods to improve the performances
and capabilities of these primitives. Particularly, we first consider
profiling the recipient set in order to improve transmission size in the most
popular BE schemes. We then investigate and solve the optimal free rider
assignment problem for one of the most efficient BE schemes so far. Next, we
attempt to close the non-trivial gap between BE and T&R schemes by proposing
a generic method for adding traitor tracing capability to BE schemes and
thus obtaining a T&R scheme. Finally, we investigate an overlooked problem:
privacy of the recipient set in T&R schemes. Right now, most schemes do not
keep the recipient set anonymous, and everybody can see who received a particular
content. As a generic solution to this problem, we propose a method
for obtaining anonymous T&R scheme by using anonymous BE schemes as a
primitive.Ak, MuratPh.D