747 research outputs found
Web demo suite for classical ciphers
No full textThis project aims to implement a web-based application that includes well-known classical
ciphers as an accompany learning material for students studying cryptography. This project is
developed using frameworks such as HTML5 and Bootstrap. This report includes further
details of the methodology adopted by the author while developing the web-based
application. The author took note of other technical considerations and software design
models while creating the web-based application. The web application is developed solely by
the author. Suggestions given by Assoc Prof Anwitaman Datta are implemented in best effort
during the course of this project. The web-based application described in this report can be
found at the following website:
http://ryan2706.github.io/SCE15-0041/index.htmlBachelor of Engineering (Computer Science
Replication Data for: Misleading the Covid-19 vaccination discourse on Twitter: An exploratory study of infodemic around the pandemic
No full textTwo files are provided. Each contain Tweet ID, Label pairs. Label 1 indicates misleading tweets, while label 0 is used otherwise.
One file contains 1500 manually annotated entries, while the other contains 114,635 where the labels are predicted algorithmically (see accompanying publication, arXiv:2108.10735, for details). The manual annotation was best-effort, and the predicted labels are not vetted, and is limited by the quality of manual labels used to train the algorithms, as well as any other shortcomings of the algorithms. The data is being provided on an as-is basis, but we do not accept any responsibility for its use, nor any consequences therefrom.
The data is provided following the FAIR Data Principles (Findable, Accessible, Interoperable, and Reusable) and Twitter's content redistribution policy (see: https://developer.twitter.com/en/developer-terms
Analysis of multi‐input multi‐output transactions in the Bitcoin network
No full textDistinct transactions among different and unrelated users are combined together to create a
single Bitcoin transaction (mixing transaction) to obfuscate the relationships among the actual
*Anwitaman Datta Email: participants (more specifically, the wallet addresses used for the transactions). We consider multi-
[email protected] input multi-output transactions with at least two inputs and three outputs as proxy, to analyze
Present Address four characteristic periods of ∼50 days each, representing periods before the introduction of
School of Computer Science and Engineering mixing, in its early days, during its growth, and after the volume of such multi-input multi-output
Blk N4 (office: 02A-18), North Spine Nanyang
Avenue, Nanyang Technological University
Singapore 639798
transactions became more or less stabile. Structural properties and characteristics of the transac-
tion and wallet address networks are computed and compared, through standard tools, but also
via the introduction of two novel techniques that provide indicators of mixing-like behaviors: (i)
an entropy characterization to detect abnormally uniform inputs and/or outputs, and (ii) a con-
nected component analysis of subgraphs formed by only multi-input multi-output transactions
(showing cascades of such transactions). The contributions of this exploratory Bitcoin network
analysis paper can thus be seen as two-fold. At a macroscopic level, the growth and stabilization
periods are shown to stand out with respect to most considered metrics, while at a microscopic
level, chains of multi-input multi-output transactions, and transactions with outlier behavior in
terms of input/output entropies are identified for further investigation.Accepted versio
A web demo suite for the Enigma Cipher
No full textWorking on Final Year Project was meant to be a practically good chance and valuable experience. I would like to take this opportunity to thank Nanyang Technological University. I would like to express my sincere gratitude to thank my supervisor, Ast/P Anwitaman Datta for his advice, assistance and marvelous guidance throughout my FYP program. Along with his helps I would be able to further drive my progress in the development of the FYP program. Being attached to the FYP program is a great opportunity to explore the development and improve learning skills. I have learned a lot of lessons and I have gained technical skills and got to understand problem solving.
In addition, I would like to give a great thanks to Phetsouvanh Silivanxay for his assistance and heartfelt helps during my Final Year Project, without his helps all the issues and given tasks of mine would not be driven and passed successfully. With his advice and programming skill, the project was supported and guided toward the right direction of implementation.
Lastly, I would like to express my thanks to all the people who have helped me and I do appreciate the effort your assistance throughout my Final Year Project.Bachelor of Engineering (Computer Science
Dr. Monti Datta – Faculty Author Interview
No full textDr. Monti Datta, Assistant Professor of Political Science, discusses his forthcoming new book, Anti-Americanism and the Rise of World Opinion. Drawing from a wealth of research data, interviews and surveys of social media, this book directly examines pro- and anti-American views and asks what we can learn about the nature and impact of world opinion. By treating anti-Americanism as a case study of public opinion at work, Professor Datta reveals how we can better understand the relationship between global citizens and their political leaders, and concludes that anti-Americanism does in fact substantially impact US security, as well as its economic and political interests
Concurrency control and consistency over erasure coded data
No full textFor over a decade, erasure codes have become an integral part of large-scale data storage solutions and data-centers. However, in commercial systems, they are, so far, used predominantly for static data. In the meanwhile, there has also been almost a decade and a half of research on mutable erasure coded data, looking at various associated issues, including update computation, concurrency control and consistency, which has led to a variety of reasonably mature techniques. In this work we aim at curating and systematizing this knowledge on managing mutable erasure coded data. We believe the time is right, both because of the richness and maturity of the literature itself, and also, given the pervasiveness of erasure codes in data-centers, because it is natural to expect a transition to accommodate mutable content using erasure coded redundancy in order to support more diverse and versatile overlying applications, while benefiting from the advantages (particularly, that of significantly lower storage overhead) of erasure codes.Ministry of Education (MOE)Nanyang Technological UniversityPublished versionThe work of Anwitaman Datta was supported by the Ministry of Education (MoE), Singapore, under its Academic Research Fund Tier 1 though the Project Title ‘‘StorEdge: Data Store Along a Cloud-To-Thing Continuum with Integrity and Availability’’ under Project 2018-T1-002-076. The work of Frédérique Oggier was supported by Nanyang Technological University, Singapore, Start-Up Grant
Tapping Economies of Scale and Scope in Consumer Cooperation - A Case Analysis of Possible Cooperation among selected Cooperatives
No full textBecause of its narrow and negative perspective of safeguarding the interests of only poor consumers against unethical practices of the private traders, consumer cooperation in India seems to have failed, except probably in some isolated pockets. A number of social welfare functions like poverty alleviation and public distribution of essential items of consumption have been imposed on them at the cost of their basic economics. With the basic micro and macro-economic rationale for consumer cooperatives as a positive form of economic organization being lost sight of, they seem to be facing enormous problems both historically as well as currently in a era of economic liberalization. Their worries seem to have been compounded with the threat of impending competition from large private enterpriss - both domestic and foreign, which highlights the need for evolving strategies to rectivy their systemic weaknesses and tackling the competition head on. This case has attempted to document just such an initiative through a round table conference with several doyens of the consumer cooperative movement in India such as Warana Bazar and Amalsad Mandali as well as some fledging consumer cooperatives from West Bengal which are already in existence for some time or contemplating entry into this field. The roundtable conference organized in the spirit of Cooperation among Cooperatives attempted to evolve strategies to capture economies of scale and scope in order to take on the competition, as well as to facilitate dissemination of ideas and information across the country.
Merging ring-structured overlay indices : toward network-data transparency
No full textPeer-to-peer index structures distributed and managed over the planet, commonly known as structured overlays (e.g., distributed hash tables) have been touted to play the role of a fundamental building block for internet-scale distributed systems. Traditional designs consider incremental or possibly even parallelized construction of a single overlay, which implicitly assumes global control and coordination to enforce the construction of an unique overlay. However, if merger of originally isolated overlays is made possible, then one can realize decentralized bootstrapping of overlays. So to say, smaller overlays can be constructed using any of the traditional mechanisms, which can then organically coalesce to form a larger overlay. Such self-organizational attributes of decentralized bootstrapping and organic growth are of paramount importance for large scale systems. In our previous works, we explained the challenges of merging important families of (tree and ring) structured overlays (Datta and Aberer in international workshop on self-organizing systems, 2006), and identified that tree structured overlays are relatively easier to merge in a transparent manner (Datta in IEEE international conference on self-adaptive and self-organizing systems, 2007). In this paper we investigate how ring structured overlays can be merged, both in terms of the necessary algorithms, as well as how it performs during the merger process, taking into account not only the ‘network’ merger process, but also looking into how and whether this process is ‘transparent’ for applications/end-users accessing and using the overlay as an index. We introduce interesting new metrics to evaluate the merger process and carry out asymptotic analysis for estimating the same, besides conducting simulation experiments to validate the theory as well as measure other aspects of the overlays’ performance under merger
Advanced Peer-to-Peer Networking: The P-Grid System and Its Applications
No full textThe limitations of client/server systems become evident in an Internet-scale distributed environment. Peer-to-peer (P2P) systems offer an interesting alternative to traditional client/server systems: Every node acts both as a client and a server and “pays ” its participation by providing access to its computing resources. Systems such as Napster and Gnutella have proven their practical applicability. In this article we give an overview of our P-Grid system which provides an advanced P2P infrastructure targeted at application domains beyond mere filesharing. We present the conceptual foundations and outline some of the applications we are developing at the moment.
Two-factor authentication for trusted third party free dispersed storage
No full textWe propose a trusted third party free protocol for secure (in terms of content access, manipulation, and confidentiality) data storage and multi-user collaboration over an infrastructure of untrusted storage servers. It is achieved by the application of data dispersal, encryption as well as two-factor (knowledge and possession) based authentication and access control techniques so that unauthorized parties (attackers) or a small set of colluding servers cannot gain access to the stored data. The protocol design takes into account usability issues as opposed to the closest prior work Esiner and Datta (2016). We explore the security implications of the proposed model with event tree analysis and report on experiment results to demonstrate the practicality of the approach concerning computational overheads. Given that the protocol does not rely on any trusted third party, and most operations including actual collaboration do not require users to be online simultaneously, it is suitable not only for traditional multi-cloud setups but also for edge/fog computing environments.Accepted versio
- …
