摘要 :
A new approach to the characterization of network connectivity under transmission rate and secrecy constraints is proposed, based on a rate-secrecy graph model. The proposed model is based on an information theoretic framework, an...
展开
A new approach to the characterization of network connectivity under transmission rate and secrecy constraints is proposed, based on a rate-secrecy graph model. The proposed model is based on an information theoretic framework, and rate-distortion requirements are used to characterize the level of secrecy for individual links in the network. Rate-secrecy-connectivity tradeoffs are illustrated and it is shown that by relaxing the secrecy constraint, an acceptable secrecy level can be achieved while significantly improving network connectivity and transmission rate efficiency for the wireless nodes.
收起
摘要 :
Purpose - The current study provides a literature review on secrecy as mechanism for appropriating value from innovation. It synthesizes previous findings into a framework that can explain the advantages of exercising secrecy vers...
展开
Purpose - The current study provides a literature review on secrecy as mechanism for appropriating value from innovation. It synthesizes previous findings into a framework that can explain the advantages of exercising secrecy versus patenting. It also examines the management lifecycle of secrecy. Design/methodology/approach - It takes a dynamic perspective and suggests a four-stage secrecy management lifecycle: creation of secret, installation of preventive mechanisms, protection and exploitation, and minimization of leakage. Findings - Based on the four stages, the study highlights under-researched areas, and develops a future research agenda for secrecy management. Originality/value - Despite the managerial and academic relevance of this topic, extant research does not offer a comprehensive framework for the concept of secrecy. This study provides a dynamic perspective to highlight the important aspects of secrecy management during the lifecycle of secrets. (C) 2015 Elsevier Inc. All rights reserved.
收起
摘要 :
Analyzing wireless communication performances by using information-theoretic results is of practical importance. In this paper, first, an achievable secrecy rate region and an outer bound on the secrecy capacity region for the dis...
展开
Analyzing wireless communication performances by using information-theoretic results is of practical importance. In this paper, first, an achievable secrecy rate region and an outer bound on the secrecy capacity region for the discrete alphabet and memoryless wiretap channel with side information non-causally known at the transmitter are obtained. Then, by extending the results to the continuous alphabet wireless wiretap channel and by deriving a closed-form expression on the secrecy coverage region (SCR), as a remarkable wireless performance factor, impact of side information on the SCR is analyzed and it is shown that side information increases the SCR as expected intuitively. Numerical evaluation of theoretical results is done finally.
收起
摘要 :
While scholarly literature has paid attention to human intelligence professionalism from the perspective of the agent handler, we know relatively little about the precarious positions in which (double) agents often find themselves...
展开
While scholarly literature has paid attention to human intelligence professionalism from the perspective of the agent handler, we know relatively little about the precarious positions in which (double) agents often find themselves and what their ensuing needs from their handlers consist of. This article suggests that (double) agents desire a reciprocal, affect-based relationship with their handlers, involving trust and gratitude, more than just a negotiated relationship based on (financial) agreements. This article explains the importance of such a relationship. The main source of this research consists of original, in-depth oral history interviews with former double agent "M." He operated from the 1960s through the 1990s for the Dutch Security Service and the Central Intelligence Agency against the East German Ministerium fur Staatssicherheit. The article analyzes the varying degrees of appreciation that these services showed for his work, and it investigates their consequences on the psychological well-being of the double agent.
收起
摘要 :
A question facing nearly all private firms is whether they may keep employee pay secret. Many think it is obvious that firms are obligated to disclose a good deal of pay information once we properly appreciate the severity of pay ...
展开
A question facing nearly all private firms is whether they may keep employee pay secret. Many think it is obvious that firms are obligated to disclose a good deal of pay information once we properly appreciate the severity of pay discrimination in our economy and the autonomy-related interests that would be served by pay disclosure. This article puts forth a dissenting voice against the vast majority of recent commentary. It exploits a fissure between reasons we have to support certain coercive regulations and reasons firms have to act in the absence of such regulation. While acknowledging that we may need transparency regulations for firms that fail to act morally, it argues that otherwise moral firms need not disclose pay on the surveyed grounds.
收起
摘要 :
We investigate the relation between symbolic and cryptographic secrecy properties for cryptographic protocols. Symbolic secrecy of payload messages or exchanged keys is arguably the most important notion of secrecy shown with auto...
展开
We investigate the relation between symbolic and cryptographic secrecy properties for cryptographic protocols. Symbolic secrecy of payload messages or exchanged keys is arguably the most important notion of secrecy shown with automated proof tools. It means that an adversary restricted to symbolic operations on terms can never get the entire considered object into its knowledge set. Cryptographic secrecy essentially means computational indistinguishability between the real object and a random one, given the view of a much more general adversary. In spite of recent advances in linking symbolic and computational models of cryptography, no relation for secrecy under active attacks is known yet. For exchanged keys, we show that a certain strict symbolic secrecy definition over a specific Dolev-Yao-style cryptographic library implies cryptographic key secrecy for a real implementation of this cryptographic library. For payload messages, we present the first general cryptographic secrecy definition for a reactive scenario. The main challenge is to separate secrecy violations by the protocol under consideration from secrecy violations by the protocol users in a general way. For this definition, we show a general secrecy preservation theorem under reactive simulatability, the cryptographic notion of secure implementation. This theorem is of independent cryptographic interest. We then show that symbolic secrecy implies cryptographic payload secrecy for the same cryptographic library as used in key secrecy. Our results thus enable formal proof techniques to establish cryptographically sound proofs of secrecy for payload messages and exchanged keys.
收起
摘要 :
This article exploits spatial diversity for jamming to prevent wiretapping in the extreme case in which an eavesdropper is located near the source and a common jamming signal is unavailable. To address this challenge, the jamming ...
展开
This article exploits spatial diversity for jamming to prevent wiretapping in the extreme case in which an eavesdropper is located near the source and a common jamming signal is unavailable. To address this challenge, the jamming signal is allowed to carry a random binary message. Then, it is proposed that the active intermediate node transmits this jamming signal and the decoding of this signal at both source and destination is physically secured as result of using the physical-layer security method. If the source and the destination securely and correctly decode this jamming message, the source transmits another message which is created from combining its information message and the decoded message using the network-coding method. Therefore, this method prevents the transmissions from being eavesdropped upon by the source-wiretapping.
收起
摘要 :
Recently, to provide data confidentiality against intermediate relaying proxies, Hur, Shin, and Yoon proposed a decentralized group key management(GKM) scheme for dynamic networks that uses proxy cryptography. We show that the GKM...
展开
Recently, to provide data confidentiality against intermediate relaying proxies, Hur, Shin, and Yoon proposed a decentralized group key management(GKM) scheme for dynamic networks that uses proxy cryptography. We show that the GKM scheme unfortunately does not provide data confidentiality. We also present a counter measure to fix the security breaches.
收起
摘要 :
In this letter, we investigate a robust transmit optimization design based on an artificial noise (AN)-aided precoding scheme for maximizing secrecy rate in a multiple-input multiple-output multiple-eavesdropper multicast network ...
展开
In this letter, we investigate a robust transmit optimization design based on an artificial noise (AN)-aided precoding scheme for maximizing secrecy rate in a multiple-input multiple-output multiple-eavesdropper multicast network where a transmitter sends confidential information to multiple intended users and provides energy for multiple idle nodes while multiple passive eavesdroppers try to overhear the secret information. Supposing Gaussian CSI uncertainties, the proposed outage-constrained secrecy rate maximization (OC-SRM) problem is nonconvex and its analytical analysis is more challenging than several existing OC-SRM schemes. Technically, to circumvent this mathematically intractable secrecy problem, we resort to low SNR approximation and some conservative approximations (e.g., Bernstein-type inequality and sphere bounding) to reformulate the OC-SRM problem into two convex subproblems which can be efficiently solved by the off-the-shelf optimization solver. Simulation results are provided to validate the security performance of the robust AN-aided precoding design.
收起
摘要 :
This work has studied the physical layer security in cooperative automatic-repeat-request (CARQ), under the assumption of no instantaneous channel state information (CSI) at legitimate users. Different from present works, this pap...
展开
This work has studied the physical layer security in cooperative automatic-repeat-request (CARQ), under the assumption of no instantaneous channel state information (CSI) at legitimate users. Different from present works, this paper not only derives closed form expressions for connection outage probability (COP) and secrecy outage probability (SOP) to evaluate the reliability and security, respectively, but also first establishes the direct relationship between them via the reliability-security tradeoff (RST). Moreover, we present a novel formulation for secrecy throughput, which gives a more complete insight into the efficiency of CARQ achieving reliable and secure transmission.
收起
原文获取