به نام خدا
Title: Inductive Data Flow Graphs
Authors: Azadeh Farzan Zachary Kincaid, Andreas Podelski
Abstract: The correctness of a sequential program can be shown by the annotation of its control flow graph with inductive assertions. We pro-pose inductive data flow graphs, data flow graphs with incorporated inductive assertions, as the basis of an approach to verifying concurrent programs. An inductive data flow graph accounts for a set of dependencies between program actions in interleaved thread executions, and therefore stands as a representation for the set of concurrent program traces which give rise to these dependencies. The approach first constructs an inductive data flow graph and then checks whether all program traces are represented. The size of the inductive data flow graph is polynomial in the number of data dependencies (in a sense that can be made formal); it does not grow exponentially in the number of threads unless the data dependencies do. The approach shifts the burden of the exponential explosion towards the check whether all program traces are represented, i.e., to a combinatorial problem (over finite graphs).
Publish Year: 2013
Published in: ACM-SIGPLAN-SIGACT
Number of Pages: 14
موضوع: نظریه گراف (Graph Theory)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Minimizing Transmit Power for Cooperative Multicell System with Massive MIMO
Authors: Jinkyu Kang and Joonhyuk Kang
Abstract: We consider the problem of designing transmit beam former and power for downlink cooperative base-station(BS) system with a large antenna arrays. Since the design of the beam forming vector at the transmitter requires high computational complexity, in a large antenna arrays, we utilize the zero-forcing transmit beamformer, which is the simplest form and the optimal performance in a large antenna arrays. Therefore, this paper focuses on the design of power allocation with n¼üxed transmit beam former for minimizing the transmit power while meeting target signal-to-interference-and-noise-ratio(SINR) of each user and power constraints. We consider two scenarios according to the power constraints of cooperative BSs.One scenario is the sum power constraint on the cooperative base-stations. In this case, the cooperative BSs share the total available transmit power. However, each BS exists a maximum availabletransmit power in practical implementations. Thus, we consider amore realistic per BS power constraints. We proposed the solution strategies for both scenarios: For the sum power constraint case,a simple intuitive solution, where the power is allocated withoutregard to the power constraint until the SINR constraints issatisn¼üed, is presented. For the per BS power constraints case, weuse the properties of a large antenna arrays to n¼ünd the solution ofclosed form. We also demonstrate, via numerical simulation, the performance of proposed strategy is convergent to the optimal performance which is achieved by using the iterative algorithm.
Publish Year: 2013
Published in: CCNC - IEEE
Number of Pages: 5
موضوع: الکترونیک
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Slender-Set Differential Cryptanalysis
Authors: Julia Borghoff, Lars R Knudsen, Gregor Leander, and Sren S Thomsen
Abstract: This paper considers PRESENT-like ciphers with key-dependent S-boxes. We focus on the setting where the same selection of S-boxes is used in every round. One particular variant with 16 rounds, proposed in 2009, is broken in practice in a chosen plaintext/chosen cipher text scenario. Extrapolating these results suggests that up to 28 rounds of such ciphers can be broken. Furthermore, we outline how our attack strategy can be applied to an extreme case where the S-boxes are chosen uniformly at random for each round, and where the bit permutation is key-dependent as well.
Publish Year: 2013
Published in: Journal of Cryptography - Journal of Springer
Number of Pages: 28
موضوع: رمزنگاری (Cryptography)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Reconstructing a Fragmented Face from a Cryptographic Identification Protocol
Authors: Andy Luong, Michael Gerbush, Brent Waters, Kristen Grauman
Abstract: Secure Computation of Face Identification (SCiFI) [20]is a recently developed secure face recognition system that ensures the list of faces it can identify (e.g., a terrorist watch list) remains private. In this work, we study the consequences of malformed input attacks on the system-from both a security and computer vision standpoint. In particular, we present 1) a cryptographic attack that allows dishonest user to undetectably obtain a coded representation of faces on the list, and 2) a visualization approach that exploits this breach, turning the lossy recovered codes into human-identifiable face sketches. We evaluate our approach on two challenging datasets, with face identification tasks given to a computer and human subjects. Whereas prior work considered security in the setting of honest in-puts and protocol execution, the success of our approach underscores the risk posed by malicious adversaries to to-days automatic face recognition systems.
Publish Year: 2013
Published in: WACV - IEEE
Number of Pages: 8
موضوع: پردازش تصویر، رمزنگاری
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Online Advertising and its Security and Privacy Concerns
Authors: Angelia, Davar Pishva
Abstract: Commercial advertising has greatly benefitted from Internet services and online advertising can even be considered as the foundation of web economy. However, despite the availability of many books on how to create, use and make profit from online advertisement; there is little in-depth study on its true nature, security and privacy concerns. Through this research, the authors were able to establish an in-depth understanding of online advertising by collecting and analyzing numerous data on online advertising, with the hope that it could serve as a basis for further study on the field. The authors have also examined the security and privacy concerns of online advertising and the various gimmicks used to victimize innocent people. On the positive side, the paper explains the attractiveness of free online advertising services and the mechanism though which website owners profit from hosting online advertisements despite the fact that neither advertisers nor users pay for the services. On the negative side, the paper shows how online advertising hosts could be victimized by some shroud users for their money making purposes by continuous clicking of online advertisements without any intention of purchase. It also cites cases in which some website owners have marketed users_ private information behind the scene. The paper concludes by highlighting pros and cons of online advertising, Le., despite its numerous advantages, such as efficiency and range, it presents many dangers to advertisers, providers, website owners, and users.
Publish Year: 2013
Published in: ICACT - IEEE
Number of Pages: 6
موضوع: امنیت اطلاعات (Information Security)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
