检索结果-内蒙古大学图书馆

Zero Knowledge Proof based authentication protocol using graph isomorphism

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Saluja, Lavish Bhatia, Ashutosh Department of Electrical and Electronics Engineering Birla Institute of Technology and Science Pilani - Pilani Pilani India Department of Computer Science and Information Systems Birla Institute of Technology and Science Pilani - Pilani Pilani India

We live in an era of information and it is very important to handle the exchange of information. While sending data to an authorized source, we need to protect it from unauthorized sources, changes, and authentication. ZKP technique can be used in designing secure authentication systems which don’t involve any direct exchange of information between the claimant and the verifier thus preventing any possible leak of personal information. We propose a Zero-Knowledge Proof (ZKP) algorithm based on isomorphic graphs. We suggest most of the computations should be carried out on user’s web browser without revealing the password to the server at any point of time. Instead, it will generate random graphs and their permutations based on the login ID and password. Copyright © 2019, The Authors. All rights reserved.

关键词： Authentication

Crowdsourcing with Heterogeneous Workers in Social Networks

学校读者我要写书评

暂无评论

Crowdsourcing with Heterogeneous Workers in Social Networks

IEEE Global Communications Conference

作者： Chao Huang Haoran Yu Jianwei Huang Randall A Berry Department of Information Engineering The Chinese University of Hong Kong Department of Electrical and Computer Engineering Northwestern University School of Science and Engineering The Chinese University of Hong Kong Shenzhen Shenzhen Institute of Artificial Intelligence and Robotics for Society Northwestern University Evanston IL USA

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

Many online social networking platforms are leveraging crowdsourcing to enhance the user experience. These platforms seek to incentivize heterogeneous workers to exert efforts to complete tasks (e.g., evaluation of posts and articles) and truthfully report their solutions. An output agreement mechanism (e.g., majority voting) is a common approach to this end. In an output agreement mechanism, a worker is rewarded according to whether his solution matches those of his peers. However, prior related work has not considered workers with heterogeneous solution accuracy and how this heterogeneity affects a platform's payoff. We fill this void by modeling and analyzing the interactions between a platform and workers as a two-stage Stackelberg game. In Stage I, the platform chooses the reward level for the majority voting to maximize its payoff. In Stage II, the workers decide their effort levels and reporting strategies to maximize their payoffs. We show that as a worker's solution accuracy increases, he is more likely to exert effort and truthfully report his solution at the equilibrium. However, given a fixed worker population, it is surprising that the platform's payoff does not monotonically increase in the number of high-accuracy workers. This is because a larger number of high-accuracy workers brings marginally decreasing benefit to the platform, but the rewards required to incentivize them may significantly grow. Moreover, we show that as the solutions of the high-accuracy workers become more accurate, the platform needs a smaller number of such workers to achieve the maximum payoff.

关键词： Games Crowdsourcing Nash equilibrium Social networking (online) User experience

Blockchain for giving patients control over their medical records

学校读者我要写书评

暂无评论

TechRxiv

TechRxiv 2020年

作者： Madine, Mohammad Battah, Ammar Yaqoob, Ibrar Salah, Khaled Jayaraman, Raja Al-Hammadi, Yousof Pesic, Sasa Ellahham, Samer The Department of Electrical Engineering and Computer Science Khalifa University Abu Dhabi127788 United Arab Emirates The Department of Industrial and Systems Engineering Khalifa University Abu Dhabi127788 United Arab Emirates ASU’s Blockchain Research Laboratory Arizona State University TempeAZ85281 United States Heart & Vascular Institute Cleveland Clinic Abu Dhabi Abu Dhabi United Arab Emirates

Personal health records (PHRs) are valuable assets to individuals because they enable them to integrate and manage their medical data. A PHR is an electronic application through which patients can manage their health information. Giving patients control over their medical data offers an advantageous realignment of the doctor-patient dynamic. However, today’s PHR management systems fall short of giving reliable, traceable, trustful, and secure patients control over their medical data, which poses serious threats to their authenticity and accuracy. Moreover, most of the current approaches and systems leveraged for managing PHR are centralized that not only make medical data sharing difficult but also poses a risk of single point of failure problem. In this paper, we propose Ethereum blockchain-based smart contracts to give patients control over their data in a manner that is decentralized, immutable, transparent, traceable, trustful, and secure. The proposed system employs decentralized storage of interplanetary file systems (IPFS), proxy re-encryption, and trusted reputation-based oracles to securely fetch, store, and share patients’ medical data. We present algorithms along with their full implementation details. We evaluate the proposed smart contracts using two important performance metrics, such as cost and correctness. Furthermore, we provide security analysis and discuss the generalization aspects of our solution. We outline the limitations of the proposed approach. We make the smart contract source code publicly available on Github. © 2020, CC BY.

关键词： Smart contract

A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Mokhtari, Aryan Ozdaglar, Asuman Pattathil, Sarath Laboratory for Information and Decision Systems Massachusetts Institute of Technology CambridgeMA United States Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA United States

In this paper we consider solving saddle point problems using two variants of Gradient Descent- Ascent algorithms, Extra-gradient (EG) and Optimistic Gradient Descent Ascent (OGDA) methods. We show that both of these algorithms admit a unified analysis as approximations of the classical proximal point method for solving saddle point problems. This viewpoint enables us to develop a new framework for analyzing EG and OGDA for bilinear and strongly convex- strongly concave settings. Moreover, we use the proximal point approximation interpretation to generalize the results for OGDA for a wide range of parameters. Copyright © 2019, The Authors. All rights reserved.

关键词： Gradient methods

Convergence rate of O(1/k) for optimistic gradient and extra-gradient methods in smooth convex-concave saddle point problems

学校读者我要写书评

暂无评论

arXiv 2019年

We study the iteration complexity of the optimistic gradient descent-ascent (OGDA) method and the extra-gradient (EG) method for finding a saddle point of a convex-convex uncon- strained min-max problem. To do so, we first show that both OGDA and EG can be interpreted as approximate variants of the proximal point method. We then exploit this interpretation to show that both algorithms produce iterates that remain within a bounded set. We further show that the function value of the averaged iterates generated by both of these algorithms converge with a rate of O(1/k) to the function value at the saddle point. Our theoretical analysis is of interest as it provides a simple convergence analysis for the EG algorithm in terms of function value without using compactness assumption. Moreover, it provides the first convergence rate estimate for OGDA in the general convex-concave setting. Copyright © 2019, The Authors. All rights reserved.

关键词： Gradient methods

Competitive contagion with sparse seeding

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Siami, Milad Ajorlou, Amir Jadbabaie, Ali Institute for Data Systems and Society Massachusetts Institute of Technology CambridgeMA02139 United States Electrical and Computer Engineering Department Northeastern University BostonMA02115 United States

This paper studies a strategic model of marketing and product diffusion in social networks. We consider two firms offering substitutable products which can improve their market share by seeding the key individuals in the market. Consumers update their consumption level for each of the two products as the best response to the consumption of their neighbors in the previous period. This results in linear update dynamics for the product consumption. Each consumer receives externality from the consumption of each neighbor where the strength of the externality is higher for consumption of the products of the same firm. We represent the above setting as a duopoly game between the firms and introduce a novel framework that allows for sparse seeding to emerge as an equilibrium strategy. We then study the effect of the network structure on the optimal seeding strategies and the extent to which the strategies can be sparsified. In particular, we derive conditions under which near Nash equilibrium strategies can asymptotically lead to sparse seeding in large populations. The results are illustrated using a coreperiphery network. Copyright © 2019, The Authors. All rights reserved.

关键词： Game theory

From Population Games to Payoff Dynamics Models: A Passivity-Based Approac

学校读者我要写书评

暂无评论

From Population Games to Payoff Dynamics Models: A Passivity...

IEEE Annual Conference on Decision and Control

作者： Shinkyu Park Nuno C. Martins Jeff S. Shamma Department of Mechanical and Aerospace Engineering Princeton University Princeton NJ USA Department of Electrical and Computer Engineering and the Institute for Systems Research University of Maryland College Park MD USA Computer Electrical and Mathematical Science and Engineering Division (CEMSE) King Abdullah University of Science and Technology (KAUST) Thuwal Saudi Arabia

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113999

This tutorial article describes a dynamical systems framework rooted in evolutionary game principles to characterize non-cooperative strategic interactions among large populations of bounded rationality agents. It also overviews recent results that use passivity notions to characterize the stability of Nash-like equilibria. In our framework, each agent belongs to a population that prescribes to its members a strategy set and a strategy revision protocol. A so-called social state registers the proportions of agents in every population adopting each strategy and a pre-selected dynamic payoff mechanism, specified by a payoff dynamics model (PDM), determines the payoff as a causal map of the social state. According to the framework, each agent must take up a strategy at a time, which it can repeatedly revise over time based on its current strategy, and information about the payoff and social state available to it. The PDM class considered in our framework can model precisely or approximately prevalent dynamic behaviors such as inertia and delays that are inherent to learning and network effects, which cannot be captured using conventional memoryless payoff mechanisms (often referred to as population games).We organize the article in two main parts. The first introduces basic concepts prevailing in existing approaches in which a population game determines the payoff, while the second considers rather general PDM classes, of which every population game is a particular case. The latter expounds a passivity-based methodology to characterize convergence of the social state to Nash-like equilibria.

关键词： Sociology Statistics Games Stability analysis Tutorials Protocols Delays

Wildfire Monitoring in Remote Areas using Autonomous Unmanned Aerial Vehicles

学校读者我要写书评

暂无评论

Wildfire Monitoring in Remote Areas using Autonomous Unmanne...

IEEE Conference on computer Communications Workshops, INFOCOM Wksps

作者： Fatemeh Afghah Abolfazl Razi Jacob Chakareski Jonathan Ashdown School of Informatics Computing and Cyber Systems Northern Arizona University Flagstaff AZ USA Electrical and Computer Engineering University of Alabama Tuscaloosa AL USA Computer Information Systems Department SUNY Polytechnic Institute Utica NY USA

In this paper, we propose a drone-based wildfire monitoring system for remote and hard-to-reach areas. This system utilizes autonomous unmanned aerial vehicles (UAVs) with the main advantage of providing on-demand monitoring service faster than the current approaches of using satellite images, manned aircraft and remotely controlled drones. Furthermore, using autonomous drones facilitates minimizing human intervention in risky wildfire zones. In particular, to develop a fully autonomous system, we propose a distributed leader-follower coalition formation model to cluster a set of drones into multiple coalitions that collectively cover the designated monitoring field. The coalition leader is a drone that employs observer drones potentially with different sensing and imaging capabilities to hover in circular paths and collect imagery information from the impacted areas. The objectives of the proposed system include: i) to cover the entire fire zone with a minimum number of drones, and ii) to minimize the energy consumption and latency of the available drones to fly to the fire zone. Simulation results confirm that the performance of the proposed system- without the need for inter-coalition communications- approaches that of a centrally-optimized system.

关键词： Drones Monitoring Robot sensing systems Task analysis Observers Forestry

Effective Computation of All Stabilizing Gain and Delay Regions for MIMO systems 14

学校读者我要写书评

暂无评论

Effective Computation of All Stabilizing Gain and Delay Regi...

14th IEEE International Conference on Control and Automation, ICCA 2018

作者： Qing-Guo, Wang Nguyen, Le Binh Institute for Intelligent Systems Faculty of Engineering and the Built Environment University of Johannesburg South Africa Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore

ISBN: (纸本)9781538660898

This paper deals with determining all the loop gain and delay regions for closed-loop stability of a multivariable system. Such a problem admits no analytical solutions in general. Instead, we graphically determine stability boundaries in the gain-delay space based on the condition of the intersection of the characteristic loci with the critical point and decide stability of the regions divided by these boundaries with helps of a new perturbation analysis of parameters on change of closed-loop poles. This procedure yields all the stable regions, each of which captures the full information on the stabilizing loop gain interval versus any loop delay. The regions then also contain, as by- product, the information on gain and delay margins for stability. The stabilizing set is useful for stability robustness analysis, robust control design and system optimization. Several examples are provided to illustrate the effectiveness of the method. © 2018 IEEE.

关键词： MIMO systems