scholarly journals TUC: Time-Sensitive and Modular Analysis of Anonymous Communication

2014 ◽  
Author(s):  
Michael Backes ◽  
Praveen Manoharan ◽  
Esfandiar Mohammadi
Keyword(s):  
Anonymous Communication ◽  
Modular Analysis

Interval Centroid Based Flow Watermarking Technique for Anonymous Communication Traceback

2011 ◽  
Vol 22 (10) ◽  
pp. 2358-2371 ◽  
Author(s):  
Lu ZHANG ◽  
Jun-Zhou LUO ◽  
Ming YANG ◽  
Gao-Feng HE
Keyword(s):  
Anonymous Communication

Cryptographic Applications

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Case Studies ◽  
Security Requirements ◽  
The Internet ◽  
Anonymous Communication ◽  
Mobile Telecommunications ◽  
Payment Card ◽  
Video Broadcasting ◽  
Digital Currency ◽  
Identity Cards

This chapter considers eight applications of cryptography. These essentially act as case studies relating to all the previous material. For each application, we identify the security requirements, the application constraints, the choice of cryptography used, and the ways that the keys are managed. We begin with the SSL/TLS protocols used to secure Internet communications. We then examine the cryptography used in W-Fi networks, showing that early cryptographic design mistakes have subsequently been corrected. We then examine the evolving cryptography used to secure mobile telecommunications. This is followed by a discussion of the cryptography that underpins the security of payment card transactions. We look at the cryptography of video broadcasting and identity cards. We then examine the cryptography behind the Tor project, which use cryptography to support anonymous communication on the Internet. Finally, we examine the clever cryptographic design of Bitcoin, showing how use of cryptography can facilitate digital currency.

scholarly journals 20,000 In League Under the Sea: Anonymous Communication, Trust, MLATs, and Undersea Cables

2015 ◽  
Vol 2015 (1) ◽  
pp. 4-24 ◽  
Author(s):  
Aaron D. Jaggard ◽  
Aaron Johnson ◽  
Sarah Cortes ◽  
Paul Syverson ◽  
Joan Feigenbaum
Keyword(s):  
Autonomous System ◽  
Probability Distributions ◽  
Arms Race ◽  
Experimental Results ◽  
Modular System ◽  
Anonymous Communication ◽  
Legal Assistance ◽  
Correlation Attacks ◽  
Submarine Cables ◽  
Undersea Cables

Abstract Motivated by the effectiveness of correlation attacks against Tor, the censorship arms race, and observations of malicious relays in Tor, we propose that Tor users capture their trust in network elements using probability distributions over the sets of elements observed by network adversaries. We present a modular system that allows users to efficiently and conveniently create such distributions and use them to improve their security. To illustrate this system, we present two novel types of adversaries. First, we study a powerful, pervasive adversary that can compromise an unknown number of Autonomous System organizations, Internet Exchange Point organizations, and Tor relay families. Second, we initiate the study of how an adversary might use Mutual Legal Assistance Treaties (MLATs) to enact surveillance. As part of this, we identify submarine cables as a potential subject of trust and incorporate data about these into our MLAT analysis by using them as a proxy for adversary power. Finally, we present preliminary experimental results that show the potential for our trust framework to be used by Tor clients and services to improve security.

scholarly journals Incremental and Modular Context-sensitive Analysis

2021 ◽  
pp. 1-48
Author(s):  
ISABEL GARCIA-CONTRERAS ◽  
JOSÉ F. MORALES ◽  
MANUEL V. HERMENEGILDO
Keyword(s):  
Global Analysis ◽  
Memory Consumption ◽  
Sensitive Analysis ◽  
Analysis Techniques ◽  
Context Sensitive ◽  
Fine Grained ◽  
Fine Grain ◽  
Modular Analysis ◽  
Modular Algorithm ◽  
Modular Structures

Abstract Context-sensitive global analysis of large code bases can be expensive, which can make its use impractical during software development. However, there are many situations in which modifications are small and isolated within a few components, and it is desirable to reuse as much as possible previous analysis results. This has been achieved to date through incremental global analysis fixpoint algorithms that achieve cost reductions at fine levels of granularity, such as changes in program lines. However, these fine-grained techniques are neither directly applicable to modular programs nor are they designed to take advantage of modular structures. This paper describes, implements, and evaluates an algorithm that performs efficient context-sensitive analysis incrementally on modular partitions of programs. The experimental results show that the proposed modular algorithm shows significant improvements, in both time and memory consumption, when compared to existing non-modular, fine-grain incremental analysis techniques. Furthermore, thanks to the proposed intermodular propagation of analysis information, our algorithm also outperforms traditional modular analysis even when analyzing from scratch.

Sign in / Sign up

Export Citation Format

Share Document