Unbreakable distributed storage with quantum key distribution network and password-authenticated secret sharing.

PubMed

Fujiwara, M; Waseda, A; Nojima, R; Moriai, S; Ogata, W; Sasaki, M

2016-07-01

Distributed storage plays an essential role in realizing robust and secure data storage in a network over long periods of time. A distributed storage system consists of a data owner machine, multiple storage servers and channels to link them. In such a system, secret sharing scheme is widely adopted, in which secret data are split into multiple pieces and stored in each server. To reconstruct them, the data owner should gather plural pieces. Shamir's (k, n)-threshold scheme, in which the data are split into n pieces (shares) for storage and at least k pieces of them must be gathered for reconstruction, furnishes information theoretic security, that is, even if attackers could collect shares of less than the threshold k, they cannot get any information about the data, even with unlimited computing power. Behind this scenario, however, assumed is that data transmission and authentication must be perfectly secure, which is not trivial in practice. Here we propose a totally information theoretically secure distributed storage system based on a user-friendly single-password-authenticated secret sharing scheme and secure transmission using quantum key distribution, and demonstrate it in the Tokyo metropolitan area (≤90 km).

Combination of Sharing Matrix and Image Encryption for Lossless $(k,n)$ -Secret Image Sharing.

PubMed

Bao, Long; Yi, Shuang; Zhou, Yicong

2017-12-01

This paper first introduces a (k,n) -sharing matrix S (k, n) and its generation algorithm. Mathematical analysis is provided to show its potential for secret image sharing. Combining sharing matrix with image encryption, we further propose a lossless (k,n) -secret image sharing scheme (SMIE-SIS). Only with no less than k shares, all the ciphertext information and security key can be reconstructed, which results in a lossless recovery of original information. This can be proved by the correctness and security analysis. Performance evaluation and security analysis demonstrate that the proposed SMIE-SIS with arbitrary settings of k and n has at least five advantages: 1) it is able to fully recover the original image without any distortion; 2) it has much lower pixel expansion than many existing methods; 3) its computation cost is much lower than the polynomial-based secret image sharing methods; 4) it is able to verify and detect a fake share; and 5) even using the same original image with the same initial settings of parameters, every execution of SMIE-SIS is able to generate completely different secret shares that are unpredictable and non-repetitive. This property offers SMIE-SIS a high level of security to withstand many different attacks.

Deterministic MDI QKD with two secret bits per shared entangled pair

NASA Astrophysics Data System (ADS)

Zebboudj, Sofia; Omar, Mawloud

2018-03-01

Although quantum key distribution schemes have been proven theoretically secure, they are based on assumptions about the devices that are not yet satisfied with today's technology. The measurement-device-independent scheme has been proposed to shorten the gap between theory and practice by removing all detector side-channel attacks. On the other hand, two-way quantum key distribution schemes have been proposed to raise the secret key generation rate. In this paper, we propose a new quantum key distribution scheme able to achieve a relatively high secret key generation rate based on two-way quantum key distribution that also inherits the robustness of the measurement-device-independent scheme against detector side-channel attacks.

Quantum Key Distribution

NASA Astrophysics Data System (ADS)

Hughes, Richard

2004-05-01

Quantum key distribution (QKD) uses single-photon communications to generate the shared, secret random number sequences that are used to encrypt and decrypt secret communications. The unconditional security of QKD is based on the interplay between fundamental principles of quantum physics and information theory. An adversary can neither successfully tap the transmissions, nor evade detection (eavesdropping raises the key error rate above a threshold value). QKD could be particularly attractive for free-space optical communications, both ground-based and for satellites. I will describe a QKD experiment performed over multi-kilometer line-of-sight paths, which serves as a model for a satellite-to-ground key distribution system. The system uses single-photon polarization states, without active polarization switching, and for the first time implements the complete BB84 QKD protocol including, reconciliation, privacy amplification and the all-important authentication stage. It is capable of continuous operation throughout the day and night, achieving the self-sustaining production of error-free, shared, secret bits. I will also report on the results of satellite-to-ground QKD modeling.

Fast implementation of length-adaptive privacy amplification in quantum key distribution

NASA Astrophysics Data System (ADS)

Zhang, Chun-Mei; Li, Mo; Huang, Jing-Zheng; Patcharapong, Treeviriyanupab; Li, Hong-Wei; Li, Fang-Yi; Wang, Chuan; Yin, Zhen-Qiang; Chen, Wei; Keattisak, Sripimanwat; Han, Zhen-Fu

2014-09-01

Post-processing is indispensable in quantum key distribution (QKD), which is aimed at sharing secret keys between two distant parties. It mainly consists of key reconciliation and privacy amplification, which is used for sharing the same keys and for distilling unconditional secret keys. In this paper, we focus on speeding up the privacy amplification process by choosing a simple multiplicative universal class of hash functions. By constructing an optimal multiplication algorithm based on four basic multiplication algorithms, we give a fast software implementation of length-adaptive privacy amplification. “Length-adaptive” indicates that the implementation of privacy amplification automatically adapts to different lengths of input blocks. When the lengths of the input blocks are 1 Mbit and 10 Mbit, the speed of privacy amplification can be as fast as 14.86 Mbps and 10.88 Mbps, respectively. Thus, it is practical for GHz or even higher repetition frequency QKD systems.

Detector-device-independent quantum secret sharing with source flaws.

PubMed

Yang, Xiuqing; Wei, Kejin; Ma, Haiqiang; Liu, Hongwei; Yin, Zhenqiang; Cao, Zhu; Wu, Lingan

2018-04-10

Measurement-device-independent entanglement witness (MDI-EW) plays an important role for detecting entanglement with untrusted measurement device. We present a double blinding-attack on a quantum secret sharing (QSS) protocol based on GHZ state. Using the MDI-EW method, we propose a QSS protocol against all detector side-channels. We allow source flaws in practical QSS system, so that Charlie can securely distribute a key between the two agents Alice and Bob over long distances. Our protocol provides condition on the extracted key rate for the secret against both external eavesdropper and arbitrary dishonest participants. A tight bound for collective attacks can provide good bounds on the practical QSS with source flaws. Then we show through numerical simulations that using single-photon source a secure QSS over 136 km can be achieved.

A no-key-exchange secure image sharing scheme based on Shamir's three-pass cryptography protocol and the multiple-parameter fractional Fourier transform.

PubMed

Lang, Jun

2012-01-30

In this paper, we propose a novel secure image sharing scheme based on Shamir's three-pass protocol and the multiple-parameter fractional Fourier transform (MPFRFT), which can safely exchange information with no advance distribution of either secret keys or public keys between users. The image is encrypted directly by the MPFRFT spectrum without the use of phase keys, and information can be shared by transmitting the encrypted image (or message) three times between users. Numerical simulation results are given to verify the performance of the proposed algorithm.

Quantum-noise randomized data encryption for wavelength-division-multiplexed fiber-optic networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Corndorf, Eric; Liang Chuang; Kanter, Gregory S.

2005-06-15

We demonstrate high-rate randomized data-encryption through optical fibers using the inherent quantum-measurement noise of coherent states of light. Specifically, we demonstrate 650 Mbit/s data encryption through a 10 Gbit/s data-bearing, in-line amplified 200-km-long line. In our protocol, legitimate users (who share a short secret key) communicate using an M-ry signal set while an attacker (who does not share the secret key) is forced to contend with the fundamental and irreducible quantum-measurement noise of coherent states. Implementations of our protocol using both polarization-encoded signal sets as well as polarization-insensitive phase-keyed signal sets are experimentally and theoretically evaluated. Different from the performancemore » criteria for the cryptographic objective of key generation (quantum key-generation), one possible set of performance criteria for the cryptographic objective of data encryption is established and carefully considered.« less

A novel semi-quantum secret sharing scheme based on Bell states

NASA Astrophysics Data System (ADS)

Yin, Aihan; Wang, Zefan; Fu, Fangbo

2017-05-01

A semi-quantum secret sharing (SQSS) scheme based on Bell states is proposed in this paper. The sender who can perform any relevant quantum operations uses Bell states to share the secret keys with her participants that are limited to perform classical operations on the transmitted qubits. It is found that our scheme is easy to generalize from three parties to multiparty and more efficient than the previous schemes [Q. Li, W. H. Chan and D. Y. Long, Phys. Rev. A 82 (2010) 022303; L. Z. Li, D. W. Qiu and P. Mateus, J. Phys. A: Math. Theor. 26 (2013) 045304; C. Xie, L. Z. Li and D. W. Qiu, Int. J. Theor. Phys. 54 (2015) 3819].

Eavesdropping on counterfactual quantum key distribution with finite resources

NASA Astrophysics Data System (ADS)

Liu, Xingtong; Zhang, Bo; Wang, Jian; Tang, Chaojing; Zhao, Jingjing; Zhang, Sheng

2014-08-01

A striking scheme called "counterfactual quantum cryptography" gives a conceptually new approach to accomplish the task of key distribution. It allows two legitimate parties to share a secret even though a particle carrying secret information is not, in fact, transmitted through the quantum channel. Since an eavesdropper cannot directly access the entire quantum system of each signal particle, the protocol seems to provide practical security advantages. However, here we propose an eavesdropping method which works on the scheme in a finite key scenario. We show that, for practical systems only generating a finite number of keys, the eavesdropping can obtain all of the secret information without being detected. We also present a improved protocol as a countermeasure against this attack.

Modified Multi Prime RSA Cryptosystem

NASA Astrophysics Data System (ADS)

Ghazali Kamardan, M.; Aminudin, N.; Che-Him, Norziha; Sufahani, Suliadi; Khalid, Kamil; Roslan, Rozaini

2018-04-01

RSA [1] is one of the mostly used cryptosystem in securing data and information. Though, it has been recently discovered that RSA has some weaknesses and in advance technology, RSA is believed to be inefficient especially when it comes to decryption. Thus, a new algorithm called Multi prime RSA, an extended version of the standard RSA is studied. Then, a modification is made to the Multi prime RSA where another keys is shared secretly between the receiver and the sender to increase the securerity. As in RSA, the methodology used for modified Multi-prime RSA also consists of three phases; 1. Key Generation in which the secret and public keys are generated and published. In this phase, the secrecy is improved by adding more prime numbers and addition of secret keys. 2. Encryption of the message using the public and secret keys given. 3. Decryption of the secret message using the secret key generated. For the decryption phase, a method called Chinese Remainder Theorem is used which helps to fasten the computation. Since Multi prime RSA use more than two prime numbers, the algorithm is more efficient and secure when compared to the standard RSA. Furthermore, in modified Multi prime RSA another secret key is introduced to increase the obstacle to the attacker. Therefore, it is strongly believed that this new algorithm is better and can be an alternative to the RSA.

Comment on “Cryptanalysis and improvement of multiparty semiquantum secret sharing based on rearranging orders of qubits”

NASA Astrophysics Data System (ADS)

Gao, Gan

2017-11-01

In this paper, we show that the attack strategy [A. Yin and F. Fu, Mod. Phys. Lett. B 30 (2016) 1650415] fails, that is, the last agent and other agents cannot get the sender’s secret keys without being detected by using the attack strategy.

Finite key analysis for symmetric attacks in quantum key distribution

DOE Office of Scientific and Technical Information (OSTI.GOV)

Meyer, Tim; Kampermann, Hermann; Kleinmann, Matthias

2006-10-15

We introduce a constructive method to calculate the achievable secret key rate for a generic class of quantum key distribution protocols, when only a finite number n of signals is given. Our approach is applicable to all scenarios in which the quantum state shared by Alice and Bob is known. In particular, we consider the six state protocol with symmetric eavesdropping attacks, and show that for a small number of signals, i.e., below n{approx}10{sup 4}, the finite key rate differs significantly from the asymptotic value for n{yields}{infinity}. However, for larger n, a good approximation of the asymptotic value is found.more » We also study secret key rates for protocols using higher-dimensional quantum systems.« less

Quantum dense key distribution

DOE Office of Scientific and Technical Information (OSTI.GOV)

Degiovanni, I.P.; Ruo Berchera, I.; Castelletto, S.

2004-03-01

This paper proposes a protocol for quantum dense key distribution. This protocol embeds the benefits of a quantum dense coding and a quantum key distribution and is able to generate shared secret keys four times more efficiently than the Bennet-Brassard 1984 protocol. We hereinafter prove the security of this scheme against individual eavesdropping attacks, and we present preliminary experimental results, showing its feasibility.

Low cost and compact quantum key distribution

NASA Astrophysics Data System (ADS)

Duligall, J. L.; Godfrey, M. S.; Harrison, K. A.; Munro, W. J.; Rarity, J. G.

2006-10-01

We present the design of a novel free-space quantum cryptography system, complete with purpose-built software, that can operate in daylight conditions. The transmitter and receiver modules are built using inexpensive off-the-shelf components. Both modules are compact allowing the generation of renewed shared secrets on demand over a short range of a few metres. An analysis of the software is shown as well as results of error rates and therefore shared secret yields at varying background light levels. As the system is designed to eventually work in short-range consumer applications, we also present a use scenario where the consumer can regularly 'top up' a store of secrets for use in a variety of one-time-pad (OTP) and authentication protocols.

Computing on quantum shared secrets

NASA Astrophysics Data System (ADS)

Ouyang, Yingkai; Tan, Si-Hui; Zhao, Liming; Fitzsimons, Joseph F.

2017-11-01

A (k ,n )-threshold secret-sharing scheme allows for a string to be split into n shares in such a way that any subset of at least k shares suffices to recover the secret string, but such that any subset of at most k -1 shares contains no information about the secret. Quantum secret-sharing schemes extend this idea to the sharing of quantum states. Here we propose a method of performing computation securely on quantum shared secrets. We introduce a (n ,n )-quantum secret sharing scheme together with a set of algorithms that allow quantum circuits to be evaluated securely on the shared secret without the need to decode the secret. We consider a multipartite setting, with each participant holding a share of the secret. We show that if there exists at least one honest participant, no group of dishonest participants can recover any information about the shared secret, independent of their deviations from the algorithm.

Simulating cloud environment for HIS backup using secret sharing.

PubMed

Kuroda, Tomohiro; Kimura, Eizen; Matsumura, Yasushi; Yamashita, Yoshinori; Hiramatsu, Haruhiko; Kume, Naoto

2013-01-01

In the face of a disaster hospitals are expected to be able to continue providing efficient and high-quality care to patients. It is therefore crucial for hospitals to develop business continuity plans (BCPs) that identify their vulnerabilities, and prepare procedures to overcome them. A key aspect of most hospitals' BCPs is creating the backup of the hospital information system (HIS) data at multiple remote sites. However, the need to keep the data confidential dramatically increases the costs of making such backups. Secret sharing is a method to split an original secret message so that individual pieces are meaningless, but putting sufficient number of pieces together reveals the original message. It allows creation of pseudo-redundant arrays of independent disks for privacy-sensitive data over the Internet. We developed a secret sharing environment for StarBED, a large-scale network experiment environment, and evaluated its potential and performance during disaster recovery. Simulation results showed that the entire main HIS database of Kyoto University Hospital could be retrieved within three days even if one of the distributed storage systems crashed during a disaster.

Tripartite counterfactual quantum cryptography

NASA Astrophysics Data System (ADS)

Salih, Hatim

2014-07-01

We show how two distrustful parties, "Bob" and "Charlie," can share a secret key with the help of a mutually trusted "Alice" counterfactually; that is, with no information-carrying particles traveling between any of the three.

Image encryption using fingerprint as key based on phase retrieval algorithm and public key cryptography

NASA Astrophysics Data System (ADS)

Zhao, Tieyu; Ran, Qiwen; Yuan, Lin; Chi, Yingying; Ma, Jing

2015-09-01

In this paper, a novel image encryption system with fingerprint used as a secret key is proposed based on the phase retrieval algorithm and RSA public key algorithm. In the system, the encryption keys include the fingerprint and the public key of RSA algorithm, while the decryption keys are the fingerprint and the private key of RSA algorithm. If the users share the fingerprint, then the system will meet the basic agreement of asymmetric cryptography. The system is also applicable for the information authentication. The fingerprint as secret key is used in both the encryption and decryption processes so that the receiver can identify the authenticity of the ciphertext by using the fingerprint in decryption process. Finally, the simulation results show the validity of the encryption scheme and the high robustness against attacks based on the phase retrieval technique.

Enhanced diffie-hellman algorithm for reliable key exchange

NASA Astrophysics Data System (ADS)

Aryan; Kumar, Chaithanya; Vincent, P. M. Durai Raj

2017-11-01

The Diffie -Hellman is one of the first public-key procedure and is a certain way of exchanging the cryptographic keys securely. This concept was introduced by Ralph Markel and it is named after Whitfield Diffie and Martin Hellman. Sender and Receiver make a common secret key in Diffie-Hellman algorithm and then they start communicating with each other over the public channel which is known to everyone. A number of internet services are secured by Diffie -Hellman. In Public key cryptosystem, the sender has to trust while receiving the public key of the receiver and vice-versa and this is the challenge of public key cryptosystem. Man-in-the-Middle attack is very much possible on the existing Diffie-Hellman algorithm. In man-in-the-middle attack, the attacker exists in the public channel, the attacker receives the public key of both sender and receiver and sends public keys to sender and receiver which is generated by his own. This is how man-in-the-middle attack is possible on Diffie-Hellman algorithm. Denial of service attack is another attack which is found common on Diffie-Hellman. In this attack, the attacker tries to stop the communication happening between sender and receiver and attacker can do this by deleting messages or by confusing the parties with miscommunication. Some more attacks like Insider attack, Outsider attack, etc are possible on Diffie-Hellman. To reduce the possibility of attacks on Diffie-Hellman algorithm, we have enhanced the Diffie-Hellman algorithm to a next level. In this paper, we are extending the Diffie -Hellman algorithm by using the concept of the Diffie -Hellman algorithm to get a stronger secret key and that secret key is further exchanged between the sender and the receiver so that for each message, a new secret shared key would be generated. The second secret key will be generated by taking primitive root of the first secret key.

Unitary reconstruction of secret for stabilizer-based quantum secret sharing

NASA Astrophysics Data System (ADS)

Matsumoto, Ryutaroh

2017-08-01

We propose a unitary procedure to reconstruct quantum secret for a quantum secret sharing scheme constructed from stabilizer quantum error-correcting codes. Erasure correcting procedures for stabilizer codes need to add missing shares for reconstruction of quantum secret, while unitary reconstruction procedures for certain class of quantum secret sharing are known to work without adding missing shares. The proposed procedure also works without adding missing shares.

Authentication Based on Non-Interactive Zero-Knowledge Proofs for the Internet of Things.

PubMed

Martín-Fernández, Francisco; Caballero-Gil, Pino; Caballero-Gil, Cándido

2016-01-07

This paper describes the design and analysis of a new scheme for the authenticated exchange of confidential information in insecure environments within the Internet of Things, which allows a receiver of a message to authenticate the sender and compute a secret key shared with it. The proposal is based on the concept of a non-interactive zero-knowledge proof, so that in a single communication, relevant data may be inferred to verify the legitimacy of the sender. Besides, the new scheme uses the idea under the Diffie-Hellman protocol for the establishment of a shared secret key. The proposal has been fully developed for platforms built on the Android Open Source Project, so it can be used in any device or sensor with this operating system. This work provides a performance study of the implementation and a comparison between its promising results and others obtained with similar schemes.

Authentication Based on Non-Interactive Zero-Knowledge Proofs for the Internet of Things

PubMed Central

Martín-Fernández, Francisco; Caballero-Gil, Pino; Caballero-Gil, Cándido

2016-01-01

This paper describes the design and analysis of a new scheme for the authenticated exchange of confidential information in insecure environments within the Internet of Things, which allows a receiver of a message to authenticate the sender and compute a secret key shared with it. The proposal is based on the concept of a non-interactive zero-knowledge proof, so that in a single communication, relevant data may be inferred to verify the legitimacy of the sender. Besides, the new scheme uses the idea under the Diffie–Hellman protocol for the establishment of a shared secret key. The proposal has been fully developed for platforms built on the Android Open Source Project, so it can be used in any device or sensor with this operating system. This work provides a performance study of the implementation and a comparison between its promising results and others obtained with similar schemes. PMID:26751454

Matroids and quantum-secret-sharing schemes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sarvepalli, Pradeep; Raussendorf, Robert

A secret-sharing scheme is a cryptographic protocol to distribute a secret state in an encoded form among a group of players such that only authorized subsets of the players can reconstruct the secret. Classically, efficient secret-sharing schemes have been shown to be induced by matroids. Furthermore, access structures of such schemes can be characterized by an excluded minor relation. No such relations are known for quantum secret-sharing schemes. In this paper we take the first steps toward a matroidal characterization of quantum-secret-sharing schemes. In addition to providing a new perspective on quantum-secret-sharing schemes, this characterization has important benefits. While previousmore » work has shown how to construct quantum-secret-sharing schemes for general access structures, these schemes are not claimed to be efficient. In this context the present results prove to be useful; they enable us to construct efficient quantum-secret-sharing schemes for many general access structures. More precisely, we show that an identically self-dual matroid that is representable over a finite field induces a pure-state quantum-secret-sharing scheme with information rate 1.« less

Large-Capacity Three-Party Quantum Digital Secret Sharing Using Three Particular Matrices Coding

NASA Astrophysics Data System (ADS)

Lai, Hong; Luo, Ming-Xing; Pieprzyk, Josef; Tao, Li; Liu, Zhi-Ming; Orgun, Mehmet A.

2016-11-01

In this paper, we develop a large-capacity quantum digital secret sharing (QDSS) scheme, combined the Fibonacci- and Lucas-valued orbital angular momentum (OAM) entanglement with the recursive Fibonacci and Lucas matrices. To be exact, Alice prepares pairs of photons in the Fibonacci- and Lucas-valued OAM entangled states, and then allocates them to two participants, say, Bob and Charlie, to establish the secret key. Moreover, the available Fibonacci and Lucas values from the matching entangled states are used as the seed for generating the Fibonacci and Lucas matrices. This is achieved because the entries of the Fibonacci and Lucas matrices are recursive. The secret key can only be obtained jointly by Bob and Charlie, who can further recover the secret. Its security is based on the facts that nonorthogonal states are indistinguishable, and Bob or Charlie detects a Fibonacci number, there is still a twofold uncertainty for Charlie' (Bob') detected value. Supported by the Fundamental Research Funds for the Central Universities under Grant No. XDJK2016C043 and the Doctoral Program of Higher Education under Grant No. SWU115091, the National Natural Science Foundation of China under Grant No. 61303039, the Fundamental Research Funds for the Central Universities under Grant No. XDJK2015C153 and the Doctoral Program of Higher Education under Grant No. SWU114112, and the Financial Support the 1000-Plan of Chongqing by Southwest University under Grant No. SWU116007

Quantum cryptography for secure free-space communications

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.

1999-03-01

The secure distribution of the secret random bit sequences known as key material, is an essential precursor to their use for the encryption and decryption of confidential communications. Quantum cryptography is a new technique for secure key distribution with single-photon transmissions: Heisenberg`s uncertainty principle ensures that an adversary can neither successfully tap the key transmissions, nor evade detection (eavesdropping raises the key error rate above a threshold value). The authors have developed experimental quantum cryptography systems based on the transmission of non-orthogonal photon polarization states to generate shared key material over line-of-sight optical links. Key material is built up usingmore » the transmission of a single-photon per bit of an initial secret random sequence. A quantum-mechanically random subset of this sequence is identified, becoming the key material after a data reconciliation stage with the sender. The authors have developed and tested a free-space quantum key distribution (QKD) system over an outdoor optical path of {approximately}1 km at Los Alamos National Laboratory under nighttime conditions. Results show that free-space QKD can provide secure real-time key distribution between parties who have a need to communicate secretly. Finally, they examine the feasibility of surface to satellite QKD.« less

Semiquantum secret sharing using entangled states

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li Qin; Department of Computer Science, Sun Yat-sen University, Guangzhou 510006; Department of Mathematics, Hong Kong Baptist University, Kowloon

Secret sharing is a procedure for sharing a secret among a number of participants such that only the qualified subsets of participants have the ability to reconstruct the secret. Even in the presence of eavesdropping, secret sharing can be achieved when all the members are quantum. So what happens if not all the members are quantum? In this paper, we propose two semiquantum secret sharing protocols by using maximally entangled Greenberger-Horne-Zeilinger-type states in which quantum Alice shares a secret with two classical parties, Bob and Charlie, in a way that both parties are sufficient to obtain the secret, but onemore » of them cannot. The presented protocols are also shown to be secure against eavesdropping.« less

Quantum secret sharing with qudit graph states

DOE Office of Scientific and Technical Information (OSTI.GOV)

Keet, Adrian; Fortescue, Ben; Sanders, Barry C.

We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.

Security of a kind of quantum secret sharing with entangled states.

PubMed

Wang, Tian-Yin; Liu, Ying-Zhao; Wei, Chun-Yan; Cai, Xiao-Qiu; Ma, Jian-Feng

2017-05-30

We present a new collusion attack to a kind of quantum secret sharing schemes with entangled states. Using this attack, an unauthorized set of agents can gain access to the shared secret without the others' cooperation. Furthermore, we establish a general model for this kind of quantum secret sharing schemes and then give some necessary conditions to design a secure quantum secret sharing scheme under this model.

Novel Multi-Party Quantum Key Agreement Protocol with G-Like States and Bell States

NASA Astrophysics Data System (ADS)

Min, Shi-Qi; Chen, Hua-Ying; Gong, Li-Hua

2018-03-01

A significant aspect of quantum cryptography is quantum key agreement (QKA), which ensures the security of key agreement protocols by quantum information theory. The fairness of an absolute security multi-party quantum key agreement (MQKA) protocol demands that all participants can affect the protocol result equally so as to establish a shared key and that nobody can determine the shared key by himself/herself. We found that it is difficult for the existing multi-party quantum key agreement protocol to withstand the collusion attacks. Put differently, it is possible for several cooperated and untruthful participants to determine the final key without being detected. To address this issue, based on the entanglement swapping between G-like state and Bell states, a new multi-party quantum key agreement protocol is put forward. The proposed protocol makes full use of EPR pairs as quantum resources, and adopts Bell measurement and unitary operation to share a secret key. Besides, the proposed protocol is fair, secure and efficient without involving a third party quantum center. It demonstrates that the protocol is capable of protecting users' privacy and meeting the requirement of fairness. Moreover, it is feasible to carry out the protocol with existing technologies.

Novel Multi-Party Quantum Key Agreement Protocol with G-Like States and Bell States

NASA Astrophysics Data System (ADS)

Min, Shi-Qi; Chen, Hua-Ying; Gong, Li-Hua

2018-06-01

A significant aspect of quantum cryptography is quantum key agreement (QKA), which ensures the security of key agreement protocols by quantum information theory. The fairness of an absolute security multi-party quantum key agreement (MQKA) protocol demands that all participants can affect the protocol result equally so as to establish a shared key and that nobody can determine the shared key by himself/herself. We found that it is difficult for the existing multi-party quantum key agreement protocol to withstand the collusion attacks. Put differently, it is possible for several cooperated and untruthful participants to determine the final key without being detected. To address this issue, based on the entanglement swapping between G-like state and Bell states, a new multi-party quantum key agreement protocol is put forward. The proposed protocol makes full use of EPR pairs as quantum resources, and adopts Bell measurement and unitary operation to share a secret key. Besides, the proposed protocol is fair, secure and efficient without involving a third party quantum center. It demonstrates that the protocol is capable of protecting users' privacy and meeting the requirement of fairness. Moreover, it is feasible to carry out the protocol with existing technologies.

Full-field implementation of a perfect eavesdropper on a quantum cryptography system.

PubMed

Gerhardt, Ilja; Liu, Qin; Lamas-Linares, Antía; Skaar, Johannes; Kurtsiefer, Christian; Makarov, Vadim

2011-06-14

Quantum key distribution (QKD) allows two remote parties to grow a shared secret key. Its security is founded on the principles of quantum mechanics, but in reality it significantly relies on the physical implementation. Technological imperfections of QKD systems have been previously explored, but no attack on an established QKD connection has been realized so far. Here we show the first full-field implementation of a complete attack on a running QKD connection. An installed eavesdropper obtains the entire 'secret' key, while none of the parameters monitored by the legitimate parties indicate a security breach. This confirms that non-idealities in physical implementations of QKD can be fully practically exploitable, and must be given increased scrutiny if quantum cryptography is to become highly secure.

An Image Secret Sharing Method

DTIC Science & Technology

2006-07-01

the secret image in lossless manner and (2) any or fewer image shares cannot get sufficient information to reveal the ... secret image. It is an effective, reliable and secure method to prevent the secret image from being lost, stolen or corrupted. In comparison with...other image secret sharing methods, this approach’s advantages are its large compression rate on the size of the image shares, its strong protection of the secret image and its ability for real-time

Phase-encoded measurement device independent quantum key distribution without a shared reference frame

NASA Astrophysics Data System (ADS)

Zhuo-Dan, Zhu; Shang-Hong, Zhao; Chen, Dong; Ying, Sun

2018-07-01

In this paper, a phase-encoded measurement device independent quantum key distribution (MDI-QKD) protocol without a shared reference frame is presented, which can generate secure keys between two parties while the quantum channel or interferometer introduces an unknown and slowly time-varying phase. The corresponding secret key rate and single photons bit error rate is analysed, respectively, with single photons source (SPS) and weak coherent source (WCS), taking finite-key analysis into account. The numerical simulations show that the modified phase-encoded MDI-QKD protocol has apparent superiority both in maximal secure transmission distance and key generation rate while possessing the improved robustness and practical security in the high-speed case. Moreover, the rejection of the frame-calibrating part will intrinsically reduce the consumption of resources as well as the potential security flaws of practical MDI-QKD systems.

Assessing the secretory capacity of pancreatic acinar cells.

PubMed

Geron, Erez; Schejter, Eyal D; Shilo, Ben-Zion

2014-08-28

Pancreatic acinar cells produce and secrete digestive enzymes. These cells are organized as a cluster which forms and shares a joint lumen. This work demonstrates how the secretory capacity of these cells can be assessed by culture of isolated acini. The setup is advantageous since isolated acini, which retain many characteristics of the intact exocrine pancreas can be manipulated and monitored more readily than in the whole animal. Proper isolation of pancreatic acini is a key requirement so that the ex vivo culture will represent the in vivo nature of the acini. The protocol demonstrates how to isolate intact acini from the mouse pancreas. Subsequently, two complementary methods for evaluating pancreatic secretion are presented. The amylase secretion assay serves as a global measure, while direct imaging of pancreatic secretion allows the characterization of secretion at a sub-cellular resolution. Collectively, the techniques presented here enable a broad spectrum of experiments to study exocrine secretion.

Deterministic secure quantum communication using a single d-level system.

PubMed

Jiang, Dong; Chen, Yuanyuan; Gu, Xuemei; Xie, Ling; Chen, Lijun

2017-03-22

Deterministic secure quantum communication (DSQC) can transmit secret messages between two parties without first generating a shared secret key. Compared with quantum key distribution (QKD), DSQC avoids the waste of qubits arising from basis reconciliation and thus reaches higher efficiency. In this paper, based on data block transmission and order rearrangement technologies, we propose a DSQC protocol. It utilizes a set of single d-level systems as message carriers, which are used to directly encode the secret message in one communication process. Theoretical analysis shows that these employed technologies guarantee the security, and the use of a higher dimensional quantum system makes our protocol achieve higher security and efficiency. Since only quantum memory is required for implementation, our protocol is feasible with current technologies. Furthermore, Trojan horse attack (THA) is taken into account in our protocol. We give a THA model and show that THA significantly increases the multi-photon rate and can thus be detected.

Multilayer quantum secret sharing based on GHZ state and generalized Bell basis measurement in multiparty agents

NASA Astrophysics Data System (ADS)

Wang, Xiao-Jun; An, Long-Xi; Yu, Xu-Tao; Zhang, Zai-Chen

2017-10-01

A multilayer quantum secret sharing protocol based on GHZ state is proposed. Alice has the secret carried by quantum state and wants to distribute this secret to multiple agent nodes in the network. In this protocol, the secret is transmitted and shared layer by layer from root Alice to layered agents. The number of agents in each layer is a geometric sequence with a specific common ratio. By sharing GHZ maximally entangled states and making generalized Bell basis measurement, one qubit state can be distributed to multiparty agents and the secret is shared. Only when all agents at the last layer cooperate together, the secret can be recovered. Compared with other protocols based on the entangled state, this protocol adopts layered construction so that secret can be distributed to more agents with fewer particles GHZ state. This quantum secret sharing protocol can be used in wireless network to ensure the security of information delivery.

Relativistic (2,3)-threshold quantum secret sharing

NASA Astrophysics Data System (ADS)

Ahmadi, Mehdi; Wu, Ya-Dong; Sanders, Barry C.

2017-09-01

In quantum secret sharing protocols, the usual presumption is that the distribution of quantum shares and players' collaboration are both performed inertially. Here we develop a quantum secret sharing protocol that relaxes these assumptions wherein we consider the effects due to the accelerating motion of the shares. Specifically, we solve the (2,3)-threshold continuous-variable quantum secret sharing in noninertial frames. To this aim, we formulate the effect of relativistic motion on the quantum field inside a cavity as a bosonic quantum Gaussian channel. We investigate how the fidelity of quantum secret sharing is affected by nonuniform motion of the quantum shares. Furthermore, we fully characterize the canonical form of the Gaussian channel, which can be utilized in quantum-information-processing protocols to include relativistic effects.

Steganography on multiple MP3 files using spread spectrum and Shamir's secret sharing

NASA Astrophysics Data System (ADS)

Yoeseph, N. M.; Purnomo, F. A.; Riasti, B. K.; Safiie, M. A.; Hidayat, T. N.

2016-11-01

The purpose of steganography is how to hide data into another media. In order to increase security of data, steganography technique is often combined with cryptography. The weakness of this combination technique is the data was centralized. Therefore, a steganography technique is develop by using combination of spread spectrum and secret sharing technique. In steganography with secret sharing, shares of data is created and hidden in several medium. Medium used to concealed shares were MP3 files. Hiding technique used was Spread Spectrum. Secret sharing scheme used was Shamir's Secret Sharing. The result showed that steganography with spread spectrum combined with Shamir's Secret Share using MP3 files as medium produce a technique that could hid data into several cover. To extract and reconstruct the data hidden in stego object, it is needed the amount of stego object which more or equal to its threshold. Furthermore, stego objects were imperceptible and robust.

Shared Secrets versus Secrets Kept Private Are Linked to Better Adolescent Adjustment

ERIC Educational Resources Information Center

Frijns, Tom; Finkenauer, Catrin; Keijsers, Loes

2013-01-01

It is a household notion that secrecy is bad while sharing is good. But what about shared secrets? The present research adopts a functional analysis of sharing secrets, arguing that it should negate harmful consequences generally associated with secrecy and serves important interpersonal functions in adolescence. A survey study among 790 Dutch…

Rigor Made Easy: Getting Started

ERIC Educational Resources Information Center

Blackburn, Barbara R.

2012-01-01

Bestselling author and noted rigor expert Barbara Blackburn shares the secrets to getting started, maintaining momentum, and reaching your goals. Learn what rigor looks like in the classroom, understand what it means for your students, and get the keys to successful implementation. Learn how to use rigor to raise expectations, provide appropriate…

A Secret 3D Model Sharing Scheme with Reversible Data Hiding Based on Space Subdivision

NASA Astrophysics Data System (ADS)

Tsai, Yuan-Yu

2016-03-01

Secret sharing is a highly relevant research field, and its application to 2D images has been thoroughly studied. However, secret sharing schemes have not kept pace with the advances of 3D models. With the rapid development of 3D multimedia techniques, extending the application of secret sharing schemes to 3D models has become necessary. In this study, an innovative secret 3D model sharing scheme for point geometries based on space subdivision is proposed. Each point in the secret point geometry is first encoded into a series of integer values that fall within [0, p - 1], where p is a predefined prime number. The share values are derived by substituting the specified integer values for all coefficients of the sharing polynomial. The surface reconstruction and the sampling concepts are then integrated to derive a cover model with sufficient model complexity for each participant. Finally, each participant has a separate 3D stego model with embedded share values. Experimental results show that the proposed technique supports reversible data hiding and the share values have higher levels of privacy and improved robustness. This technique is simple and has proven to be a feasible secret 3D model sharing scheme.

Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding.

PubMed

Lai, Hong; Zhang, Jun; Luo, Ming-Xing; Pan, Lei; Pieprzyk, Josef; Xiao, Fuyuan; Orgun, Mehmet A

2016-08-12

With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an m-bonacci orbital angular momentum (OAM) pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding. To be exact, we employ entangled states prepared by m-bonacci sequences to detect eavesdropping. Meanwhile, we encode m-bonacci sequences in Lagrange interpolation polynomials to generate the shares of a secret with reverse Huffman-Fibonacci-tree coding. The advantages of the proposed scheme is that it can detect eavesdropping without joint quantum operations, and permits secret sharing for an arbitrary but no less than threshold-value number of classical participants with much lower bandwidth. Also, in comparison with existing quantum secret sharing schemes, it still works when there are dynamic changes, such as the unavailability of some quantum channel, the arrival of new participants and the departure of participants. Finally, we provide security analysis of the new hybrid quantum secret sharing scheme and discuss its useful features for modern applications.

Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding

PubMed Central

Lai, Hong; Zhang, Jun; Luo, Ming-Xing; Pan, Lei; Pieprzyk, Josef; Xiao, Fuyuan; Orgun, Mehmet A.

2016-01-01

With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an m-bonacci orbital angular momentum (OAM) pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding. To be exact, we employ entangled states prepared by m-bonacci sequences to detect eavesdropping. Meanwhile, we encode m-bonacci sequences in Lagrange interpolation polynomials to generate the shares of a secret with reverse Huffman-Fibonacci-tree coding. The advantages of the proposed scheme is that it can detect eavesdropping without joint quantum operations, and permits secret sharing for an arbitrary but no less than threshold-value number of classical participants with much lower bandwidth. Also, in comparison with existing quantum secret sharing schemes, it still works when there are dynamic changes, such as the unavailability of some quantum channel, the arrival of new participants and the departure of participants. Finally, we provide security analysis of the new hybrid quantum secret sharing scheme and discuss its useful features for modern applications. PMID:27515908

Threshold multi-secret sharing scheme based on phase-shifting interferometry

NASA Astrophysics Data System (ADS)

Deng, Xiaopeng; Wen, Wei; Shi, Zhengang

2017-03-01

A threshold multi-secret sharing scheme is proposed based on phase-shifting interferometry. The K secret images to be shared are firstly encoded by using Fourier transformation, respectively. Then, these encoded images are shared into many shadow images based on recording principle of the phase-shifting interferometry. In the recovering stage, the secret images can be restored by combining any 2 K + 1 or more shadow images, while any 2 K or fewer shadow images cannot obtain any information about the secret images. As a result, a (2 K + 1 , N) threshold multi-secret sharing scheme can be implemented. Simulation results are presented to demonstrate the feasibility of the proposed method.

Semi-counterfactual cryptography

NASA Astrophysics Data System (ADS)

Akshata Shenoy, H.; Srikanth, R.; Srinivas, T.

2013-09-01

In counterfactual quantum key distribution (QKD), two remote parties can securely share random polarization-encoded bits through the blocking rather than the transmission of particles. We propose a semi-counterfactual QKD, i.e., one where the secret bit is shared, and also encoded, based on the blocking or non-blocking of a particle. The scheme is thus semi-counterfactual and not based on polarization encoding. As with other counterfactual schemes and the Goldenberg-Vaidman protocol, but unlike BB84, the encoding states are orthogonal and security arises ultimately from single-particle non-locality. Unlike any of them, however, the secret bit generated is maximally indeterminate until the joint action of Alice and Bob. We prove the general security of the protocol, and study the most general photon-number-preserving incoherent attack in detail.

Nonlinear secret image sharing scheme.

PubMed

Shin, Sang-Ho; Lee, Gil-Je; Yoo, Kee-Young

2014-01-01

Over the past decade, most of secret image sharing schemes have been proposed by using Shamir's technique. It is based on a linear combination polynomial arithmetic. Although Shamir's technique based secret image sharing schemes are efficient and scalable for various environments, there exists a security threat such as Tompa-Woll attack. Renvall and Ding proposed a new secret sharing technique based on nonlinear combination polynomial arithmetic in order to solve this threat. It is hard to apply to the secret image sharing. In this paper, we propose a (t, n)-threshold nonlinear secret image sharing scheme with steganography concept. In order to achieve a suitable and secure secret image sharing scheme, we adapt a modified LSB embedding technique with XOR Boolean algebra operation, define a new variable m, and change a range of prime p in sharing procedure. In order to evaluate efficiency and security of proposed scheme, we use the embedding capacity and PSNR. As a result of it, average value of PSNR and embedding capacity are 44.78 (dB) and 1.74t⌈log2 m⌉ bit-per-pixel (bpp), respectively.

Nonlinear Secret Image Sharing Scheme

PubMed Central

Shin, Sang-Ho; Yoo, Kee-Young

2014-01-01

Over the past decade, most of secret image sharing schemes have been proposed by using Shamir's technique. It is based on a linear combination polynomial arithmetic. Although Shamir's technique based secret image sharing schemes are efficient and scalable for various environments, there exists a security threat such as Tompa-Woll attack. Renvall and Ding proposed a new secret sharing technique based on nonlinear combination polynomial arithmetic in order to solve this threat. It is hard to apply to the secret image sharing. In this paper, we propose a (t, n)-threshold nonlinear secret image sharing scheme with steganography concept. In order to achieve a suitable and secure secret image sharing scheme, we adapt a modified LSB embedding technique with XOR Boolean algebra operation, define a new variable m, and change a range of prime p in sharing procedure. In order to evaluate efficiency and security of proposed scheme, we use the embedding capacity and PSNR. As a result of it, average value of PSNR and embedding capacity are 44.78 (dB) and 1.74t⌈log2⁡m⌉ bit-per-pixel (bpp), respectively. PMID:25140334

Eavesdropping on the improved three-party quantum secret sharing protocol

NASA Astrophysics Data System (ADS)

Gao, Gan

2011-02-01

Lin et al. [Song Lin, Fei Gao, Qiao-yan Wen, Fu-chen Zhu, Opt. Commun. 281 (2008) 4553] pointed out that the multiparty quantum secret sharing protocol [Zhan-jun Zhang, Gan Gao, Xin Wang, Lian-fang Han, Shou-hua Shi, Opt. Commun. 269 (2007) 418] is not secure and proposed an improved three-party quantum secret sharing protocol. In this paper, we study the security of the improved three-party quantum secret sharing protocol and find that it is still not secure. Finally, a further improved three-party quantum secret sharing protocol is proposed.

A Note on Threshold Schemes with Disenrollment

DTIC Science & Technology

2003-01-01

such a way that t or more participants can construct the secret by pooling their shares, but the secret remains undetermined to (t − 1) or fewer par...the threshold size t by 1, because (t− 1) shares plus the disclosed share can decrypt the secret . To keep the same level of secrecy in terms of...t. (2) In a (t, n) threshold scheme, the secret K is recoverable from t or more shares based on condition (1), but the secret remains uncertain even

Secret sharing based on quantum Fourier transform

NASA Astrophysics Data System (ADS)

Yang, Wei; Huang, Liusheng; Shi, Runhua; He, Libao

2013-07-01

Secret sharing plays a fundamental role in both secure multi-party computation and modern cryptography. We present a new quantum secret sharing scheme based on quantum Fourier transform. This scheme enjoys the property that each share of a secret is disguised with true randomness, rather than classical pseudorandomness. Moreover, under the only assumption that a top priority for all participants (secret sharers and recovers) is to obtain the right result, our scheme is able to achieve provable security against a computationally unbounded attacker.

Sequential quantum secret sharing in a noisy environment aided with weak measurements

NASA Astrophysics Data System (ADS)

Ray, Maharshi; Chatterjee, Sourav; Chakrabarty, Indranil

2016-05-01

In this work we give a (n,n)-threshold protocol for sequential secret sharing of quantum information for the first time. By sequential secret sharing we refer to a situation where the dealer is not having all the secrets at the same time, at the beginning of the protocol; however if the dealer wishes to share secrets at subsequent phases she/he can realize it with the help of our protocol. First of all we present our protocol for three parties and later we generalize it for the situation where we have more (n> 3) parties. Interestingly, we show that our protocol of sequential secret sharing requires less amount of quantum as well as classical resource as compared to the situation wherein existing protocols are repeatedly used. Further in a much more realistic situation, we consider the sharing of qubits through two kinds of noisy channels, namely the phase damping channel (PDC) and the amplitude damping channel (ADC). When we carry out the sequential secret sharing in the presence of noise we observe that the fidelity of secret sharing at the kth iteration is independent of the effect of noise at the (k - 1)th iteration. In case of ADC we have seen that the average fidelity of secret sharing drops down to ½ which is equivalent to a random guess of the quantum secret. Interestingly, we find that by applying weak measurements one can enhance the average fidelity. This increase of the average fidelity can be achieved with certain trade off with the success probability of the weak measurements.

Quantum Optimal Multiple Assignment Scheme for Realizing General Access Structure of Secret Sharing

NASA Astrophysics Data System (ADS)

Matsumoto, Ryutaroh

The multiple assignment scheme is to assign one or more shares to single participant so that any kind of access structure can be realized by classical secret sharing schemes. We propose its quantum version including ramp secret sharing schemes. Then we propose an integer optimization approach to minimize the average share size.

Quantum Stabilizer Codes Can Realize Access Structures Impossible by Classical Secret Sharing

NASA Astrophysics Data System (ADS)

Matsumoto, Ryutaroh

We show a simple example of a secret sharing scheme encoding classical secret to quantum shares that can realize an access structure impossible by classical information processing with limitation on the size of each share. The example is based on quantum stabilizer codes.

Threshold quantum secret sharing based on single qubit

NASA Astrophysics Data System (ADS)

Lu, Changbin; Miao, Fuyou; Meng, Keju; Yu, Yue

2018-03-01

Based on unitary phase shift operation on single qubit in association with Shamir's ( t, n) secret sharing, a ( t, n) threshold quantum secret sharing scheme (or ( t, n)-QSS) is proposed to share both classical information and quantum states. The scheme uses decoy photons to prevent eavesdropping and employs the secret in Shamir's scheme as the private value to guarantee the correctness of secret reconstruction. Analyses show it is resistant to typical intercept-and-resend attack, entangle-and-measure attack and participant attacks such as entanglement swapping attack. Moreover, it is easier to realize in physic and more practical in applications when compared with related ones. By the method in our scheme, new ( t, n)-QSS schemes can be easily constructed using other classical ( t, n) secret sharing.

Novel Threshold Changeable Secret Sharing Schemes Based on Polynomial Interpolation

PubMed Central

Li, Mingchu; Guo, Cheng; Choo, Kim-Kwang Raymond; Ren, Yizhi

2016-01-01

After any distribution of secret sharing shadows in a threshold changeable secret sharing scheme, the threshold may need to be adjusted to deal with changes in the security policy and adversary structure. For example, when employees leave the organization, it is not realistic to expect departing employees to ensure the security of their secret shadows. Therefore, in 2012, Zhang et al. proposed (t → t′, n) and ({t1, t2,⋯, tN}, n) threshold changeable secret sharing schemes. However, their schemes suffer from a number of limitations such as strict limit on the threshold values, large storage space requirement for secret shadows, and significant computation for constructing and recovering polynomials. To address these limitations, we propose two improved dealer-free threshold changeable secret sharing schemes. In our schemes, we construct polynomials to update secret shadows, and use two-variable one-way function to resist collusion attacks and secure the information stored by the combiner. We then demonstrate our schemes can adjust the threshold safely. PMID:27792784

Novel Threshold Changeable Secret Sharing Schemes Based on Polynomial Interpolation.

PubMed

Yuan, Lifeng; Li, Mingchu; Guo, Cheng; Choo, Kim-Kwang Raymond; Ren, Yizhi

2016-01-01

After any distribution of secret sharing shadows in a threshold changeable secret sharing scheme, the threshold may need to be adjusted to deal with changes in the security policy and adversary structure. For example, when employees leave the organization, it is not realistic to expect departing employees to ensure the security of their secret shadows. Therefore, in 2012, Zhang et al. proposed (t → t', n) and ({t1, t2,⋯, tN}, n) threshold changeable secret sharing schemes. However, their schemes suffer from a number of limitations such as strict limit on the threshold values, large storage space requirement for secret shadows, and significant computation for constructing and recovering polynomials. To address these limitations, we propose two improved dealer-free threshold changeable secret sharing schemes. In our schemes, we construct polynomials to update secret shadows, and use two-variable one-way function to resist collusion attacks and secure the information stored by the combiner. We then demonstrate our schemes can adjust the threshold safely.

Deterministic secure quantum communication using a single d-level system

PubMed Central

Jiang, Dong; Chen, Yuanyuan; Gu, Xuemei; Xie, Ling; Chen, Lijun

2017-01-01

Deterministic secure quantum communication (DSQC) can transmit secret messages between two parties without first generating a shared secret key. Compared with quantum key distribution (QKD), DSQC avoids the waste of qubits arising from basis reconciliation and thus reaches higher efficiency. In this paper, based on data block transmission and order rearrangement technologies, we propose a DSQC protocol. It utilizes a set of single d-level systems as message carriers, which are used to directly encode the secret message in one communication process. Theoretical analysis shows that these employed technologies guarantee the security, and the use of a higher dimensional quantum system makes our protocol achieve higher security and efficiency. Since only quantum memory is required for implementation, our protocol is feasible with current technologies. Furthermore, Trojan horse attack (THA) is taken into account in our protocol. We give a THA model and show that THA significantly increases the multi-photon rate and can thus be detected. PMID:28327557

Serial interpolation for secure membership testing and matching in a secret-split archive

DOEpatents

Kroeger, Thomas M.; Benson, Thomas R.

2016-12-06

The various technologies presented herein relate to analyzing a plurality of shares stored at a plurality of repositories to determine whether a secret from which the shares were formed matches a term in a query. A threshold number of shares are formed with a generating polynomial operating on the secret. A process of serially interpolating the threshold number of shares can be conducted whereby a contribution of a first share is determined, a contribution of a second share is determined while seeded with the contribution of the first share, etc. A value of a final share in the threshold number of shares can be determined and compared with the search term. In the event of the value of the final share and the search term matching, the search term matches the secret in the file from which the shares are formed.

Quantum secret sharing for a general quantum access structure

NASA Astrophysics Data System (ADS)

Bai, Chen-Ming; Li, Zhi-Hui; Si, Meng-Meng; Li, Yong-Ming

2017-10-01

Quantum secret sharing is a procedure for sharing a secret among a number of participants such that only certain subsets of participants can collaboratively reconstruct it, which are called authorized sets. The quantum access structure of a secret sharing is a family of all authorized sets. Firstly, in this paper, we propose the concept of decomposition of quantum access structure to design a quantum secret sharing scheme. Secondly, based on a maximal quantum access structure (MQAS) [D. Gottesman, Phys. Rev. A 61, 042311 (2000)], we propose an algorithm to improve a MQAS and obtain an improved maximal quantum access structure (IMQAS). Then, we present a sufficient and necessary condition about IMQAS, which shows the relationship between the minimal authorized sets and the players. In accordance with properties, we construct an efficient quantum secret sharing scheme with a decomposition and IMQAS. A major advantage of these techniques is that it allows us to construct a method to realize a general quantum access structure. Finally, we present two kinds of quantum secret sharing schemes via the thought of concatenation or a decomposition of quantum access structure. As a consequence, we find that the application of these techniques allows us to save more quantum shares and reduces more cost than the existing scheme.

Entanglement-secured single-qubit quantum secret sharing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Scherpelz, P.; Resch, R.; Berryrieser, D.

In single-qubit quantum secret sharing, a secret is shared between N parties via manipulation and measurement of one qubit at a time. Each qubit is sent to all N parties in sequence; the secret is encoded in the first participant's preparation of the qubit state and the subsequent participants' choices of state rotation or measurement basis. We present a protocol for single-qubit quantum secret sharing using polarization entanglement of photon pairs produced in type-I spontaneous parametric downconversion. We investigate the protocol's security against eavesdropping attack under common experimental conditions: a lossy channel for photon transmission, and imperfect preparation of themore » initial qubit state. A protocol which exploits entanglement between photons, rather than simply polarization correlation, is more robustly secure. We implement the entanglement-based secret-sharing protocol with 87% secret-sharing fidelity, limited by the purity of the entangled state produced by our present apparatus. We demonstrate a photon-number splitting eavesdropping attack, which achieves no success against the entanglement-based protocol while showing the predicted rate of success against a correlation-based protocol.« less

Securing quantum key distribution systems using fewer states

NASA Astrophysics Data System (ADS)

Islam, Nurul T.; Lim, Charles Ci Wen; Cahall, Clinton; Kim, Jungsang; Gauthier, Daniel J.

2018-04-01

Quantum key distribution (QKD) allows two remote users to establish a secret key in the presence of an eavesdropper. The users share quantum states prepared in two mutually unbiased bases: one to generate the key while the other monitors the presence of the eavesdropper. Here, we show that a general d -dimension QKD system can be secured by transmitting only a subset of the monitoring states. In particular, we find that there is no loss in the secure key rate when dropping one of the monitoring states. Furthermore, it is possible to use only a single monitoring state if the quantum bit error rates are low enough. We apply our formalism to an experimental d =4 time-phase QKD system, where only one monitoring state is transmitted, and obtain a secret key rate of 17.4 ±2.8 Mbits/s at a 4 dB channel loss and with a quantum bit error rate of 0.045 ±0.001 and 0.037 ±0.001 in time and phase bases, respectively, which is 58.4% of the secret key rate that can be achieved with the full setup. This ratio can be increased, potentially up to 100%, if the error rates in time and phase basis are reduced. Our results demonstrate that it is possible to substantially simplify the design of high-dimensional QKD systems, including those that use the spatial or temporal degrees of freedom of the photon, and still outperform qubit-based (d =2 ) protocols.

A Generalized Information Theoretical Model for Quantum Secret Sharing

NASA Astrophysics Data System (ADS)

Bai, Chen-Ming; Li, Zhi-Hui; Xu, Ting-Ting; Li, Yong-Ming

2016-11-01

An information theoretical model for quantum secret sharing was introduced by H. Imai et al. (Quantum Inf. Comput. 5(1), 69-80 2005), which was analyzed by quantum information theory. In this paper, we analyze this information theoretical model using the properties of the quantum access structure. By the analysis we propose a generalized model definition for the quantum secret sharing schemes. In our model, there are more quantum access structures which can be realized by our generalized quantum secret sharing schemes than those of the previous one. In addition, we also analyse two kinds of important quantum access structures to illustrate the existence and rationality for the generalized quantum secret sharing schemes and consider the security of the scheme by simple examples.

Bounds on the information rate of quantum-secret-sharing schemes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sarvepalli, Pradeep

An important metric of the performance of a quantum-secret-sharing scheme is its information rate. Beyond the fact that the information rate is upper-bounded by one, very little is known in terms of bounds on the information rate of quantum-secret-sharing schemes. Furthermore, not every scheme can be realized with rate one. In this paper we derive upper bounds for the information rates of quantum-secret-sharing schemes. We show that there exist quantum access structures on n players for which the information rate cannot be better than O((log{sub 2}n)/n). These results are the quantum analogues of the bounds for classical-secret-sharing schemes proved bymore » Csirmaz.« less

Quantum Cryptography for Secure Communications to Low-Earth Orbit Satellites

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.

1999-06-03

This is the final report of a three-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). Quantum cryptography is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. The security of these transmissions is based on the inviolability of the laws of quantum mechanics. An adversary can neither successfully tap the quantum transmissions, nor evade detection. Key material is built up using the transmission of a single-photon per bit. We have developed an experimental quantum cryptography system based on the transmissionmore » of non-orthogonal single-photon polarization states to generate shared key material over line-of-sight optical links. Our results provide strong evidence that cryptographic key material could be generated on demand between a ground station and a satellite (or between two satellites), allowing a satellite to be securely re-keyed on in orbit.« less

Sagnac secret sharing over telecom fiber networks.

PubMed

Bogdanski, Jan; Ahrens, Johan; Bourennane, Mohamed

2009-01-19

We report the first Sagnac quantum secret sharing (in three-and four-party implementations) over 1550 nm single mode fiber (SMF) networks, using a single qubit protocol with phase encoding. Our secret sharing experiment has been based on a single qubit protocol, which has opened the door to practical secret sharing implementation over fiber telecom channels and in free-space. The previous quantum secret sharing proposals were based on multiparticle entangled states, difficult in the practical implementation and not scalable. Our experimental data in the three-party implementation show stable (in regards to birefringence drift) quantum secret sharing transmissions at the total Sagnac transmission loop distances of 55-75 km with the quantum bit error rates (QBER) of 2.3-2.4% for the mean photon number micro?= 0.1 and 1.7-2.1% for micro= 0.3. In the four-party case we have achieved quantum secret sharing transmissions at the total Sagnac transmission loop distances of 45-55 km with the quantum bit error rates (QBER) of 3.0-3.7% for the mean photon number micro= 0.1 and 1.8-3.0% for micro?= 0.3. The stability of quantum transmission has been achieved thanks to our new concept for compensation of SMF birefringence effects in Sagnac, based on a polarization control system and a polarization insensitive phase modulator. The measurement results have showed feasibility of quantum secret sharing over telecom fiber networks in Sagnac configuration, using standard fiber telecom components.

Multi-party Quantum Key Agreement without Entanglement

NASA Astrophysics Data System (ADS)

Cai, Bin-Bin; Guo, Gong-De; Lin, Song

2017-04-01

A new efficient quantum key agreement protocol without entanglement is proposed. In this protocol, each user encodes his secret key into the traveling particles by performing one of four rotation operations that one cannot perfectly distinguish. In the end, all users can simultaneously obtain the final shared key. The security of the presented protocol against some common attacks is discussed. It is shown that this protocol can effectively protect the privacy of each user and satisfy the requirement of fairness in theory. Moreover, the quantum carriers and the encoding operations used in the protocol can be achieved in realistic physical devices. Therefore, the presented protocol is feasible with current technology.

Counterfactual attack on counterfactual quantum key distribution

NASA Astrophysics Data System (ADS)

Zhang, Sheng; Wnang, Jian; Tang, Chao Jing

2012-05-01

It is interesting that counterfactual quantum cryptography protocols allow two remotely separated parties to share a secret key without transmitting any signal particles. Generally, these protocols, expected to provide security advantages, base their security on a translated no-cloning theorem. Therefore, they potentially exhibit unconditional security in theory. In this letter, we propose a new Trojan horse attack, by which an eavesdropper Eve can gain full information about the key without being noticed, to real implementations of a counterfactual quantum cryptography system. Most importantly, the presented attack is available even if the system has negligible imperfections. Therefore, it shows that the present realization of counterfactual quantum key distribution is vulnerable.

High-efficiency reconciliation for continuous variable quantum key distribution

NASA Astrophysics Data System (ADS)

Bai, Zengliang; Yang, Shenshen; Li, Yongmin

2017-04-01

Quantum key distribution (QKD) is the most mature application of quantum information technology. Information reconciliation is a crucial step in QKD and significantly affects the final secret key rates shared between two legitimate parties. We analyze and compare various construction methods of low-density parity-check (LDPC) codes and design high-performance irregular LDPC codes with a block length of 106. Starting from these good codes and exploiting the slice reconciliation technique based on multilevel coding and multistage decoding, we realize high-efficiency Gaussian key reconciliation with efficiency higher than 95% for signal-to-noise ratios above 1. Our demonstrated method can be readily applied in continuous variable QKD.

Optical threshold secret sharing scheme based on basic vector operations and coherence superposition

NASA Astrophysics Data System (ADS)

Deng, Xiaopeng; Wen, Wei; Mi, Xianwu; Long, Xuewen

2015-04-01

We propose, to our knowledge for the first time, a simple optical algorithm for secret image sharing with the (2,n) threshold scheme based on basic vector operations and coherence superposition. The secret image to be shared is firstly divided into n shadow images by use of basic vector operations. In the reconstruction stage, the secret image can be retrieved by recording the intensity of the coherence superposition of any two shadow images. Compared with the published encryption techniques which focus narrowly on information encryption, the proposed method can realize information encryption as well as secret sharing, which further ensures the safety and integrality of the secret information and prevents power from being kept centralized and abused. The feasibility and effectiveness of the proposed method are demonstrated by numerical results.

All-in-one visual and computer decoding of multiple secrets: translated-flip VC with polynomial-style sharing

NASA Astrophysics Data System (ADS)

Wu, Chia-Hua; Lee, Suiang-Shyan; Lin, Ja-Chen

2017-06-01

This all-in-one hiding method creates two transparencies that have several decoding options: visual decoding with or without translation flipping and computer decoding. In visual decoding, two less-important (or fake) binary secret images S1 and S2 can be revealed. S1 is viewed by the direct stacking of two transparencies. S2 is viewed by flipping one transparency and translating the other to a specified coordinate before stacking. Finally, important/true secret files can be decrypted by a computer using the information extracted from transparencies. The encoding process to hide this information includes the translated-flip visual cryptography, block types, the ways to use polynomial-style sharing, and linear congruential generator. If a thief obtained both transparencies, which are stored in distinct places, he still needs to find the values of keys used in computer decoding to break through after viewing S1 and/or S2 by stacking. However, the thief might just try every other kind of stacking and finally quit finding more secrets; for computer decoding is totally different from stacking decoding. Unlike traditional image hiding that uses images as host media, our method hides fine gray-level images in binary transparencies. Thus, our host media are transparencies. Comparisons and analysis are provided.

Containing the secret of child sexual abuse.

PubMed

McElvaney, Rosaleen; Greene, Sheila; Hogan, Diane

2012-04-01

This study reports a grounded theory study of the process of how children tell of their experiences of child sexual abuse from the perspectives of young people and their parents. Individual interviews were conducted with 22 young people aged 8 to 18, and 14 parents. A theoretical model was developed that conceptualises the process of disclosure as one of containing the secret of child sexual abuse. Three key dynamics were identified: the active withholding of the secret on the part of the child, the experience of a 'pressure cooker effect' reflecting a conflict between the wish to tell and the wish to keep the secret, and the confiding itself which often occurs in the context of an intimacy being shared. Children's experiences of disclosure were multidetermined and suggest the need for multifaceted and multisystemic approaches to prevention and intervention. The need for the secret to be contained, individually and interpersonally in appropriate safeguarding and therapeutic contexts needs to be respected in helping children tell.

Secure communications using quantum cryptography

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.

1997-08-01

The secure distribution of the secret random bit sequences known as {open_quotes}key{close_quotes} material, is an essential precursor to their use for the encryption and decryption of confidential communications. Quantum cryptography is an emerging technology for secure key distribution with single-photon transmissions, nor evade detection (eavesdropping raises the key error rate above a threshold value). We have developed experimental quantum cryptography systems based on the transmission of non-orthogonal single-photon states to generate shared key material over multi-kilometer optical fiber paths and over line-of-sight links. In both cases, key material is built up using the transmission of a single-photon per bit ofmore » an initial secret random sequence. A quantum-mechanically random subset of this sequence is identified, becoming the key material after a data reconciliation stage with the sender. In our optical fiber experiment we have performed quantum key distribution over 24-km of underground optical fiber using single-photon interference states, demonstrating that secure, real-time key generation over {open_quotes}open{close_quotes} multi-km node-to-node optical fiber communications links is possible. We have also constructed a quantum key distribution system for free-space, line-of-sight transmission using single-photon polarization states, which is currently undergoing laboratory testing. 7 figs.« less

Images Encryption Method using Steganographic LSB Method, AES and RSA algorithm

NASA Astrophysics Data System (ADS)

Moumen, Abdelkader; Sissaoui, Hocine

2017-03-01

Vulnerability of communication of digital images is an extremely important issue nowadays, particularly when the images are communicated through insecure channels. To improve communication security, many cryptosystems have been presented in the image encryption literature. This paper proposes a novel image encryption technique based on an algorithm that is faster than current methods. The proposed algorithm eliminates the step in which the secrete key is shared during the encryption process. It is formulated based on the symmetric encryption, asymmetric encryption and steganography theories. The image is encrypted using a symmetric algorithm, then, the secret key is encrypted by means of an asymmetrical algorithm and it is hidden in the ciphered image using a least significant bits steganographic scheme. The analysis results show that while enjoying the faster computation, our method performs close to optimal in terms of accuracy.

SEAODV: A Security Enhanced AODV Routing Protocol for Wireless Mesh Networks

NASA Astrophysics Data System (ADS)

Li, Celia; Wang, Zhuang; Yang, Cungang

In this paper, we propose a Security Enhanced AODV routing protocol (SEAODV) for wireless mesh networks (WMN). SEAODV employs Blom's key pre-distribution scheme to compute the pairwise transient key (PTK) through the flooding of enhanced HELLO message and subsequently uses the established PTK to distribute the group transient key (GTK). PTK and GTK authenticate unicast and broadcast routing messages respectively. In WMN, a unique PTK is shared by each pair of nodes, while GTK is shared secretly between the node and all its one-hop neighbours. A message authentication code (MAC) is attached as the extension to the original AODV routing message to guarantee the message's authenticity and integrity in a hop-by-hop fashion. Security analysis and performance evaluation show that SEAODV is more effective in preventing identified routing attacks and outperforms ARAN and SAODV in terms of computation cost and route acquisition latency.

Verifiable Secret Redistribution

DTIC Science & Technology

2001-10-01

but they are not trusted with secret. Thus, we require a protocol for redistribution without reconstruction of the secret . We also require...verification that the new shareholders have valid shares (ones that can be used to reconstruct the secret ). We present a new protocol to perform non...secret to shareholders in Shamir’s (m,n) threshold scheme (one in which we require m of n shares to reconstruct the secret ), and wish to redistribute the

Secret Sharing and Shared Information

NASA Astrophysics Data System (ADS)

Rauh, Johannes

2017-11-01

Secret sharing is a cryptographic discipline in which the goal is to distribute information about a secret over a set of participants in such a way that only specific authorized combinations of participants together can reconstruct the secret. Thus, secret sharing schemes are systems of variables in which it is very clearly specified which subsets have information about the secret. As such, they provide perfect model systems for information decompositions. However, following this intuition too far leads to an information decomposition with negative partial information terms, which are difficult to interpret. One possible explanation is that the partial information lattice proposed by Williams and Beer is incomplete and has to be extended to incorporate terms corresponding to higher order redundancy. These results put bounds on information decompositions that follow the partial information framework, and they hint at where the partial information lattice needs to be improved.

Quantum Dialogue with Authentication Based on Bell States

NASA Astrophysics Data System (ADS)

Shen, Dongsu; Ma, Wenping; Yin, Xunru; Li, Xiaoping

2013-06-01

We propose an authenticated quantum dialogue protocol, which is based on a shared private quantum entangled channel. In this protocol, the EPR pairs are randomly prepared in one of the four Bell states for communication. By performing four Pauli operations on the shared EPR pairs to encode their shared authentication key and secret message, two legitimate users can implement mutual identity authentication and quantum dialogue without the help from the third party authenticator. Furthermore, due to the EPR pairs which are used for secure communication are utilized to implement authentication and the whole authentication process is included in the direct secure communication process, it does not require additional particles to realize authentication in this protocol. The updated authentication key provides the counterparts with a new authentication key for the next authentication and direct communication. Compared with other secure communication with authentication protocols, this one is more secure and efficient owing to the combination of authentication and direct communication. Security analysis shows that it is secure against the eavesdropping attack, the impersonation attack and the man-in-the-middle (MITM) attack.

High-Dimensional Circular Quantum Secret Sharing Using Orbital Angular Momentum

NASA Astrophysics Data System (ADS)

Tang, Dawei; Wang, Tie-jun; Mi, Sichen; Geng, Xiao-Meng; Wang, Chuan

2016-11-01

Quantum secret sharing is to distribute secret message securely between multi-parties. Here exploiting orbital angular momentum (OAM) state of single photons as the information carrier, we propose a high-dimensional circular quantum secret sharing protocol which increases the channel capacity largely. In the proposed protocol, the secret message is split into two parts, and each encoded on the OAM state of single photons. The security of the protocol is guaranteed by the laws of non-cloning theorem. And the secret messages could not be recovered except that the two receivers collaborated with each other. Moreover, the proposed protocol could be extended into high-level quantum systems, and the enhanced security could be achieved.

Improvement of "Novel Multiparty Quantum Key Agreement Protocol with GHZ States"

NASA Astrophysics Data System (ADS)

Gu, Jun; Hwang, Tzonelih

2017-10-01

Quantum key agreement (QKA) protocol is a method for negotiating a fair and secure key among mutually untrusted participants. Recently, Xu et al. (Quantum Inf. Process. 13:2587-2594, 2014) proposed a multi-party QKA protocol based on Greenberger-Horne-Zeilinger (GHZ) states. However, this study points out that Xu et al.'s protocol cannot provide the fairness property. That is, the last involved participant in the protocol can manipulate the final shared secret key without being detected by the other participants. Moreover, according to Yu et al.'s research (2015), Xu et al.'s protocol cannot avoid the public discussion attack too. To avoid these weaknesses, an improved QKA protocol is proposed.

Secret Sharing of a Quantum State.

PubMed

Lu, He; Zhang, Zhen; Chen, Luo-Kan; Li, Zheng-Da; Liu, Chang; Li, Li; Liu, Nai-Le; Ma, Xiongfeng; Chen, Yu-Ao; Pan, Jian-Wei

2016-07-15

Secret sharing of a quantum state, or quantum secret sharing, in which a dealer wants to share a certain amount of quantum information with a few players, has wide applications in quantum information. The critical criterion in a threshold secret sharing scheme is confidentiality: with less than the designated number of players, no information can be recovered. Furthermore, in a quantum scenario, one additional critical criterion exists: the capability of sharing entangled and unknown quantum information. Here, by employing a six-photon entangled state, we demonstrate a quantum threshold scheme, where the shared quantum secrecy can be efficiently reconstructed with a state fidelity as high as 93%. By observing that any one or two parties cannot recover the secrecy, we show that our scheme meets the confidentiality criterion. Meanwhile, we also demonstrate that entangled quantum information can be shared and recovered via our setting, which shows that our implemented scheme is fully quantum. Moreover, our experimental setup can be treated as a decoding circuit of the five-qubit quantum error-correcting code with two erasure errors.

Three-party authenticated key agreements for optimal communication

PubMed Central

Lee, Tian-Fu; Hwang, Tzonelih

2017-01-01

Authenticated key agreements enable users to determine session keys, and to securely communicate with others over an insecure channel via the session keys. This study investigates the lower bounds on communications for three-party authenticated key agreements and considers whether or not the sub-keys for generating a session key can be revealed in the channel. Since two clients do not share any common secret key, they require the help of the server to authenticate their identities and exchange confidential and authenticated information over insecure networks. However, if the session key security is based on asymmetric cryptosystems, then revealing the sub-keys cannot compromise the session key. The clients can directly exchange the sub-keys and reduce the transmissions. In addition, authenticated key agreements were developed by using the derived results of the lower bounds on communications. Compared with related approaches, the proposed protocols had fewer transmissions and realized the lower bounds on communications. PMID:28355253

Biochemical characterization and comparison of aspartylglucosaminidases secreted in venom of the parasitoid wasps Asobara tabida and Leptopilina heterotoma

PubMed Central

Coulette, Quentin; Lemauf, Séverine; Colinet, Dominique; Prévost, Geneviève; Anselme, Caroline; Poirié, Marylène

2017-01-01

Aspartylglucosaminidase (AGA) is a low-abundance intracellular enzyme that plays a key role in the last stage of glycoproteins degradation, and whose deficiency leads to human aspartylglucosaminuria, a lysosomal storage disease. Surprisingly, high amounts of AGA-like proteins are secreted in the venom of two phylogenetically distant hymenopteran parasitoid wasp species, Asobara tabida (Braconidae) and Leptopilina heterotoma (Cynipidae). These venom AGAs have a similar domain organization as mammalian AGAs. They share with them key residues for autocatalysis and activity, and the mature α- and β-subunits also form an (αβ)2 structure in solution. Interestingly, only one of these AGAs subunits (α for AtAGA and β for LhAGA) is glycosylated instead of the two subunits for lysosomal human AGA (hAGA), and these glycosylations are partially resistant to PGNase F treatment. The two venom AGAs are secreted as fully activated enzymes, they have a similar aspartylglucosaminidase activity and are both also efficient asparaginases. Once AGAs are injected into the larvae of the Drosophila melanogaster host, the asparaginase activity may play a role in modulating their physiology. Altogether, our data provide new elements for a better understanding of the secretion and the role of venom AGAs as virulence factors in the parasitoid wasps’ success. PMID:28742131

Gaussian private quantum channel with squeezed coherent states

PubMed Central

Jeong, Kabgyun; Kim, Jaewan; Lee, Su-Yong

2015-01-01

While the objective of conventional quantum key distribution (QKD) is to secretly generate and share the classical bits concealed in the form of maximally mixed quantum states, that of private quantum channel (PQC) is to secretly transmit individual quantum states concealed in the form of maximally mixed states using shared one-time pad and it is called Gaussian private quantum channel (GPQC) when the scheme is in the regime of continuous variables. We propose a GPQC enhanced with squeezed coherent states (GPQCwSC), which is a generalization of GPQC with coherent states only (GPQCo) [Phys. Rev. A 72, 042313 (2005)]. We show that GPQCwSC beats the GPQCo for the upper bound on accessible information. As a subsidiary example, it is shown that the squeezed states take an advantage over the coherent states against a beam splitting attack in a continuous variable QKD. It is also shown that a squeezing operation can be approximated as a superposition of two different displacement operations in the small squeezing regime. PMID:26364893

Gaussian private quantum channel with squeezed coherent states.

PubMed

Jeong, Kabgyun; Kim, Jaewan; Lee, Su-Yong

2015-09-14

While the objective of conventional quantum key distribution (QKD) is to secretly generate and share the classical bits concealed in the form of maximally mixed quantum states, that of private quantum channel (PQC) is to secretly transmit individual quantum states concealed in the form of maximally mixed states using shared one-time pad and it is called Gaussian private quantum channel (GPQC) when the scheme is in the regime of continuous variables. We propose a GPQC enhanced with squeezed coherent states (GPQCwSC), which is a generalization of GPQC with coherent states only (GPQCo) [Phys. Rev. A 72, 042313 (2005)]. We show that GPQCwSC beats the GPQCo for the upper bound on accessible information. As a subsidiary example, it is shown that the squeezed states take an advantage over the coherent states against a beam splitting attack in a continuous variable QKD. It is also shown that a squeezing operation can be approximated as a superposition of two different displacement operations in the small squeezing regime.

The general theory of three-party quantum secret sharing protocols over phase-damping channels

NASA Astrophysics Data System (ADS)

Song, Ting-Ting; Wen, Qiao-Yan; Qin, Su-Juan; Zhang, Wei-Wei; Sun, Ying

2013-10-01

The general theory of three-party QSS protocols with the noisy quantum channels is discussed. When the particles are transmitted through the noisy quantum channels, the initial pure three-qubit tripartite entangled states would be changed into mixed states. We analyze the security of QSS protocols with the different kinds of three-qubit tripartite entangled states under phase-damping channels and figure out, for different kinds of initial states, the successful probabilities that Alice's secret can be recovered by legal agents are different. Comparing with one recent QSS protocol based on GHZ states, our scheme is secure, and has a little smaller key rate than that of the recent protocol.

Quantum cryptography over underground optical fibers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hughes, R.J.; Luther, G.G.; Morgan, G.L.

1996-05-01

Quantum cryptography is an emerging technology in which two parties may simultaneously generated shared, secret cryptographic key material using the transmission of quantum states of light whose security is based on the inviolability of the laws of quantum mechanics. An adversary can neither successfully tap the key transmissions, nor evade detection, owing to Heisenberg`s uncertainty principle. In this paper the authors describe the theory of quantum cryptography, and the most recent results from their experimental system with which they are generating key material over 14-km of underground optical fiber. These results show that optical-fiber based quantum cryptography could allow secure,more » real-time key generation over ``open`` multi-km node-to-node optical fiber communications links between secure ``islands.``« less

Cryptanalysis of a semi-quantum secret sharing scheme based on Bell states

NASA Astrophysics Data System (ADS)

Gao, Gan; Wang, Yue; Wang, Dong

2018-03-01

In the paper [Mod. Phys. Lett. B 31 (2017) 1750150], Yin et al. proposed a semi-quantum secret sharing scheme by using Bell states. We find that the proposed scheme cannot finish the quantum secret sharing task. In addition, we also find that the proposed scheme has a security loophole, that is, it will not be detected that the dishonest participant, Charlie attacks on the quantum channel.

A New Improving Quantum Secret Sharing Scheme

NASA Astrophysics Data System (ADS)

Xu, Ting-Ting; Li, Zhi-Hui; Bai, Chen-Ming; Ma, Min

2017-04-01

An improving quantum secret sharing scheme (IQSS scheme) was introduced by Nascimento et al. (Phys. Rev. A 64, 042311 (2001)), which was analyzed by the improved quantum access structure. In this paper, we propose a new improving quantum secret sharing scheme, and more quantum access structures can be realized by this scheme than the previous one. For example, we prove that any threshold and hypercycle quantum access structures can be realized by the new scheme.

Two new Controlled not Gate Based Quantum Secret Sharing Protocols without Entanglement Attenuation

NASA Astrophysics Data System (ADS)

Zhu, Zhen-Chao; Hu, Ai-Qun; Fu, An-Min

2016-05-01

In this paper, we propose two new controlled not gate based quantum secret sharing protocols. In these two protocols, each photon only travels once, which guarantees the agents located in long distance can be able to derive the dealer's secret without suffering entanglement attenuation problem. The protocols are secure against trojan horse attack, intercept-resend attack, entangle-measure attack and entanglement-swapping attack. The theoretical efficiency for qubits of these two protocols can approach 100 %, except those used for eavesdropping checking, all entangled states can be used for final secret sharing.

Semiquantum key distribution with secure delegated quantum computation

PubMed Central

Li, Qin; Chan, Wai Hong; Zhang, Shengyu

2016-01-01

Semiquantum key distribution allows a quantum party to share a random key with a “classical” party who only can prepare and measure qubits in the computational basis or reorder some qubits when he has access to a quantum channel. In this work, we present a protocol where a secret key can be established between a quantum user and an almost classical user who only needs the quantum ability to access quantum channels, by securely delegating quantum computation to a quantum server. We show the proposed protocol is robust even when the delegated quantum server is a powerful adversary, and is experimentally feasible with current technology. As one party of our protocol is the most quantum-resource efficient, it can be more practical and significantly widen the applicability scope of quantum key distribution. PMID:26813384

A New Three Dimensional Based Key Generation Technique in AVK

NASA Astrophysics Data System (ADS)

Banerjee, Subhasish; Dutta, Manash Pratim; Bhunia, Chandan Tilak

2017-08-01

In modern era, ensuring high order security becomes one and only objective of computer networks. From the last few decades, many researchers have given their contributions to achieve the secrecy over the communication channel. In achieving perfect security, Shannon had done the pioneer work on perfect secret theorem and illustrated that secrecy of the shared information can be maintained if the key becomes variable in nature instead of static one. In this regard, a key generation technique has been proposed where the key can be changed every time whenever a new block of data needs to be exchanged. In our scheme, the keys not only vary in bit sequences but also in size. The experimental study is also included in this article to prove the correctness and effectiveness of our proposed technique.

Improving security of the ping-pong protocol

NASA Astrophysics Data System (ADS)

Zawadzki, Piotr

2013-01-01

A security layer for the asymptotically secure ping-pong protocol is proposed and analyzed in the paper. The operation of the improvement exploits inevitable errors introduced by the eavesdropping in the control and message modes. Its role is similar to the privacy amplification algorithms known from the quantum key distribution schemes. Messages are processed in blocks which guarantees that an eavesdropper is faced with a computationally infeasible problem as long as the system parameters are within reasonable limits. The introduced additional information preprocessing does not require quantum memory registers and confidential communication is possible without prior key agreement or some shared secret.

Supporting reputation based trust management enhancing security layer for cloud service models

NASA Astrophysics Data System (ADS)

Karthiga, R.; Vanitha, M.; Sumaiya Thaseen, I.; Mangaiyarkarasi, R.

2017-11-01

In the existing system trust between cloud providers and consumers is inadequate to establish the service level agreement though the consumer’s response is good cause to assess the overall reliability of cloud services. Investigators recognized the significance of trust can be managed and security can be provided based on feedback collected from participant. In this work a face recognition system that helps to identify the user effectively. So we use an image comparison algorithm where the user face is captured during registration time and get stored in database. With that original image we compare it with the sample image that is already stored in database. If both the image get matched then the users are identified effectively. When the confidential data are subcontracted to the cloud, data holders will become worried about the confidentiality of their data in the cloud. Encrypting the data before subcontracting has been regarded as the important resources of keeping user data privacy beside the cloud server. So in order to keep the data secure we use an AES algorithm. Symmetric-key algorithms practice a shared key concept, keeping data secret requires keeping this key secret. So only the user with private key can decrypt data.

Quantum tagging for tags containing secret classical data

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kent, Adrian

Various authors have considered schemes for quantum tagging, that is, authenticating the classical location of a classical tagging device by sending and receiving quantum signals from suitably located distant sites, in an environment controlled by an adversary whose quantum information processing and transmitting power is potentially unbounded. All of the schemes proposed elsewhere in the literature assume that the adversary is able to inspect the interior of the tagging device. All of these schemes have been shown to be breakable if the adversary has unbounded predistributed entanglement. We consider here the case in which the tagging device contains a finitemore » key string shared with distant sites but kept secret from the adversary, and show this allows the location of the tagging device to be authenticated securely and indefinitely. Our protocol relies on quantum key distribution between the tagging device and at least one distant site, and demonstrates a new practical application of quantum key distribution. It also illustrates that the attainable security in position-based cryptography can depend crucially on apparently subtle details in the security scenario considered.« less

Halftone visual cryptography.

PubMed

Zhou, Zhi; Arce, Gonzalo R; Di Crescenzo, Giovanni

2006-08-01

Visual cryptography encodes a secret binary image (SI) into n shares of random binary patterns. If the shares are xeroxed onto transparencies, the secret image can be visually decoded by superimposing a qualified subset of transparencies, but no secret information can be obtained from the superposition of a forbidden subset. The binary patterns of the n shares, however, have no visual meaning and hinder the objectives of visual cryptography. Extended visual cryptography [1] was proposed recently to construct meaningful binary images as shares using hypergraph colourings, but the visual quality is poor. In this paper, a novel technique named halftone visual cryptography is proposed to achieve visual cryptography via halftoning. Based on the blue-noise dithering principles, the proposed method utilizes the void and cluster algorithm [2] to encode a secret binary image into n halftone shares (images) carrying significant visual information. The simulation shows that the visual quality of the obtained halftone shares are observably better than that attained by any available visual cryptography method known to date.

Self-Chaperoning of the Type III Secretion System needle tip proteins IpaD and BipD

PubMed Central

Johnson, Steven; Roversi, Pietro; Espina, Marianela; Olive, Andrew; Deane, Janet E.; Birket, Susan; Field, Terry; Picking, William D.; Blocker, Ariel; Galyov, Edouard E.; Picking, Wendy L.; Lea, Susan M.

2007-01-01

Bacteria expressing type III secretion systems (T3SS) have been responsible for the deaths of millions worldwide, acting as key virulence elements in diseases ranging from plague to typhoid fever. The T3SS is composed of a basal body, which traverses both bacterial membranes, and an external needle through which effector proteins are secreted. We report multiple crystal structures of two proteins that sit at the tip of the needle and are essential for virulence; IpaD from Shigella flexneri and BipD from Burkholderia pseudomallei. The structures reveal that the N-terminal domains of the molecules are intra-molecular chaperones that prevent premature oligomerization, as well as sharing structural homology with proteins involved in eukaryotic actin rearrangement. Crystal packing has allowed us to construct a model for the tip complex that is supported by mutations designed using the structure. PMID:17077085

Self-chaperoning of the type III secretion system needle tip proteins IpaD and BipD.

PubMed

Johnson, Steven; Roversi, Pietro; Espina, Marianela; Olive, Andrew; Deane, Janet E; Birket, Susan; Field, Terry; Picking, William D; Blocker, Ariel J; Galyov, Edouard E; Picking, Wendy L; Lea, Susan M

2007-02-09

Bacteria expressing type III secretion systems (T3SS) have been responsible for the deaths of millions worldwide, acting as key virulence elements in diseases ranging from plague to typhoid fever. The T3SS is composed of a basal body, which traverses both bacterial membranes, and an external needle through which effector proteins are secreted. We report multiple crystal structures of two proteins that sit at the tip of the needle and are essential for virulence: IpaD from Shigella flexneri and BipD from Burkholderia pseudomallei. The structures reveal that the N-terminal domains of the molecules are intramolecular chaperones that prevent premature oligomerization, as well as sharing structural homology with proteins involved in eukaryotic actin rearrangement. Crystal packing has allowed us to construct a model for the tip complex that is supported by mutations designed using the structure.

Simple group password-based authenticated key agreements for the integrated EPR information system.

PubMed

Lee, Tian-Fu; Chang, I-Pin; Wang, Ching-Cheng

2013-04-01

The security and privacy are important issues for electronic patient records (EPRs). The goal of EPRs is sharing the patients' medical histories such as the diagnosis records, reports and diagnosis image files among hospitals by the Internet. So the security issue for the integrated EPR information system is essential. That is, to ensure the information during transmission through by the Internet is secure and private. The group password-based authenticated key agreement (GPAKE) allows a group of users like doctors, nurses and patients to establish a common session key by using password authentication. Then the group of users can securely communicate by using this session key. Many approaches about GAPKE employ the public key infrastructure (PKI) in order to have higher security. However, it not only increases users' overheads and requires keeping an extra equipment for storing long-term secret keys, but also requires maintaining the public key system. This investigation presents a simple group password-based authenticated key agreement (SGPAKE) protocol for the integrated EPR information system. The proposed SGPAKE protocol does not require using the server or users' public keys. Each user only remembers his weak password shared with a trusted server, and then can obtain a common session key. Then all users can securely communicate by using this session key. The proposed SGPAKE protocol not only provides users with convince, but also has higher security.

Security on Cloud Revocation Authority using Identity Based Encryption

NASA Astrophysics Data System (ADS)

Rajaprabha, M. N.

2017-11-01

As due to the era of cloud computing most of the people are saving there documents, files and other things on cloud spaces. Due to this security over the cloud is also important because all the confidential things are there on the cloud. So to overcome private key infrastructure (PKI) issues some revocable Identity Based Encryption (IBE) techniques are introduced which eliminates the demand of PKI. The technique introduced is key update cloud service provider which is having two issues in it and they are computation and communication cost is high and second one is scalability issue. So to overcome this problem we come along with the system in which the Cloud Revocation Authority (CRA) is there for the security which will only hold the secret key for each user. And the secret key was send with the help of advanced encryption standard security. The key is encrypted and send to the CRA for giving the authentication to the person who wants to share the data or files or for the communication purpose. Through that key only the other user will able to access that file and if the user apply some invalid key on the particular file than the information of that user and file is send to the administrator and administrator is having rights to block that person of black list that person to use the system services.

Entangled state quantum cryptography: eavesdropping on the ekert protocol

PubMed

Naik; Peterson; White; Berglund; Kwiat

2000-05-15

Using polarization-entangled photons from spontaneous parametric down-conversion, we have implemented Ekert's quantum cryptography protocol. The near-perfect correlations of the photons allow the sharing of a secret key between two parties. The presence of an eavesdropper is continually checked by measuring Bell's inequalities. We investigated several possible eavesdropper strategies, including pseudo-quantum-nondemolition measurements. In all cases, the eavesdropper's presence was readily apparent. We discuss a procedure to increase her detectability.

Dynamic quantum secret sharing by using d-dimensional GHZ state

NASA Astrophysics Data System (ADS)

Qin, Huawang; Dai, Yuewei

2017-03-01

Through generating the d-dimensional GHZ state in the Z-basis and measuring it in the X-basis, a dynamic quantum secret sharing scheme is proposed. In the proposed scheme, multiple participants can be added or deleted in one update period, and the shared secret does not need to be changed. The participants can be added or deleted by themselves, and the dealer does not need to be online. Compared to the existing schemes, the proposed scheme is more efficient and more practical.

An Efficient Multiparty Quantum Secret Sharing Protocol Based on Bell States in the High Dimension Hilbert Space

NASA Astrophysics Data System (ADS)

Gao, Gan; Wang, Li-Ping

2010-11-01

We propose a quantum secret sharing protocol, in which Bell states in the high dimension Hilbert space are employed. The biggest advantage of our protocol is the high source capacity. Compared with the previous secret sharing protocol, ours has the higher controlling efficiency. In addition, as decoy states in the high dimension Hilbert space are used, we needn’t destroy quantum entanglement for achieving the goal to check the channel security.

Threshold quantum cryptography

NASA Astrophysics Data System (ADS)

Tokunaga, Yuuki; Okamoto, Tatsuaki; Imoto, Nobuyuki

2005-01-01

We present the concept of threshold collaborative unitary transformation or threshold quantum cryptography, which is a kind of quantum version of threshold cryptography. Threshold quantum cryptography states that classical shared secrets are distributed to several parties and a subset of them, whose number is greater than a threshold, collaborates to compute a quantum cryptographic function, while keeping each share secretly inside each party. The shared secrets are reusable if no cheating is detected. As a concrete example of this concept, we show a distributed protocol (with threshold) of conjugate coding.

Verifiable Secret Redistribution for Threshold Sharing Schemes

DTIC Science & Technology

2002-02-01

complete verification in our protocol, old shareholders broadcast a commitment to the secret to the new shareholders. We prove that the new...of an m − 1 degree polynomial from m of n points yields a constant term in 1 the polynomial that corresponds to the secret . In Blakley’s scheme [Bla79...the intersection of m of n vector spaces yields a one-dimensional vector that corresponds to the secret . Desmedt surveys other sharing schemes

Comment on "Proactive quantum secret sharing"

NASA Astrophysics Data System (ADS)

Gao, Gan; Wang, Yue

2017-03-01

In the paper, Qin and Dai (Quantum Inf Process 14:4237-4244, 2015) proposed a proactive quantum secret sharing scheme. We study the security of the proposed scheme and find that it is not secure. In the distribution phase of the proposed scheme, two dishonest participants may collaborate to eavesdrop the secret of the dealer without introducing any error.

Multi-party quantum key agreement with five-qubit brown states

NASA Astrophysics Data System (ADS)

Cai, Tao; Jiang, Min; Cao, Gang

2018-05-01

In this paper, we propose a multi-party quantum key agreement protocol with five-qubit brown states and single-qubit measurements. Our multi-party protocol ensures each participant to contribute equally to the agreement key. Each party performs three single-qubit unitary operations on three qubits of each brown state. Finally, by measuring brown states and decoding the measurement results, all participants can negotiate a shared secret key without classical bits exchange between them. With the analysis of security, our protocol demonstrates that it can resist against both outsider and participant attacks. Compared with other schemes, it also possesses a higher information efficiency. In terms of physical operation, it requires single-qubit measurements only which weakens the hardware requirements of participant and has a better operating flexibility.

Two-party quantum key agreement with five-particle entangled states

NASA Astrophysics Data System (ADS)

He, Ye-Feng; Ma, Wen-Ping

A two-party quantum key agreement protocol is proposed with five-particle entangled states and the delayed measurement technique. According to the measurement correlation property of five-particle entangled states, two participants can deduce the measurement results of each other’s initial quantum states. As a result, two parties can extract the secret keys of each other by using the publicly announced value or by performing the delayed measurement, respectively. Thus, a shared key is fairly established. Since each particle is transmitted only once in quantum channel, the protocol is congenitally free from the Trojan horse attacks. It is shown that the protocol not only is secure against both participant and outsider attacks but also has no information leakage problem. Moreover, it has high qubit efficiency.

All about Eve: Secret Sharing using Quantum Effects

NASA Technical Reports Server (NTRS)

Jackson, Deborah J.

2005-01-01

This document discusses the nature of light (including classical light and photons), encryption, quantum key distribution (QKD), light polarization and beamsplitters and their application to information communication. A quantum of light represents the smallest possible subdivision of radiant energy (light) and is called a photon. The QKD key generation sequence is outlined including the receiver broadcasting the initial signal indicating reception availability, timing pulses from the sender to provide reference for gated detection of photons, the sender generating photons through random polarization while the receiver detects photons with random polarization and communicating via data link to mutually establish random keys. The QKD network vision includes inter-SATCOM, point-to-point Gnd Fiber and SATCOM-fiber nodes. QKD offers an unconditionally secure method of exchanging encryption keys. Ongoing research will focus on how to increase the key generation rate.

Bound entangled states with a private key and their classical counterpart.

PubMed

Ozols, Maris; Smith, Graeme; Smolin, John A

2014-03-21

Entanglement is a fundamental resource for quantum information processing. In its pure form, it allows quantum teleportation and sharing classical secrets. Realistic quantum states are noisy and their usefulness is only partially understood. Bound-entangled states are central to this question--they have no distillable entanglement, yet sometimes still have a private classical key. We present a construction of bound-entangled states with a private key based on classical probability distributions. From this emerge states possessing a new classical analogue of bound entanglement, distinct from the long-sought bound information. We also find states of smaller dimensions and higher key rates than previously known. Our construction has implications for classical cryptography: we show that existing protocols are insufficient for extracting private key from our distributions due to their "bound-entangled" nature. We propose a simple extension of existing protocols that can extract a key from them.

Rate-loss analysis of an efficient quantum repeater architecture

NASA Astrophysics Data System (ADS)

Guha, Saikat; Krovi, Hari; Fuchs, Christopher A.; Dutton, Zachary; Slater, Joshua A.; Simon, Christoph; Tittel, Wolfgang

2015-08-01

We analyze an entanglement-based quantum key distribution (QKD) architecture that uses a linear chain of quantum repeaters employing photon-pair sources, spectral-multiplexing, linear-optic Bell-state measurements, multimode quantum memories, and classical-only error correction. Assuming perfect sources, we find an exact expression for the secret-key rate, and an analytical description of how errors propagate through the repeater chain, as a function of various loss-and-noise parameters of the devices. We show via an explicit analytical calculation, which separately addresses the effects of the principle nonidealities, that this scheme achieves a secret-key rate that surpasses the Takeoka-Guha-Wilde bound—a recently found fundamental limit to the rate-vs-loss scaling achievable by any QKD protocol over a direct optical link—thereby providing one of the first rigorous proofs of the efficacy of a repeater protocol. We explicitly calculate the end-to-end shared noisy quantum state generated by the repeater chain, which could be useful for analyzing the performance of other non-QKD quantum protocols that require establishing long-distance entanglement. We evaluate that shared state's fidelity and the achievable entanglement-distillation rate, as a function of the number of repeater nodes, total range, and various loss-and-noise parameters of the system. We extend our theoretical analysis to encompass sources with nonzero two-pair-emission probability, using an efficient exact numerical evaluation of the quantum state propagation and measurements. We expect our results to spur formal rate-loss analysis of other repeater protocols and also to provide useful abstractions to seed analyses of quantum networks of complex topologies.

Seaworthy Quantum Key Distribution Design and Validation (SEAKEY)

DTIC Science & Technology

2014-07-25

link in a free- space channel through a marine environment (such as loss, noise and turbulence) and (2) parametrically calculating the secret key rate...width. Parametric calculations of the expected secret key rate As can be seen in Figure 6, the secret key rate of the BB84 protocol in the presence...Figure 9 shows the effect of various detriments on the secret -kay rate, for laser-decoy BB84. Figure 9: Effects of detriments on secret-key rate

Unconstrained Capacities of Quantum Key Distribution and Entanglement Distillation for Pure-Loss Bosonic Broadcast Channels.

PubMed

Takeoka, Masahiro; Seshadreesan, Kaushik P; Wilde, Mark M

2017-10-13

We consider quantum key distribution (QKD) and entanglement distribution using a single-sender multiple-receiver pure-loss bosonic broadcast channel. We determine the unconstrained capacity region for the distillation of bipartite entanglement and secret key between the sender and each receiver, whenever they are allowed arbitrary public classical communication. A practical implication of our result is that the capacity region demonstrated drastically improves upon rates achievable using a naive time-sharing strategy, which has been employed in previously demonstrated network QKD systems. We show a simple example of a broadcast QKD protocol overcoming the limit of the point-to-point strategy. Our result is thus an important step toward opening a new framework of network channel-based quantum communication technology.

On Asymptotically Good Ramp Secret Sharing Schemes

NASA Astrophysics Data System (ADS)

Geil, Olav; Martin, Stefano; Martínez-Peñas, Umberto; Matsumoto, Ryutaroh; Ruano, Diego

Asymptotically good sequences of linear ramp secret sharing schemes have been intensively studied by Cramer et al. in terms of sequences of pairs of nested algebraic geometric codes. In those works the focus is on full privacy and full reconstruction. In this paper we analyze additional parameters describing the asymptotic behavior of partial information leakage and possibly also partial reconstruction giving a more complete picture of the access structure for sequences of linear ramp secret sharing schemes. Our study involves a detailed treatment of the (relative) generalized Hamming weights of the considered codes.

An efficient (t,n) threshold quantum secret sharing without entanglement

NASA Astrophysics Data System (ADS)

Qin, Huawang; Dai, Yuewei

2016-04-01

An efficient (t,n) threshold quantum secret sharing (QSS) scheme is proposed. In our scheme, the Hash function is used to check the eavesdropping, and no particles need to be published. So the utilization efficiency of the particles is real 100%. No entanglement is used in our scheme. The dealer uses the single particles to encode the secret information, and the participants get the secret through measuring the single particles. Compared to the existing schemes, our scheme is simpler and more efficient.

Graph State-Based Quantum Secret Sharing with the Chinese Remainder Theorem

NASA Astrophysics Data System (ADS)

Guo, Ying; Luo, Peng; Wang, Yijun

2016-11-01

Quantum secret sharing (QSS) is a significant quantum cryptography technology in the literature. Dividing an initial secret into several sub-secrets which are then transferred to other legal participants so that it can be securely recovered in a collaboration fashion. In this paper, we develop a quantum route selection based on the encoded quantum graph state, thus enabling the practical QSS scheme in the small-scale complex quantum network. Legal participants are conveniently designated with the quantum route selection using the entanglement of the encoded graph states. Each participant holds a vertex of the graph state so that legal participants are selected through performing operations on specific vertices. The Chinese remainder theorem (CRT) strengthens the security of the recovering process of the initial secret among the legal participants. The security is ensured by the entanglement of the encoded graph states that are cooperatively prepared and shared by legal users beforehand with the sub-secrets embedded in the CRT over finite fields.

Information Theoretic Secret Key Generation: Structured Codes and Tree Packing

ERIC Educational Resources Information Center

Nitinawarat, Sirin

2010-01-01

This dissertation deals with a multiterminal source model for secret key generation by multiple network terminals with prior and privileged access to a set of correlated signals complemented by public discussion among themselves. Emphasis is placed on a characterization of secret key capacity, i.e., the largest rate of an achievable secret key,…

Cryptanalysis and Improvement of the Semi-quantum Secret Sharing Protocol

NASA Astrophysics Data System (ADS)

Gao, Xiang; Zhang, Shibin; Chang, Yan

2017-08-01

Recently, Xie et al. Int. J. Theor. Phys. 54, 3819-3824, (2015) proposed a Semi-quantum secret sharing protocol (SQSS). Yin et al. Int. J. Theor. Phys. 55: 4027-4035, (2016) pointed out that this protocol suffers from the intercept-resend attack. Yin et al. also proposed an improved protocol. However, we find out that Yin et al.'s paper has some problems, we analyze Yin et al.'s paper, then proposed the improved semi-quantum secret sharing protocol. Our protocol is more secure and efficient, most importantly, our protocol satisfies the condition of semi-quantum.

Quantum secret sharing via local operations and classical communication.

PubMed

Yang, Ying-Hui; Gao, Fei; Wu, Xia; Qin, Su-Juan; Zuo, Hui-Juan; Wen, Qiao-Yan

2015-11-20

We investigate the distinguishability of orthogonal multipartite entangled states in d-qudit system by restricted local operations and classical communication. According to these properties, we propose a standard (2, n)-threshold quantum secret sharing scheme (called LOCC-QSS scheme), which solves the open question in [Rahaman et al., Phys. Rev. A, 91, 022330 (2015)]. On the other hand, we find that all the existing (k, n)-threshold LOCC-QSS schemes are imperfect (or "ramp"), i.e., unauthorized groups can obtain some information about the shared secret. Furthermore, we present a (3, 4)-threshold LOCC-QSS scheme which is close to perfect.

Comment on "Dynamic quantum secret sharing"

NASA Astrophysics Data System (ADS)

Liao, Ci-Hong; Yang, Chun-Wei; Hwang, Tzonelish

2013-10-01

Hsu et al. (Quantum Inf Process 12:331-344,2013) proposed a dynamic quantum secret sharing (DQSS) protocol using the entanglement swapping of Bell states for an agent to easily join (or leave) the system. In 2013, Wang and Li (Quantum Inf Process 12(5):1991-1997, 2013) proposed a collusion attack on Hsu et al.'s DQSS protocol. Nevertheless, this study points out a new security issue on Hsu et al.'s DQSS protocol regarding to the honesty of a revoked agent. Without considering this issue, the DQSS protocol could be failed to provide secret sharing function.

Entangled State Quantum Cryptography: Eavesdropping on the Ekert Protocol

DOE Office of Scientific and Technical Information (OSTI.GOV)

Naik, D. S.; Peterson, C. G.; White, A. G.

2000-05-15

Using polarization-entangled photons from spontaneous parametric down-conversion, we have implemented Ekert's quantum cryptography protocol. The near-perfect correlations of the photons allow the sharing of a secret key between two parties. The presence of an eavesdropper is continually checked by measuring Bell's inequalities. We investigated several possible eavesdropper strategies, including pseudo-quantum-nondemolition measurements. In all cases, the eavesdropper's presence was readily apparent. We discuss a procedure to increase her detectability. (c) 2000 The American Physical Society.

Secret key distillation from shielded two-qubit states

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bae, Joonwoo

The quantum states corresponding to a secret key are characterized using the so-called private states, where the key part consisting of a secret key is shielded by the additional systems. Based on the construction, it was shown that a secret key can be distilled from bound entangled states. In this work, I consider the shielded two-qubit states in a key-distillation scenario and derive the conditions under which a secret key can be distilled using the recurrence protocol or the two-way classical distillation, advantage distillation together with one-way postprocessing. From the security conditions, it is shown that a secret key canmore » be distilled from bound entangled states in a much wider range. In addition, I consider the case that in which white noise is added to quantum states and show that the classical distillation protocol still works despite a certain amount of noise although the recurrence protocol does not.« less

Position-based quantum cryptography over untrusted networks

NASA Astrophysics Data System (ADS)

Nadeem, Muhammad

2014-08-01

In this article, we propose quantum position verification (QPV) schemes where all the channels are untrusted except the position of the prover and distant reference stations of verifiers. We review and analyze the existing QPV schemes containing some pre-shared data between the prover and verifiers. Most of these schemes are based on non-cryptographic assumptions, i.e. quantum/classical channels between the verifiers are secure. It seems impractical in an environment fully controlled by adversaries and would lead to security compromise in practical implementations. However, our proposed formula for QPV is more robust, secure and according to the standard assumptions of cryptography. Furthermore, once the position of the prover is verified, our schemes establish secret keys in parallel and can be used for authentication and secret communication between the prover and verifiers.

Cellulolytic Streptomyces Strains Associated with Herbivorous Insects Share a Phylogenetically Linked Capacity To Degrade Lignocellulose

PubMed Central

Book, Adam J.; Lewin, Gina R.; McDonald, Bradon R.; Takasuka, Taichi E.; Doering, Drew T.; Adams, Aaron S.; Blodgett, Joshua A. V.; Clardy, Jon; Raffa, Kenneth F.; Fox, Brian G.

2014-01-01

Actinobacteria in the genus Streptomyces are critical players in microbial communities that decompose complex carbohydrates in the soil, and these bacteria have recently been implicated in the deconstruction of plant polysaccharides for some herbivorous insects. Despite the importance of Streptomyces to carbon cycling, the extent of their plant biomass-degrading ability remains largely unknown. In this study, we compared four strains of Streptomyces isolated from insect herbivores that attack pine trees: DpondAA-B6 (SDPB6) from the mountain pine beetle, SPB74 from the southern pine beetle, and SirexAA-E (SACTE) and SirexAA-G from the woodwasp, Sirex noctilio. Biochemical analysis of secreted enzymes demonstrated that only two of these strains, SACTE and SDPB6, were efficient at degrading plant biomass. Genomic analyses indicated that SACTE and SDPB6 are closely related and that they share similar compositions of carbohydrate-active enzymes. Genome-wide proteomic and transcriptomic analyses revealed that the major exocellulases (GH6 and GH48), lytic polysaccharide monooxygenases (AA10), and mannanases (GH5) were conserved and secreted by both organisms, while the secreted endocellulases (GH5 and GH9 versus GH9 and GH12) were from diverged enzyme families. Together, these data identify two phylogenetically related insect-associated Streptomyces strains with high biomass-degrading activity and characterize key enzymatic similarities and differences used by these organisms to deconstruct plant biomass. PMID:24837391

(t, n) Threshold d-Level Quantum Secret Sharing.

PubMed

Song, Xiu-Li; Liu, Yan-Bing; Deng, Hong-Yao; Xiao, Yong-Gang

2017-07-25

Most of Quantum Secret Sharing(QSS) are (n, n) threshold 2-level schemes, in which the 2-level secret cannot be reconstructed until all n shares are collected. In this paper, we propose a (t, n) threshold d-level QSS scheme, in which the d-level secret can be reconstructed only if at least t shares are collected. Compared with (n, n) threshold 2-level QSS, the proposed QSS provides better universality, flexibility, and practicability. Moreover, in this scheme, any one of the participants does not know the other participants' shares, even the trusted reconstructor Bob 1 is no exception. The transformation of the particles includes some simple operations such as d-level CNOT, Quantum Fourier Transform(QFT), Inverse Quantum Fourier Transform(IQFT), and generalized Pauli operator. The transformed particles need not to be transmitted from one participant to another in the quantum channel. Security analysis shows that the proposed scheme can resist intercept-resend attack, entangle-measure attack, collusion attack, and forgery attack. Performance comparison shows that it has lower computation and communication costs than other similar schemes when 2 < t < n - 1.

Comment on ‘Authenticated quantum secret sharing with quantum dialogue based on Bell states’

NASA Astrophysics Data System (ADS)

Gao, Gan; Wang, Yue; Wang, Dong; Ye, Liu

2018-02-01

In the paper (2016 Phys. Scr. 91 085101), Abulkasim et al proposed a authenticated quantum secret sharing scheme. We study the security of the multiparty case in the proposed scheme and find that it is not secure.

Advances in Cryptology - EUROCRYPT’ 97

DTIC Science & Technology

1998-05-03

public keys is about T/102. For example, one can choose T ~ 227.67 and M ~ 2 35.65. To obtain the secret session key from the determined internal state...scenario, where the objective is to reconstruct the secret key controlled LFSR initial states from the known keystream sequence, for a survey see... the secret message keys defining different initial internal states. This may open new possibilities for the secret key recovery cryptanalytic attacks

Security of counterfactual quantum cryptography

NASA Astrophysics Data System (ADS)

Yin, Zhen-Qiang; Li, Hong-Wei; Chen, Wei; Han, Zheng-Fu; Guo, Guang-Can

2010-10-01

Recently, a “counterfactual” quantum-key-distribution scheme was proposed by T.-G. Noh [Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.103.230501 103, 230501 (2009)]. In this scheme, two legitimate distant peers may share secret keys even when the information carriers are not traveled in the quantum channel. We find that this protocol is equivalent to an entanglement distillation protocol. According to this equivalence, a strict security proof and the asymptotic key bit rate are both obtained when a perfect single-photon source is applied and a Trojan horse attack can be detected. We also find that the security of this scheme is strongly related to not only the bit error rate but also the yields of photons. And our security proof may shed light on the security of other two-way protocols.

Security of counterfactual quantum cryptography

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yin Zhenqiang; Li Hongwei; Chen Wei

2010-10-15

Recently, a 'counterfactual' quantum-key-distribution scheme was proposed by T.-G. Noh [Phys. Rev. Lett. 103, 230501 (2009)]. In this scheme, two legitimate distant peers may share secret keys even when the information carriers are not traveled in the quantum channel. We find that this protocol is equivalent to an entanglement distillation protocol. According to this equivalence, a strict security proof and the asymptotic key bit rate are both obtained when a perfect single-photon source is applied and a Trojan horse attack can be detected. We also find that the security of this scheme is strongly related to not only the bitmore » error rate but also the yields of photons. And our security proof may shed light on the security of other two-way protocols.« less

Delay and cost performance analysis of the diffie-hellman key exchange protocol in opportunistic mobile networks

NASA Astrophysics Data System (ADS)

Soelistijanto, B.; Muliadi, V.

2018-03-01

Diffie-Hellman (DH) provides an efficient key exchange system by reducing the number of cryptographic keys distributed in the network. In this method, a node broadcasts a single public key to all nodes in the network, and in turn each peer uses this key to establish a shared secret key which then can be utilized to encrypt and decrypt traffic between the peer and the given node. In this paper, we evaluate the key transfer delay and cost performance of DH in opportunistic mobile networks, a specific scenario of MANETs where complete end-to-end paths rarely exist between sources and destinations; consequently, the end-to-end delays in these networks are much greater than typical MANETs. Simulation results, driven by a random node movement model and real human mobility traces, showed that DH outperforms a typical key distribution scheme based on the RSA algorithm in terms of key transfer delay, measured by average key convergence time; however, DH performs as well as the benchmark in terms of key transfer cost, evaluated by total key (copies) forwards.

Authentication Without Secrets

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pierson, Lyndon G.; Robertson, Perry J.

This work examines a new approach to authentication, which is the most fundamental security primitive that underpins all cyber security protections. Current Internet authentication techniques require the protection of one or more secret keys along with the integrity protection of the algorithms/computations designed to prove possession of the secret without actually revealing it. Protecting a secret requires physical barriers or encryption with yet another secret key. The reason to strive for "Authentication without Secret Keys" is that protecting secrets (even small ones only kept in a small corner of a component or device) is much harder than protecting the integritymore » of information that is not secret. Promising methods are examined for authentication of components, data, programs, network transactions, and/or individuals. The successful development of authentication without secret keys will enable far more tractable system security engineering for high exposure, high consequence systems by eliminating the need for brittle protection mechanisms to protect secret keys (such as are now protected in smart cards, etc.). This paper is a re-release of SAND2009-7032 with new figures numerous edits.« less

Secret-key expansion from covert communication

NASA Astrophysics Data System (ADS)

Arrazola, Juan Miguel; Amiri, Ryan

2018-02-01

Covert communication allows the transmission of messages in such a way that it is not possible for adversaries to detect that the communication is occurring. This provides protection in situations where knowledge that two parties are talking to each other may be incriminating to them. In this work, we study how covert communication can be used for a different purpose: secret key expansion. First, we show that any message transmitted in a secure covert protocol is also secret and therefore unknown to an adversary. We then propose a covert communication protocol where the amount of key consumed in the protocol is smaller than the transmitted key, thus leading to secure secret key expansion. We derive precise conditions for secret key expansion to occur, showing that it is possible when there are sufficiently low levels of noise for a given security level. We conclude by examining how secret key expansion from covert communication can be performed in a computational security model.

Quantum secret sharing via local operations and classical communication

PubMed Central

Yang, Ying-Hui; Gao, Fei; Wu, Xia; Qin, Su-Juan; Zuo, Hui-Juan; Wen, Qiao-Yan

2015-01-01

We investigate the distinguishability of orthogonal multipartite entangled states in d-qudit system by restricted local operations and classical communication. According to these properties, we propose a standard (2, n)-threshold quantum secret sharing scheme (called LOCC-QSS scheme), which solves the open question in [Rahaman et al., Phys. Rev. A, 91, 022330 (2015)]. On the other hand, we find that all the existing (k, n)-threshold LOCC-QSS schemes are imperfect (or “ramp”), i.e., unauthorized groups can obtain some information about the shared secret. Furthermore, we present a (3, 4)-threshold LOCC-QSS scheme which is close to perfect. PMID:26586412

Secure data sharing in public cloud

NASA Astrophysics Data System (ADS)

Venkataramana, Kanaparti; Naveen Kumar, R.; Tatekalva, Sandhya; Padmavathamma, M.

2012-04-01

Secure multi-party protocols have been proposed for entities (organizations or individuals) that don't fully trust each other to share sensitive information. Many types of entities need to collect, analyze, and disseminate data rapidly and accurately, without exposing sensitive information to unauthorized or untrusted parties. Solutions based on secure multiparty computation guarantee privacy and correctness, at an extra communication (too costly in communication to be practical) and computation cost. The high overhead motivates us to extend this SMC to cloud environment which provides large computation and communication capacity which makes SMC to be used between multiple clouds (i.e., it may between private or public or hybrid clouds).Cloud may encompass many high capacity servers which acts as a hosts which participate in computation (IaaS and PaaS) for final result, which is controlled by Cloud Trusted Authority (CTA) for secret sharing within the cloud. The communication between two clouds is controlled by High Level Trusted Authority (HLTA) which is one of the hosts in a cloud which provides MgaaS (Management as a Service). Due to high risk for security in clouds, HLTA generates and distributes public keys and private keys by using Carmichael-R-Prime- RSA algorithm for exchange of private data in SMC between itself and clouds. In cloud, CTA creates Group key for Secure communication between the hosts in cloud based on keys sent by HLTA for exchange of Intermediate values and shares for computation of final result. Since this scheme is extended to be used in clouds( due to high availability and scalability to increase computation power) it is possible to implement SMC practically for privacy preserving in data mining at low cost for the clients.

Counterfactual quantum cryptography based on weak coherent states

NASA Astrophysics Data System (ADS)

Yin, Zhen-Qiang; Li, Hong-Wei; Yao, Yao; Zhang, Chun-Mei; Wang, Shuang; Chen, Wei; Guo, Guang-Can; Han, Zheng-Fu

2012-08-01

In the “counterfactual quantum cryptography” scheme [T.-G. Noh, Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.103.230501 103, 230501 (2009)], two legitimate distant peers may share secret-key bits even when the information carriers do not travel in the quantum channel. The security of this protocol with an ideal single-photon source has been proved by Yin [Z.-Q. Yin, H. W. Li, W. Chen, Z. F. Han, and G. C. Guo, Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.82.042335 82, 042335 (2010)]. In this paper, we prove the security of the counterfactual-quantum-cryptography scheme based on a commonly used weak-coherent-laser source by considering a general collective attack. The basic assumption of this proof is that the efficiency and dark-counting rate of a single-photon detector are consistent for any n-photon Fock states. Then through randomizing the phases of the encoding weak coherent states, Eve's ancilla will be transformed into a classical mixture. Finally, the lower bound of the secret-key-bit rate and a performance analysis for the practical implementation are both given.

Teleportation-based continuous variable quantum cryptography

NASA Astrophysics Data System (ADS)

Luiz, F. S.; Rigolin, Gustavo

2017-03-01

We present a continuous variable (CV) quantum key distribution (QKD) scheme based on the CV quantum teleportation of coherent states that yields a raw secret key made up of discrete variables for both Alice and Bob. This protocol preserves the efficient detection schemes of current CV technology (no single-photon detection techniques) and, at the same time, has efficient error correction and privacy amplification schemes due to the binary modulation of the key. We show that for a certain type of incoherent attack, it is secure for almost any value of the transmittance of the optical line used by Alice to share entangled two-mode squeezed states with Bob (no 3 dB or 50% loss limitation characteristic of beam splitting attacks). The present CVQKD protocol works deterministically (no postselection needed) with efficient direct reconciliation techniques (no reverse reconciliation) in order to generate a secure key and beyond the 50% loss case at the incoherent attack level.

Long-distance quantum key distribution with imperfect devices

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lo Piparo, Nicoló; Razavi, Mohsen

2014-12-04

Quantum key distribution over probabilistic quantum repeaters is addressed. We compare, under practical assumptions, two such schemes in terms of their secure key generation rate per memory, R{sub QKD}. The two schemes under investigation are the one proposed by Duan et al. in [Nat. 414, 413 (2001)] and that of Sangouard et al. proposed in [Phys. Rev. A 76, 050301 (2007)]. We consider various sources of imperfections in the latter protocol, such as a nonzero double-photon probability for the source, dark count per pulse, channel loss and inefficiencies in photodetectors and memories, to find the rate for different nesting levels.more » We determine the maximum value of the double-photon probability beyond which it is not possible to share a secret key anymore. We find the crossover distance for up to three nesting levels. We finally compare the two protocols.« less

[Encryption technique for linkable anonymizing].

PubMed

Okamoto, Etsuji

2004-06-01

Linkage of different records such as health insurance claims or medical records for the purpose of cohort studies or cancer registration usually requires matching with personal names and other personally identifiable data. The present study was conducted to examine the possibility of performing such privacy-sensitive procedures in a "linkable anonymizing" manner using encryption. While bidirectional communication entails encryption and deciphering, necessitating both senders and receivers sharing a common secret "key", record linkage entails only encryption and not deciphering because researchers do not need to know the identity of the linked person. This unidirectional nature relieves researchers from the historical problem of "key sharing" and enables data holders such as municipal governments and insurers to encrypt personal names in a relatively easy manner. The author demonstrates an encryption technique using readily available spread-sheet software, Microsoft Excel in a step-by-step fashion. Encoding Chinese characters into the numeric JIS codes and replacing the codes with a randomly assigned case-sensitive alphabet, all names of Japanese nationals will be encrypted into gibberish strings of alphabet, which can not be deciphered without the secret key. Data holders are able to release personal data without sacrificing privacy, even when accidental leakage occurs and researchers are still able to link records of the same name because encrypted texts, although gibberish, are unique to each name. Such a technical assurance of privacy protection is expected to satisfy the Privacy Protection Act or the Ethical Guidelines for Epidemiological Research and enhance public health research. Traditional encryption techniques, however, cannot be applied to cancer or stroke registration, because the registrar receives reports from numerous unspecified senders. The new public key encryption technique will enable disease registry in a linkable anonymizing manner. However various technical problems such as complexity, difficulties in registrar inquiries and risk of code-breaking make the encryption technique unsuitable for disease registry in the foreseeable future.

Convergence of the Insulin and Serotonin Programs in the Pancreatic β-Cell

PubMed Central

Ohta, Yasuharu; Kosaka, Yasuhiro; Kishimoto, Nina; Wang, Juehu; Smith, Stuart B.; Honig, Gerard; Kim, Hail; Gasa, Rosa M.; Neubauer, Nicole; Liou, Angela; Tecott, Laurence H.; Deneris, Evan S.; German, Michael S.

2011-01-01

OBJECTIVE Despite their origins in different germ layers, pancreatic islet cells share many common developmental features with neurons, especially serotonin-producing neurons in the hindbrain. Therefore, we tested whether these developmental parallels have functional consequences. RESEARCH DESIGN AND METHODS We used transcriptional profiling, immunohistochemistry, DNA-binding analyses, and mouse genetic models to assess the expression and function of key serotonergic genes in the pancreas. RESULTS We found that islet cells expressed the genes encoding all of the products necessary for synthesizing, packaging, and secreting serotonin, including both isoforms of the serotonin synthetic enzyme tryptophan hydroxylase and the archetypal serotonergic transcription factor Pet1. As in serotonergic neurons, Pet1 expression in islets required homeodomain transcription factor Nkx2.2 but not Nkx6.1. In β-cells, Pet1 bound to the serotonergic genes but also to a conserved insulin gene regulatory element. Mice lacking Pet1 displayed reduced insulin production and secretion and impaired glucose tolerance. CONCLUSIONS These studies demonstrate that a common transcriptional cascade drives the differentiation of β-cells and serotonergic neurons and imparts the shared ability to produce serotonin. The interrelated biology of these two cell types has important implications for the pathology and treatment of diabetes. PMID:22013016

Convergence of the insulin and serotonin programs in the pancreatic β-cell.

PubMed

Ohta, Yasuharu; Kosaka, Yasuhiro; Kishimoto, Nina; Wang, Juehu; Smith, Stuart B; Honig, Gerard; Kim, Hail; Gasa, Rosa M; Neubauer, Nicole; Liou, Angela; Tecott, Laurence H; Deneris, Evan S; German, Michael S

2011-12-01

Despite their origins in different germ layers, pancreatic islet cells share many common developmental features with neurons, especially serotonin-producing neurons in the hindbrain. Therefore, we tested whether these developmental parallels have functional consequences. We used transcriptional profiling, immunohistochemistry, DNA-binding analyses, and mouse genetic models to assess the expression and function of key serotonergic genes in the pancreas. We found that islet cells expressed the genes encoding all of the products necessary for synthesizing, packaging, and secreting serotonin, including both isoforms of the serotonin synthetic enzyme tryptophan hydroxylase and the archetypal serotonergic transcription factor Pet1. As in serotonergic neurons, Pet1 expression in islets required homeodomain transcription factor Nkx2.2 but not Nkx6.1. In β-cells, Pet1 bound to the serotonergic genes but also to a conserved insulin gene regulatory element. Mice lacking Pet1 displayed reduced insulin production and secretion and impaired glucose tolerance. These studies demonstrate that a common transcriptional cascade drives the differentiation of β-cells and serotonergic neurons and imparts the shared ability to produce serotonin. The interrelated biology of these two cell types has important implications for the pathology and treatment of diabetes.

A special attack on the multiparty quantum secret sharing of secure direct communication using single photons

NASA Astrophysics Data System (ADS)

Qin, Su-Juan; Gao, Fei; Wen, Qiao-Yan; Zhu, Fu-Chen

2008-11-01

The security of a multiparty quantum secret sharing protocol [L.F. Han, Y.M. Liu, J. Liu, Z.J. Zhang, Opt. Commun. 281 (2008) 2690] is reexamined. It is shown that any one dishonest participant can obtain all the transmitted secret bits by a special attack, where the controlled- (-iσy) gate is employed to invalidate the role of the random phase shift operation. Furthermore, a possible way to resist this attack is discussed.

Stability assessment of QKD procedures in commercial quantum cryptography systems versus quality of dark channel

NASA Astrophysics Data System (ADS)

Jacak, Monika; Melniczuk, Damian; Jacak, Janusz; Jóźwiak, Ireneusz; Gruber, Jacek; Jóźwiak, Piotr

2015-02-01

In order to assess the susceptibility of the quantum key distribution (QKD) systems to the hacking attack including simultaneous and frequent system self-decalibrations, we analyze the stability of the QKD transmission organized in two commercially available systems. The first one employs non-entangled photons as flying qubits in the dark quantum channel for communication whereas the second one utilizes the entangled photon pairs to secretly share the cryptographic key. Applying standard methods of the statistical data analysis to the characteristic indicators of the quality of the QKD communication (the raw key exchange rate [RKER] and the quantum bit error rate [QBER]), we have estimated the pace of the self-decalibration of both systems and the repeatability rate in the case of controlled worsening of the dark channel quality.

Measurement-device-independent semiquantum key distribution

NASA Astrophysics Data System (ADS)

He, Jinjun; Li, Qin; Wu, Chunhui; Chan, Wai Hong; Zhang, Shengyu

Semiquantum key distribution (SQKD) allows two parties to share a common string when one of them is quantum and the other has rather limited quantum capability. Almost all existing SQKD protocols have been proved to be robust in theory, namely that if an eavesdropper tries to gain information, he will inevitably induce some detectable errors. However, ideal devices do not exist in reality and their imperfection may result in side-channel attacks, which can be used by an adversary to get some information on the secret key string. In this paper, we design a measurement-device-independent SQKD protocol for the first time, which can remove the threat of all detector side-channel attacks and show that it is also robust. In addition, we discuss the possible use of the proposed protocol in real-world applications and in QKD networks.

Secure password-based authenticated key exchange for web services

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liang, Fang; Meder, Samuel; Chevassut, Olivier

This paper discusses an implementation of an authenticated key-exchange method rendered on message primitives defined in the WS-Trust and WS-SecureConversation specifications. This IEEE-specified cryptographic method (AuthA) is proven-secure for password-based authentication and key exchange, while the WS-Trust and WS-Secure Conversation are emerging Web Services Security specifications that extend the WS-Security specification. A prototype of the presented protocol is integrated in the WSRF-compliant Globus Toolkit V4. Further hardening of the implementation is expected to result in a version that will be shipped with future Globus Toolkit releases. This could help to address the current unavailability of decent shared-secret-based authentication options inmore » the Web Services and Grid world. Future work will be to integrate One-Time-Password (OTP) features in the authentication protocol.« less

Quantum secret sharing using the d-dimensional GHZ state

NASA Astrophysics Data System (ADS)

Bai, Chen-Ming; Li, Zhi-Hui; Xu, Ting-Ting; Li, Yong-Ming

2017-03-01

We propose a quantum secret sharing scheme that uses an orthogonal pair of n-qudit GHZ states and local distinguishability. In the proposed protocol, the participants use an X-basis measurement and classical communication to distinguish between the two orthogonal states and reconstruct the original secret. We also present (2, n)-threshold and generalized restricted (2, n)-threshold schemes that enable any two cooperating players from two disjoint groups to always reconstruct the secret. Compared to the existing scheme by Rahaman and Parker (Phys Rev A 91:022330, 2015), the proposed scheme is more general and the access structure contains more authorized sets.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Juhui; School of Computatioal Sciences, Korea Institute for Advanced Study, Seoul 130-722; Lee, Soojoon

Extending the eavesdropping strategy devised by Zhang, Li, and Guo [Zhang, Li, and Guo, Phys. Rev. A 63, 036301 (2001)], we show that the multiparty quantum communication protocol based on entanglement swapping, which was proposed by Cabello (e-print quant-ph/0009025), is not secure. We modify the protocol so that entanglement swapping can secure multiparty quantum communication, such as multiparty quantum key distribution and quantum secret sharing of classical information, and show that the modified protocol is secure against the Zhang-Li-Guo strategy for eavesdropping as well as the basic intercept-resend attack.0.

Counterfactual quantum cryptography network with untrusted relay

NASA Astrophysics Data System (ADS)

Chen, Yuanyuan; Gu, Xuemei; Jiang, Dong; Xie, Ling; Chen, Lijun

2015-07-01

Counterfactual quantum cryptography allows two remote parties to share a secret key even though a physical particle is not in fact transmitted through the quantum channel. In order to extend the scope of counterfactual quantum cryptography, we use an untrusted relay to construct a multi-user network. The implementation issues are discussed to show that the scheme can be realized with current technologies. We also prove the practical security advantages of the scheme by eliminating the probability that an eavesdropper can directly access the signal or an untrusted relay can perform false operations.

Navajo Code Talker Joe Morris, Sr. shared insights from his time as a secret World War Two messenger

NASA Technical Reports Server (NTRS)

2002-01-01

Navajo Code Talker Joe Morris, Sr. shared insights from his time as a secret World War Two messenger with his audience at NASA's Dryden Flight Research Center on Nov. 26, 2002. NASA Dryden is located on Edwards Air Force Base in California's Mojave Desert.

Overcoming the rate-distance limit of quantum key distribution without quantum repeaters.

PubMed

Lucamarini, M; Yuan, Z L; Dynes, J F; Shields, A J

2018-05-01

Quantum key distribution (QKD) 1,2 allows two distant parties to share encryption keys with security based on physical laws. Experimentally, QKD has been implemented via optical means, achieving key rates of 1.26 megabits per second over 50 kilometres of standard optical fibre 3 and of 1.16 bits per hour over 404 kilometres of ultralow-loss fibre in a measurement-device-independent configuration 4 . Increasing the bit rate and range of QKD is a formidable, but important, challenge. A related target, which is currently considered to be unfeasible without quantum repeaters 5-7 , is overcoming the fundamental rate-distance limit of QKD 8 . This limit defines the maximum possible secret key rate that two parties can distil at a given distance using QKD and is quantified by the secret-key capacity of the quantum channel 9 that connects the parties. Here we introduce an alternative scheme for QKD whereby pairs of phase-randomized optical fields are first generated at two distant locations and then combined at a central measuring station. Fields imparted with the same random phase are 'twins' and can be used to distil a quantum key. The key rate of this twin-field QKD exhibits the same dependence on distance as does a quantum repeater, scaling with the square-root of the channel transmittance, irrespective of who (malicious or otherwise) is in control of the measuring station. However, unlike schemes that involve quantum repeaters, ours is feasible with current technology and presents manageable levels of noise even on 550 kilometres of standard optical fibre. This scheme is a promising step towards overcoming the rate-distance limit of QKD and greatly extending the range of secure quantum communications.

The physical boundaries of public goods cooperation between surface-attached bacterial cells

PubMed Central

Weigert, Michael; Kümmerli, Rolf

2017-01-01

Bacteria secrete a variety of compounds important for nutrient scavenging, competition mediation and infection establishment. While there is a general consensus that secreted compounds can be shared and therefore have social consequences for the bacterial collective, we know little about the physical limits of such bacterial social interactions. Here, we address this issue by studying the sharing of iron-scavenging siderophores between surface-attached microcolonies of the bacterium Pseudomonas aeruginosa. Using single-cell fluorescent microscopy, we show that siderophores, secreted by producers, quickly reach non-producers within a range of 100 µm, and significantly boost their fitness. Producers in turn respond to variation in sharing efficiency by adjusting their pyoverdine investment levels. These social effects wane with larger cell-to-cell distances and on hard surfaces. Thus, our findings reveal the boundaries of compound sharing, and show that sharing is particularly relevant between nearby yet physically separated bacteria on soft surfaces, matching realistic natural conditions such as those encountered in soft tissue infections. PMID:28701557

In sílico identification and characterization of putative Dot/Icm secreted virulence effectors in the fish pathogen Piscirickettsia salmonis.

PubMed

Labra, Álvaro; Arredondo-Zelada, Oscar; Flores-Herrera, Patricio; Marshall, Sergio H; Gómez, Fernando A

2016-03-01

Piscirickettsia salmonis seriously affects the Chilean salmon industry. The bacterium is phylogenetically related to Legionella pneumophila and Coxiella burnetii, sharing a Dot/Icm secretion system with them. Although it is well documented that L. pneumophila and C. burnetii secrete different virulence effectors via this Dot/Icm system in order to attenuate host cell responses, to date there have been no reported virulence effectors secreted by the Dot/Icm system of P. salmonis. Using several annotations of P. salmonis genome, here we report an in silico analyses of 4 putative Dot/Icm effectors. Three of them contain ankyrin repeat domains and the typical conserved 3D structures of this protein family. The fourth one is highly similar to one of the Dot/Icm-dependent effectors of L. pneumophila. Additionally, all the potential P. salmonis effectors contain a classical Dot/Icm secretion signal in their C-terminus, consisting of: an E-Block, a hydrophobic residue in -3 or -4 and an electronegative charge. Finally, qPCR analysis demonstrated that these proteins are overexpressed early in infection, perhaps contributing to the generation of a replicative vacuole, a key step in the neutralizing strategy proposed for the Dot/Icm system. In summary, this report identifies four Dot/Icm-dependent effectors in P. salmonis. Copyright © 2015 Elsevier Ltd. All rights reserved.

Quantum steganography and quantum error-correction

NASA Astrophysics Data System (ADS)

Shaw, Bilal A.

Quantum error-correcting codes have been the cornerstone of research in quantum information science (QIS) for more than a decade. Without their conception, quantum computers would be a footnote in the history of science. When researchers embraced the idea that we live in a world where the effects of a noisy environment cannot completely be stripped away from the operations of a quantum computer, the natural way forward was to think about importing classical coding theory into the quantum arena to give birth to quantum error-correcting codes which could help in mitigating the debilitating effects of decoherence on quantum data. We first talk about the six-qubit quantum error-correcting code and show its connections to entanglement-assisted error-correcting coding theory and then to subsystem codes. This code bridges the gap between the five-qubit (perfect) and Steane codes. We discuss two methods to encode one qubit into six physical qubits. Each of the two examples corrects an arbitrary single-qubit error. The first example is a degenerate six-qubit quantum error-correcting code. We explicitly provide the stabilizer generators, encoding circuits, codewords, logical Pauli operators, and logical CNOT operator for this code. We also show how to convert this code into a non-trivial subsystem code that saturates the subsystem Singleton bound. We then prove that a six-qubit code without entanglement assistance cannot simultaneously possess a Calderbank-Shor-Steane (CSS) stabilizer and correct an arbitrary single-qubit error. A corollary of this result is that the Steane seven-qubit code is the smallest single-error correcting CSS code. Our second example is the construction of a non-degenerate six-qubit CSS entanglement-assisted code. This code uses one bit of entanglement (an ebit) shared between the sender (Alice) and the receiver (Bob) and corrects an arbitrary single-qubit error. The code we obtain is globally equivalent to the Steane seven-qubit code and thus corrects an arbitrary error on the receiver's half of the ebit as well. We prove that this code is the smallest code with a CSS structure that uses only one ebit and corrects an arbitrary single-qubit error on the sender's side. We discuss the advantages and disadvantages for each of the two codes. In the second half of this thesis we explore the yet uncharted and relatively undiscovered area of quantum steganography. Steganography is the process of hiding secret information by embedding it in an "innocent" message. We present protocols for hiding quantum information in a codeword of a quantum error-correcting code passing through a channel. Using either a shared classical secret key or shared entanglement Alice disguises her information as errors in the channel. Bob can retrieve the hidden information, but an eavesdropper (Eve) with the power to monitor the channel, but without the secret key, cannot distinguish the message from channel noise. We analyze how difficult it is for Eve to detect the presence of secret messages, and estimate rates of steganographic communication and secret key consumption for certain protocols. We also provide an example of how Alice hides quantum information in the perfect code when the underlying channel between Bob and her is the depolarizing channel. Using this scheme Alice can hide up to four stego-qubits.

Secret Forwarding of Events over Distributed Publish/Subscribe Overlay Network.

PubMed

Yoon, Young; Kim, Beom Heyn

2016-01-01

Publish/subscribe is a communication paradigm where loosely-coupled clients communicate in an asynchronous fashion. Publish/subscribe supports the flexible development of large-scale, event-driven and ubiquitous systems. Publish/subscribe is prevalent in a number of application domains such as social networking, distributed business processes and real-time mission-critical systems. Many publish/subscribe applications are sensitive to message loss and violation of privacy. To overcome such issues, we propose a novel method of using secret sharing and replication techniques. This is to reliably and confidentially deliver decryption keys along with encrypted publications even under the presence of several Byzantine brokers across publish/subscribe overlay networks. We also propose a framework for dynamically and strategically allocating broker replicas based on flexibly definable criteria for reliability and performance. Moreover, a thorough evaluation is done through a case study on social networks using the real trace of interactions among Facebook users.

Secret Forwarding of Events over Distributed Publish/Subscribe Overlay Network

PubMed Central

Kim, Beom Heyn

2016-01-01

Publish/subscribe is a communication paradigm where loosely-coupled clients communicate in an asynchronous fashion. Publish/subscribe supports the flexible development of large-scale, event-driven and ubiquitous systems. Publish/subscribe is prevalent in a number of application domains such as social networking, distributed business processes and real-time mission-critical systems. Many publish/subscribe applications are sensitive to message loss and violation of privacy. To overcome such issues, we propose a novel method of using secret sharing and replication techniques. This is to reliably and confidentially deliver decryption keys along with encrypted publications even under the presence of several Byzantine brokers across publish/subscribe overlay networks. We also propose a framework for dynamically and strategically allocating broker replicas based on flexibly definable criteria for reliability and performance. Moreover, a thorough evaluation is done through a case study on social networks using the real trace of interactions among Facebook users. PMID:27367610

Verifying Secrets and Relative Secrecy

DTIC Science & Technology

2000-01-01

Systems that authenticate a user based on a shared secret (such as a password or PIN) normally allow anyone to query whether the secret is a given...value. For example, an ATM machine allows one to ask whether a string is the secret PIN of a (lost or stolen) ATM card. Yet such queries are prohibited

Navajo Code Talker Joe Morris, Sr. shared insights from his time as a secret World War Two messenger with his audience at NASA's Dryden Flight Research Center

NASA Image and Video Library

2002-11-26

Navajo Code Talker Joe Morris, Sr. shared insights from his time as a secret World War Two messenger with his audience at NASA's Dryden Flight Research Center on Nov. 26, 2002. NASA Dryden is located on Edwards Air Force Base in California's Mojave Desert.

Information trade-offs for optical quantum communication.

PubMed

Wilde, Mark M; Hayden, Patrick; Guha, Saikat

2012-04-06

Recent work has precisely characterized the achievable trade-offs between three key information processing tasks-classical communication (generation or consumption), quantum communication (generation or consumption), and shared entanglement (distribution or consumption), measured in bits, qubits, and ebits per channel use, respectively. Slices and corner points of this three-dimensional region reduce to well-known protocols for quantum channels. A trade-off coding technique can attain any point in the region and can outperform time sharing between the best-known protocols for accomplishing each information processing task by itself. Previously, the benefits of trade-off coding that had been found were too small to be of practical value (viz., for the dephasing and the universal cloning machine channels). In this Letter, we demonstrate that the associated performance gains are in fact remarkably high for several physically relevant bosonic channels that model free-space or fiber-optic links, thermal-noise channels, and amplifiers. We show that significant performance gains from trade-off coding also apply when trading photon-number resources between transmitting public and private classical information simultaneously over secret-key-assisted bosonic channels. © 2012 American Physical Society

Experimental measurement-device-independent quantum key distribution with uncharacterized encoding.

PubMed

Wang, Chao; Wang, Shuang; Yin, Zhen-Qiang; Chen, Wei; Li, Hong-Wei; Zhang, Chun-Mei; Ding, Yu-Yang; Guo, Guang-Can; Han, Zheng-Fu

2016-12-01

Measurement-device-independent quantum key distribution (MDI QKD) is an efficient way to share secrets using untrusted measurement devices. However, the assumption on the characterizations of encoding states is still necessary in this promising protocol, which may lead to unnecessary complexity and potential loopholes in realistic implementations. Here, by using the mismatched-basis statistics, we present the first proof-of-principle experiment of MDI QKD with uncharacterized encoding sources. In this demonstration, the encoded states are only required to be constrained in a two-dimensional Hilbert space, and two distant parties (Alice and Bob) are resistant to state preparation flaws even if they have no idea about the detailed information of their encoding states. The positive final secure key rates of our system exhibit the feasibility of this novel protocol, and demonstrate its value for the application of secure communication with uncharacterized devices.

Measurement-Device-Independent Quantum Cryptography

NASA Astrophysics Data System (ADS)

Tang, Zhiyuan

Quantum key distribution (QKD) enables two legitimate parties to share a secret key even in the presence of an eavesdropper. The unconditional security of QKD is based on the fundamental laws of quantum physics. Original security proofs of QKD are based on a few assumptions, e.g., perfect single photon sources and perfect single-photon detectors. However, practical implementations of QKD systems do not fully comply with such assumptions due to technical limitations. The gap between theory and implementations leads to security loopholes in most QKD systems, and several attacks have been launched on sophisticated QKD systems. Particularly, the detectors have been found to be the most vulnerable part of QKD. Much effort has been put to build side-channel-free QKD systems. Solutions such as security patches and device-independent QKD have been proposed. However, the former are normally ad-hoc, and cannot close unidentified loopholes. The latter, while having the advantages of removing all assumptions on devices, is impractical to implement today. Measurement-device-independent QKD (MDI-QKD) turns out to be a promising solution to the security problem of QKD. In MDI-QKD, all security loopholes, including those yet-to-be discovered, have been removed from the detectors, the most critical part in QKD. In this thesis, we investigate issues related to the practical implementation and security of MDI-QKD. We first present a demonstration of polarization-encoding MDI-QKD. Taking finite key effect into account, we achieve a secret key rate of 0.005 bit per second (bps) over 10 km spooled telecom fiber, and a 1600-bit key is distributed. This work, together with other demonstrations, shows the practicality of MDI-QKD. Next we investigate a critical assumption of MDI-QKD: perfect state preparation. We apply the loss-tolerant QKD protocol and adapt it to MDI-QKD to quantify information leakage due to imperfect state preparation. We then present an experimental demonstration of MDI-QKD over 10 km and 40 km of spooled fiber, which for the first time considers the impact of inaccurate polarization state preparation on the secret key rate. This would not have been possible under previous security proofs, given the same amount of state preparation flaws.

Three-step semiquantum secure direct communication protocol

NASA Astrophysics Data System (ADS)

Zou, XiangFu; Qiu, DaoWen

2014-09-01

Quantum secure direct communication is the direct communication of secret messages without need for establishing a shared secret key first. In the existing schemes, quantum secure direct communication is possible only when both parties are quantum. In this paper, we construct a three-step semiquantum secure direct communication (SQSDC) protocol based on single photon sources in which the sender Alice is classical. In a semiquantum protocol, a person is termed classical if he (she) can measure, prepare and send quantum states only with the fixed orthogonal quantum basis {|0>, |1>}. The security of the proposed SQSDC protocol is guaranteed by the complete robustness of semiquantum key distribution protocols and the unconditional security of classical one-time pad encryption. Therefore, the proposed SQSDC protocol is also completely robust. Complete robustness indicates that nonzero information acquired by an eavesdropper Eve on the secret message implies the nonzero probability that the legitimate participants can find errors on the bits tested by this protocol. In the proposed protocol, we suggest a method to check Eves disturbing in the doves returning phase such that Alice does not need to announce publicly any position or their coded bits value after the photons transmission is completed. Moreover, the proposed SQSDC protocol can be implemented with the existing techniques. Compared with many quantum secure direct communication protocols, the proposed SQSDC protocol has two merits: firstly the sender only needs classical capabilities; secondly to check Eves disturbing after the transmission of quantum states, no additional classical information is needed.

Quantum key distribution with an efficient countermeasure against correlated intensity fluctuations in optical pulses

NASA Astrophysics Data System (ADS)

Yoshino, Ken-ichiro; Fujiwara, Mikio; Nakata, Kensuke; Sumiya, Tatsuya; Sasaki, Toshihiko; Takeoka, Masahiro; Sasaki, Masahide; Tajima, Akio; Koashi, Masato; Tomita, Akihisa

2018-03-01

Quantum key distribution (QKD) allows two distant parties to share secret keys with the proven security even in the presence of an eavesdropper with unbounded computational power. Recently, GHz-clock decoy QKD systems have been realized by employing ultrafast optical communication devices. However, security loopholes of high-speed systems have not been fully explored yet. Here we point out a security loophole at the transmitter of the GHz-clock QKD, which is a common problem in high-speed QKD systems using practical band-width limited devices. We experimentally observe the inter-pulse intensity correlation and modulation pattern-dependent intensity deviation in a practical high-speed QKD system. Such correlation violates the assumption of most security theories. We also provide its countermeasure which does not require significant changes of hardware and can generate keys secure over 100 km fiber transmission. Our countermeasure is simple, effective and applicable to wide range of high-speed QKD systems, and thus paves the way to realize ultrafast and security-certified commercial QKD systems.

Reply to ``Comment II on `Quantum secret sharing based on reusable Greenberger-Horne-Zeilinger states as secure carriers' ''

NASA Astrophysics Data System (ADS)

Karimipour, V.

2006-07-01

In the preceding Comment [Jian-Zhong Du, Su-Juan Qin, Qiao-Yan Wen, and Fu-Chen Zhu, Phys. Rev. A 74, 016301 (2006)], it has been shown that in a quantum secret sharing protocol proposed in [S. Bagherinezhad and V. Karimipour, Phys. Rev. A 67, 044302 (2003)], one of the receivers can cheat by splitting the entanglement of the carrier and intercepting the secret, without being detected. In this reply we show that a simple modification of the protocol prevents the receivers from this kind of cheating.

Revisiting Deng et al.'s Multiparty Quantum Secret Sharing Protocol

NASA Astrophysics Data System (ADS)

Hwang, Tzonelih; Hwang, Cheng-Chieh; Yang, Chun-Wei; Li, Chuan-Ming

2011-09-01

The multiparty quantum secret sharing protocol [Deng et al. in Chin. Phys. Lett. 23: 1084-1087, 2006] is revisited in this study. It is found that the performance of Deng et al.'s protocol can be much improved by using the techniques of block-transmission and decoy single photons. As a result, the qubit efficiency is improved 2.4 times and only one classical communication, a public discussion, and two quantum communications between each agent and the secret holder are needed rather than n classical communications, n public discussions, and 3n/2 quantum communications required in the original scheme.

Cryptanalysis of Controlled Mutual Quantum Entity Authentication Using Entanglement Swapping

NASA Astrophysics Data System (ADS)

Gao, Gan; Wang, Yue

2017-01-01

By using GHZ-like states and entanglement swapping, Kang et al. [Chin. Phys. B 24 (2015) 090306] proposed a controlled mutual quantum entity authentication protocol. We find that the proposed protocol is not secure, that is, the center, Charlie can eavesdrop the secret keys shared between Alice and Bob without being detected. Supported by the 2014-year Program for Excellent Youth Talents in University of Anhui Province and the Talent Scientific Research Fundation of Tongling University under Grant No. 2015tlxyrc01 and the Program for Academic Leader Reserve Candidates in Tongling University under Grant No. 2014tlxyxs30

Floral and vegetative cues in oil-secreting and non-oil-secreting Lysimachia species

PubMed Central

Schäffler, I.; Balao, F.; Dötterl, S.

2012-01-01

Background and Aims Unrelated plants pollinated by the same group or guild of animals typically evolve similar floral cues due to pollinator-mediated selection. Related plant species, however, may possess similar cues either as a result of pollinator-mediated selection or as a result of sharing a common ancestor that possessed the same cues or traits. In this study, visual and olfactory floral cues in Lysimachia species exhibiting different pollination strategies were analysed and compared, and the importance of pollinators and phylogeny on the evolution of these floral cues was determined. For comparison, cues of vegetative material were examined where pollinator selection would not be expected. Methods Floral and vegetative scents and colours in floral oil- and non-floral oil-secreting Lysimachia species were studied by chemical and spectrophotometric analyses, respectively, compared between oil- and non-oil-secreting species, and analysed by phylogenetically controlled methods. Key Results Vegetative and floral scent was species specific, and variability in floral but not vegetative scent was lower in oil compared with non-oil species. Overall, oil species did not differ in their floral or vegetative scent from non-oil species. However, a correlation was found between oil secretion and six floral scent constituents specific to oil species, whereas the presence of four other floral compounds can be explained by phylogeny. Four of the five analysed oil species had bee-green flowers and the pattern of occurrence of this colour correlated with oil secretion. Non-oil species had different floral colours. The colour of leaves was similar among all species studied. Conclusions Evidence was found for correlated evolution between secretion of floral oils and floral but not vegetative visual and olfactory cues. The cues correlating with oil secretion were probably selected by Macropis bees, the specialized pollinators of oil-secreting Lysimachia species, and may have evolved in order to attract these bees. PMID:22634256

Compressed Secret Key Agreement:Maximizing Multivariate Mutual Information per Bit

NASA Astrophysics Data System (ADS)

Chan, Chung

2017-10-01

The multiterminal secret key agreement problem by public discussion is formulated with an additional source compression step where, prior to the public discussion phase, users independently compress their private sources to filter out strongly correlated components for generating a common secret key. The objective is to maximize the achievable key rate as a function of the joint entropy of the compressed sources. Since the maximum achievable key rate captures the total amount of information mutual to the compressed sources, an optimal compression scheme essentially maximizes the multivariate mutual information per bit of randomness of the private sources, and can therefore be viewed more generally as a dimension reduction technique. Single-letter lower and upper bounds on the maximum achievable key rate are derived for the general source model, and an explicit polynomial-time computable formula is obtained for the pairwise independent network model. In particular, the converse results and the upper bounds are obtained from those of the related secret key agreement problem with rate-limited discussion. A precise duality is shown for the two-user case with one-way discussion, and such duality is extended to obtain the desired converse results in the multi-user case. In addition to posing new challenges in information processing and dimension reduction, the compressed secret key agreement problem helps shed new light on resolving the difficult problem of secret key agreement with rate-limited discussion, by offering a more structured achieving scheme and some simpler conjectures to prove.

Relating quantum privacy and quantum coherence: an operational approach.

PubMed

Devetak, I; Winter, A

2004-08-20

Given many realizations of a state or a channel as a resource, two parties can generate a secret key as well as entanglement. We describe protocols to perform the secret key distillation (as it turns out, with optimal rate). Then we show how to achieve optimal entanglement generation rates by "coherent" implementation of a class of secret key agreement protocols, proving the long-conjectured "hashing inequality."

Password-only authenticated three-party key exchange with provable security in the standard model.

PubMed

Nam, Junghyun; Choo, Kim-Kwang Raymond; Kim, Junghwan; Kang, Hyun-Kyu; Kim, Jinsoo; Paik, Juryon; Won, Dongho

2014-01-01

Protocols for password-only authenticated key exchange (PAKE) in the three-party setting allow two clients registered with the same authentication server to derive a common secret key from their individual password shared with the server. Existing three-party PAKE protocols were proven secure under the assumption of the existence of random oracles or in a model that does not consider insider attacks. Therefore, these protocols may turn out to be insecure when the random oracle is instantiated with a particular hash function or an insider attack is mounted against the partner client. The contribution of this paper is to present the first three-party PAKE protocol whose security is proven without any idealized assumptions in a model that captures insider attacks. The proof model we use is a variant of the indistinguishability-based model of Bellare, Pointcheval, and Rogaway (2000), which is one of the most widely accepted models for security analysis of password-based key exchange protocols. We demonstrated that our protocol achieves not only the typical indistinguishability-based security of session keys but also the password security against undetectable online dictionary attacks.

Practical Quantum Cryptography for Secure Free-Space Communications

DOE Office of Scientific and Technical Information (OSTI.GOV)

Buttler, W.T.; Hughes, R.J.; Kwiat, P.G.

1999-02-01

Quantum cryptography is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. The security of these transmissions is based on the inviolability of the laws of quantum mechanics and information-theoretically secure post-processing methods. An adversary can neither successfully tap the quantum transmissions, nor evade detection, owing to Heisenberg's uncertainty principle. In this paper we describe the theory of quantum cryptography, and the most recent results from our experimental free-space system with which we have demonstrated for the first time the feasibility of quantum key generation overmore » a point-to-point outdoor atmospheric path in daylight. We achieved a transmission distance of 0.5 km, which was limited only by the length of the test range. Our results provide strong evidence that cryptographic key material could be generated on demand between a ground station and a satellite (or between two satellites), allowing a satellite to be securely re-keyed on orbit. We present a feasibility analysis of surface-to-satellite quantum key generation.« less

FREE-SPACE QUANTUM CRYPTOGRAPHY IN DAYLIGHT

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hughes, R.J.; Buttler, W.T.

2000-01-01

Quantum cryptography is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. The security of these transmissions is based on the inviolability of the laws of quantum mechanics and information-theoretically secure post-processing methods. An adversary can neither successfully tap the quantum transmissions, nor evade detection, owing to Heisenberg's uncertainty principle. In this paper we describe the theory of quantum cryptography, and the most recent results from our experimental free-space system with which we have demonstrated for the first time the feasibility of quantum key generation overmore » a point-to-point outdoor atmospheric path in daylight. We achieved a transmission distance of 0.5 km, which was limited only by the length of the test range. Our results provide strong evidence that cryptographic key material could be generated on demand between a ground station and a satellite (or between two satellites), allowing a satellite to be securely re-keyed on orbit. We present a feasibility analysis of surface-to-satellite quantum key generation.« less

Direct and reverse secret-key capacities of a quantum channel.

PubMed

Pirandola, Stefano; García-Patrón, Raul; Braunstein, Samuel L; Lloyd, Seth

2009-02-06

We define the direct and reverse secret-key capacities of a memoryless quantum channel as the optimal rates that entanglement-based quantum-key-distribution protocols can reach by using a single forward classical communication (direct reconciliation) or a single feedback classical communication (reverse reconciliation). In particular, the reverse secret-key capacity can be positive for antidegradable channels, where no forward strategy is known to be secure. This property is explicitly shown in the continuous variable framework by considering arbitrary one-mode Gaussian channels.

Device-independent secret-key-rate analysis for quantum repeaters

NASA Astrophysics Data System (ADS)

Holz, Timo; Kampermann, Hermann; Bruß, Dagmar

2018-01-01

The device-independent approach to quantum key distribution (QKD) aims to establish a secret key between two or more parties with untrusted devices, potentially under full control of a quantum adversary. The performance of a QKD protocol can be quantified by the secret key rate, which can be lower bounded via the violation of an appropriate Bell inequality in a setup with untrusted devices. We study secret key rates in the device-independent scenario for different quantum repeater setups and compare them to their device-dependent analogon. The quantum repeater setups under consideration are the original protocol by Briegel et al. [Phys. Rev. Lett. 81, 5932 (1998), 10.1103/PhysRevLett.81.5932] and the hybrid quantum repeater protocol by van Loock et al. [Phys. Rev. Lett. 96, 240501 (2006), 10.1103/PhysRevLett.96.240501]. For a given repeater scheme and a given QKD protocol, the secret key rate depends on a variety of parameters, such as the gate quality or the detector efficiency. We systematically analyze the impact of these parameters and suggest optimized strategies.

Upper bounds on secret-key agreement over lossy thermal bosonic channels

NASA Astrophysics Data System (ADS)

Kaur, Eneet; Wilde, Mark M.

2017-12-01

Upper bounds on the secret-key-agreement capacity of a quantum channel serve as a way to assess the performance of practical quantum-key-distribution protocols conducted over that channel. In particular, if a protocol employs a quantum repeater, achieving secret-key rates exceeding these upper bounds is evidence of having a working quantum repeater. In this paper, we extend a recent advance [Liuzzo-Scorpo et al., Phys. Rev. Lett. 119, 120503 (2017), 10.1103/PhysRevLett.119.120503] in the theory of the teleportation simulation of single-mode phase-insensitive Gaussian channels such that it now applies to the relative entropy of entanglement measure. As a consequence of this extension, we find tighter upper bounds on the nonasymptotic secret-key-agreement capacity of the lossy thermal bosonic channel than were previously known. The lossy thermal bosonic channel serves as a more realistic model of communication than the pure-loss bosonic channel, because it can model the effects of eavesdropper tampering and imperfect detectors. An implication of our result is that the previously known upper bounds on the secret-key-agreement capacity of the thermal channel are too pessimistic for the practical finite-size regime in which the channel is used a finite number of times, and so it should now be somewhat easier to witness a working quantum repeater when using secret-key-agreement capacity upper bounds as a benchmark.

Secret-key-assisted private classical communication capacity over quantum channels

NASA Astrophysics Data System (ADS)

Hsieh, Min-Hsiu; Luo, Zhicheng; Brun, Todd

2008-10-01

We prove a regularized formula for the secret-key-assisted capacity region of a quantum channel for transmitting private classical information. This result parallels the work of Devetak (e-print arXiv:quant-ph/0512015) on entanglement-assisted quantum communication capacity . This formula provides a family protocol, the private father protocol, under the resource inequality framework that includes private classical communication without secret-key assistance as a child protocol.

Palmatine, a protoberberine alkaloid, inhibits both Ca2+- and cAMP-activated Cl− secretion in isolated rat distal colon

PubMed Central

Wu, D Z; Yuan, J Y; Shi, H L; Hu, Z B

2008-01-01

Background and purpose: The protoberberine alkaloid berberine has been reported to inhibit colonic Cl− secretion. However, it is not known if other protoberberine alkaloids share these effects. We have therefore selected another protoberberine alkaloid, palmatine, to assess its effects on active ion transport across rat colonic epithelium. Experimental approach: Rat colonic mucosa was mounted in Ussing chambers and short circuit current (I SC), apical Cl− current and basolateral K+ current were recorded. Intracellular cAMP content was determined by an enzyme immunoassay. Intracellular Ca2+ concentration was measured with Fura-2 AM. Key results: Palmatine inhibited carbachol-induced Ca2+-activated Cl− secretion and the carbachol-induced increase of intracellular Ca2+ concentration. Palmatine also inhibited cAMP-activated Cl− secretion induced by prostaglandin E2 (PGE2) or forskolin. Palmatine prevented the elevation of intracellular cAMP by forskolin. Determination of apical Cl− currents showed that palmatine suppressed the forskolin-stimulated, apical cAMP-activated Cl− current but not the carbachol-stimulated apical Ca2+-activated Cl− current. Following permeabilization of apical membranes with nystatin, we found that palmatine inhibited a carbachol-stimulated basolateral K+ current that was sensitive to charybdotoxin and resistant to chromanol 293B. However, the forskolin-stimulated basolateral K+ current inhibited by palmatine was specifically blocked by chromanol 293B and not by charybdotoxin. Conclusions and implications: Palmatine attenuated Ca2+-activated Cl− secretion through inhibiting basolateral charybdotoxin-sensitive, SK4 K+ channels, whereas it inhibited cAMP-activated Cl− secretion by inhibiting apical CFTR Cl− channels and basolateral chromanol 293B-sensitive, KvLQT1 K+ channels. PMID:18204477

Fault-tolerant Remote Quantum Entanglement Establishment for Secure Quantum Communications

NASA Astrophysics Data System (ADS)

Tsai, Chia-Wei; Lin, Jason

2016-07-01

This work presents a strategy for constructing long-distance quantum communications among a number of remote users through collective-noise channel. With the assistance of semi-honest quantum certificate authorities (QCAs), the remote users can share a secret key through fault-tolerant entanglement swapping. The proposed protocol is feasible for large-scale distributed quantum networks with numerous users. Each pair of communicating parties only needs to establish the quantum channels and the classical authenticated channels with his/her local QCA. Thus, it enables any user to communicate freely without point-to-point pre-establishing any communication channels, which is efficient and feasible for practical environments.

Retrieving and routing quantum information in a quantum network

NASA Astrophysics Data System (ADS)

Sazim, S.; Chiranjeevi, V.; Chakrabarty, I.; Srinathan, K.

2015-12-01

In extant quantum secret sharing protocols, once the secret is shared in a quantum network ( qnet) it cannot be retrieved, even if the dealer wishes that his/her secret no longer be available in the network. For instance, if the dealer is part of the two qnets, say {{Q}}_1 and {{Q}}_2 and he/she subsequently finds that {{Q}}_2 is more reliable than {{Q}}_1, he/she may wish to transfer all her secrets from {{Q}}_1 to {{Q}}_2. Known protocols are inadequate to address such a revocation. In this work we address this problem by designing a protocol that enables the source/dealer to bring back the information shared in the network, if desired. Unlike classical revocation, the no-cloning theorem automatically ensures that the secret is no longer shared in the network. The implications of our results are multi-fold. One interesting implication of our technique is the possibility of routing qubits in asynchronous qnets. By asynchrony we mean that the requisite data/resources are intermittently available (but not necessarily simultaneously) in the qnet. For example, we show that a source S can send quantum information to a destination R even though (a) S and R share no quantum resource, (b) R's identity is unknown to S at the time of sending the message, but is subsequently decided, (c) S herself can be R at a later date and/or in a different location to bequeath her information (`backed-up' in the qnet) and (d) importantly, the path chosen for routing the secret may hit a dead end due to resource constraints, congestion, etc., (therefore the information needs to be back-tracked and sent along an alternate path). Another implication of our technique is the possibility of using insecure resources. For instance, if the quantum memory within an organization is insufficient, it may safely store (using our protocol) its private information with a neighboring organization without (a) revealing critical data to the host and (b) losing control over retrieving the data. Putting the two implications together, namely routing and secure storage, it is possible to envision applications like quantum mail (qmail) as an outsourced service.

Experimental quantum secret sharing and third-man quantum cryptography.

PubMed

Chen, Yu-Ao; Zhang, An-Ning; Zhao, Zhi; Zhou, Xiao-Qi; Lu, Chao-Yang; Peng, Cheng-Zhi; Yang, Tao; Pan, Jian-Wei

2005-11-11

Quantum secret sharing (QSS) and third-man quantum cryptography (TQC) are essential for advanced quantum communication; however, the low intensity and fragility of the multiphoton entanglement source in previous experiments have made their realization an extreme experimental challenge. Here, we develop and exploit an ultrastable high intensity source of four-photon entanglement to report an experimental realization of QSS and TQC. The technology developed in our experiment will be important for future multiparty quantum communication.

Fast and simple high-capacity quantum cryptography with error detection

PubMed Central

Lai, Hong; Luo, Ming-Xing; Pieprzyk, Josef; Zhang, Jun; Pan, Lei; Li, Shudong; Orgun, Mehmet A.

2017-01-01

Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth. PMID:28406240

Fast and simple high-capacity quantum cryptography with error detection.

PubMed

Lai, Hong; Luo, Ming-Xing; Pieprzyk, Josef; Zhang, Jun; Pan, Lei; Li, Shudong; Orgun, Mehmet A

2017-04-13

Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.

Fast and simple high-capacity quantum cryptography with error detection

NASA Astrophysics Data System (ADS)

Lai, Hong; Luo, Ming-Xing; Pieprzyk, Josef; Zhang, Jun; Pan, Lei; Li, Shudong; Orgun, Mehmet A.

2017-04-01

Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth.

DBSecSys 2.0: a database of Burkholderia mallei and Burkholderia pseudomallei secretion systems.

PubMed

Memišević, Vesna; Kumar, Kamal; Zavaljevski, Nela; DeShazer, David; Wallqvist, Anders; Reifman, Jaques

2016-09-20

Burkholderia mallei and B. pseudomallei are the causative agents of glanders and melioidosis, respectively, diseases with high morbidity and mortality rates. B. mallei and B. pseudomallei are closely related genetically; B. mallei evolved from an ancestral strain of B. pseudomallei by genome reduction and adaptation to an obligate intracellular lifestyle. Although these two bacteria cause different diseases, they share multiple virulence factors, including bacterial secretion systems, which represent key components of bacterial pathogenicity. Despite recent progress, the secretion system proteins for B. mallei and B. pseudomallei, their pathogenic mechanisms of action, and host factors are not well characterized. We previously developed a manually curated database, DBSecSys, of bacterial secretion system proteins for B. mallei. Here, we report an expansion of the database with corresponding information about B. pseudomallei. DBSecSys 2.0 contains comprehensive literature-based and computationally derived information about B. mallei ATCC 23344 and literature-based and computationally derived information about B. pseudomallei K96243. The database contains updated information for 163 B. mallei proteins from the previous database and 61 additional B. mallei proteins, and new information for 281 B. pseudomallei proteins associated with 5 secretion systems, their 1,633 human- and murine-interacting targets, and 2,400 host-B. mallei interactions and 2,286 host-B. pseudomallei interactions. The database also includes information about 13 pathogenic mechanisms of action for B. mallei and B. pseudomallei secretion system proteins inferred from the available literature or computationally. Additionally, DBSecSys 2.0 provides details about 82 virulence attenuation experiments for 52 B. mallei secretion system proteins and 98 virulence attenuation experiments for 61 B. pseudomallei secretion system proteins. We updated the Web interface and data access layer to speed-up users' search of detailed information for orthologous proteins related to secretion systems of the two pathogens. The updates of DBSecSys 2.0 provide unique capabilities to access comprehensive information about secretion systems of B. mallei and B. pseudomallei. They enable studies and comparisons of corresponding proteins of these two closely related pathogens and their host-interacting partners. The database is available at http://dbsecsys.bhsai.org .

Semi-quantum communication: protocols for key agreement, controlled secure direct communication and dialogue

NASA Astrophysics Data System (ADS)

Shukla, Chitra; Thapliyal, Kishore; Pathak, Anirban

2017-12-01

Semi-quantum protocols that allow some of the users to remain classical are proposed for a large class of problems associated with secure communication and secure multiparty computation. Specifically, first-time semi-quantum protocols are proposed for key agreement, controlled deterministic secure communication and dialogue, and it is shown that the semi-quantum protocols for controlled deterministic secure communication and dialogue can be reduced to semi-quantum protocols for e-commerce and private comparison (socialist millionaire problem), respectively. Complementing with the earlier proposed semi-quantum schemes for key distribution, secret sharing and deterministic secure communication, set of schemes proposed here and subsequent discussions have established that almost every secure communication and computation tasks that can be performed using fully quantum protocols can also be performed in semi-quantum manner. Some of the proposed schemes are completely orthogonal-state-based, and thus, fundamentally different from the existing semi-quantum schemes that are conjugate coding-based. Security, efficiency and applicability of the proposed schemes have been discussed with appropriate importance.

Topics in quantum cryptography, quantum error correction, and channel simulation

NASA Astrophysics Data System (ADS)

Luo, Zhicheng

In this thesis, we mainly investigate four different topics: efficiently implementable codes for quantum key expansion [51], quantum error-correcting codes based on privacy amplification [48], private classical capacity of quantum channels [44], and classical channel simulation with quantum side information [49, 50]. For the first topic, we propose an efficiently implementable quantum key expansion protocol, capable of increasing the size of a pre-shared secret key by a constant factor. Previously, the Shor-Preskill proof [64] of the security of the Bennett-Brassard 1984 (BB84) [6] quantum key distribution protocol relied on the theoretical existence of good classical error-correcting codes with the "dual-containing" property. But the explicit and efficiently decodable construction of such codes is unknown. We show that we can lift the dual-containing constraint by employing the non-dual-containing codes with excellent performance and efficient decoding algorithms. For the second topic, we propose a construction of Calderbank-Shor-Steane (CSS) [19, 68] quantum error-correcting codes, which are originally based on pairs of mutually dual-containing classical codes, by combining a classical code with a two-universal hash function. We show, using the results of Renner and Koenig [57], that the communication rates of such codes approach the hashing bound on tensor powers of Pauli channels in the limit of large block-length. For the third topic, we prove a regularized formula for the secret key assisted capacity region of a quantum channel for transmitting private classical information. This result parallels the work of Devetak on entanglement assisted quantum communication capacity. This formula provides a new family protocol, the private father protocol, under the resource inequality framework that includes the private classical communication without the assisted secret keys as a child protocol. For the fourth topic, we study and solve the problem of classical channel simulation with quantum side information at the receiver. Our main theorem has two important corollaries: rate-distortion theory with quantum side information and common randomness distillation. Simple proofs of achievability of classical multi-terminal source coding problems can be made via a unified approach using the channel simulation theorem as building blocks. The fully quantum generalization of the problem is also conjectured with outer and inner bounds on the achievable rate pairs.

A novel, privacy-preserving cryptographic approach for sharing sequencing data

PubMed Central

Cassa, Christopher A; Miller, Rachel A; Mandl, Kenneth D

2013-01-01

Objective DNA samples are often processed and sequenced in facilities external to the point of collection. These samples are routinely labeled with patient identifiers or pseudonyms, allowing for potential linkage to identity and private clinical information if intercepted during transmission. We present a cryptographic scheme to securely transmit externally generated sequence data which does not require any patient identifiers, public key infrastructure, or the transmission of passwords. Materials and methods This novel encryption scheme cryptographically protects participant sequence data using a shared secret key that is derived from a unique subset of an individual’s genetic sequence. This scheme requires access to a subset of an individual’s genetic sequence to acquire full access to the transmitted sequence data, which helps to prevent sample mismatch. Results We validate that the proposed encryption scheme is robust to sequencing errors, population uniqueness, and sibling disambiguation, and provides sufficient cryptographic key space. Discussion Access to a set of an individual’s genotypes and a mutually agreed cryptographic seed is needed to unlock the full sequence, which provides additional sample authentication and authorization security. We present modest fixed and marginal costs to implement this transmission architecture. Conclusions It is possible for genomics researchers who sequence participant samples externally to protect the transmission of sequence data using unique features of an individual’s genetic sequence. PMID:23125421

Local distinguishability of Dicke states in quantum secret sharing

NASA Astrophysics Data System (ADS)

Wang, Jing-Tao; Xu, Gang; Chen, Xiu-Bo; Sun, Xing-Ming; Jia, Heng-Yue

2017-03-01

We comprehensively investigate the local distinguishability of orthogonal Dicke states under local operations and classical communication (LOCC) from both qualitative and quantitative aspects. Based on our work, defects in the LOCC-quantum secret sharing (QSS) scheme can be complemented, and the information leakage can be quantified. For (k1 ,k2 , k , n)-threshold LOCC-QSS scheme, more intuitive formulas for unambiguous probability and guessing probability were established, which can be used for determining the parameter k1 and k2 directly.

Improving the multiparty quantum secret sharing over two collective-noise channels against insider attack

NASA Astrophysics Data System (ADS)

Sun, Ying; Wen, Qiao-yan; Zhu, Fu-chen

2010-01-01

The security of the multiparty quantum secret sharing protocol presented by Zhang [Z.J. Zhang, Physica A, 361 (2006) 233] is analyzed. It is shown that this protocol is vulnerable to the insider attack since eavesdropping detection is performed only when all states arrive at the last agent. We propose an attack strategy and give an improved version of the original protocol. The improved protocol is robust and has the same traits with the original one.

Experimental circular quantum secret sharing over telecom fiber network.

PubMed

Wei, Ke-Jin; Ma, Hai-Qiang; Yang, Jian-Hui

2013-07-15

We present a robust single photon circular quantum secret sharing (QSS) scheme with phase encoding over 50 km single mode fiber network using a circular QSS protocol. Our scheme can automatically provide a perfect compensation of birefringence and remain stable for a long time. A high visibility of 99.3% is obtained. Furthermore, our scheme realizes a polarization insensitive phase modulators. The visibility of this system can be maintained perpetually without any adjustment to the system every time we test the system.

A comparative hidden Markov model analysis pipeline identifies proteins characteristic of cereal-infecting fungi

PubMed Central

2013-01-01

Background Fungal pathogens cause devastating losses in economically important cereal crops by utilising pathogen proteins to infect host plants. Secreted pathogen proteins are referred to as effectors and have thus far been identified by selecting small, cysteine-rich peptides from the secretome despite increasing evidence that not all effectors share these attributes. Results We take advantage of the availability of sequenced fungal genomes and present an unbiased method for finding putative pathogen proteins and secreted effectors in a query genome via comparative hidden Markov model analyses followed by unsupervised protein clustering. Our method returns experimentally validated fungal effectors in Stagonospora nodorum and Fusarium oxysporum as well as the N-terminal Y/F/WxC-motif from the barley powdery mildew pathogen. Application to the cereal pathogen Fusarium graminearum reveals a secreted phosphorylcholine phosphatase that is characteristic of hemibiotrophic and necrotrophic cereal pathogens and shares an ancient selection process with bacterial plant pathogens. Three F. graminearum protein clusters are found with an enriched secretion signal. One of these putative effector clusters contains proteins that share a [SG]-P-C-[KR]-P sequence motif in the N-terminal and show features not commonly associated with fungal effectors. This motif is conserved in secreted pathogenic Fusarium proteins and a prime candidate for functional testing. Conclusions Our pipeline has successfully uncovered conservation patterns, putative effectors and motifs of fungal pathogens that would have been overlooked by existing approaches that identify effectors as small, secreted, cysteine-rich peptides. It can be applied to any pathogenic proteome data, such as microbial pathogen data of plants and other organisms. PMID:24252298

Quantum secret sharing using orthogonal multiqudit entangled states

NASA Astrophysics Data System (ADS)

Bai, Chen-Ming; Li, Zhi-Hui; Liu, Cheng-Ji; Li, Yong-Ming

2017-12-01

In this work, we investigate the distinguishability of orthogonal multiqudit entangled states under restricted local operations and classical communication. According to these properties, we propose a quantum secret sharing scheme to realize three types of access structures, i.e., the ( n, n)-threshold, the restricted (3, n)-threshold and restricted (4, n)-threshold schemes (called LOCC-QSS scheme). All cooperating players in the restricted threshold schemes are from two disjoint groups. In the proposed protocol, the participants use the computational basis measurement and classical communication to distinguish between those orthogonal states and reconstruct the original secret. Furthermore, we also analyze the security of our scheme in four primary quantum attacks and give a simple encoding method in order to better prevent the participant conspiracy attack.

The Virginia Slims identity crisis: an inside look at tobacco industry marketing to women.

PubMed

Toll, B A; Ling, P M

2005-06-01

Because no prior studies have comprehensively analysed previously secret tobacco industry documents describing marketing female brands, the Virginia Slims brand was studied to explore how Philip Morris and competitors develop and adapt promotional campaigns targeting women. Analysis of previously secret tobacco industry documents. The majority of the documents used were from Philip Morris. The key to Virginia Slims advertising was creating an aspirational image which women associated with the brand. Virginia Slims co-opted women's liberation slogans to build a modern female image from 1968 through to the 1980s, and its market share grew from 0.24% to 3.16% during that time period. Ironically, the feminist image that worked very well for the brand was also the reason for its subsequent problems. Philip Morris experienced unprecedented losses in market share in the early 1990s, with a decline in market share for four consecutive years from 3.16% to 2.26%; they attributed this decline to both the fact that the brand's feminist image no longer appealed to young women aged 18-24 years, and increased competition from more contemporary and lower priced competitors. Throughout the 1990s, attempts to reacquire young women while retaining Virginia Slims loyal (now older) smokers were made using a "King Size" line extension, new slogans, and loyalty building promotions. Tobacco advertisers initially created distinct female brands with aspirational images; continued appeal to young women was critical for long term growth. The need for established brands to evolve to maintain relevance to young women creates an opportunity for tobacco counter-marketing, which should undermine tobacco brand imagery and promote aspirational smoke-free lifestyle images. Young women age 18-24 are extremely valuable to the tobacco industry and should be a focus for tobacco control programmes.

Quantum state sharing against the controller's cheating

NASA Astrophysics Data System (ADS)

Shi, Run-hua; Zhong, Hong; Huang, Liu-sheng

2013-08-01

Most existing QSTS schemes are equivalent to the controlled teleportation, in which a designated agent (i.e., the recoverer) can recover the teleported state with the help of the controllers. However, the controller may attempt to cheat the recoverer during the phase of recovering the secret state. How can we detect this cheating? In this paper, we considered the problem of detecting the controller's cheating in Quantum State Sharing, and further proposed an effective Quantum State Sharing scheme against the controller's cheating. We cleverly use Quantum Secret Sharing, Multiple Quantum States Sharing and decoy-particle techniques. In our scheme, via a previously shared entanglement state Alice can teleport multiple arbitrary multi-qubit states to Bob with the help of Charlie. Furthermore, by the classical information shared previously, Alice and Bob can check whether there is any cheating of Charlie. In addition, our scheme only needs to perform Bell-state and single-particle measurements, and to apply C-NOT gate and other single-particle unitary operations. With the present techniques, it is feasible to implement these necessary measurements and operations.

Password-Only Authenticated Three-Party Key Exchange with Provable Security in the Standard Model

PubMed Central

Nam, Junghyun; Kim, Junghwan; Kang, Hyun-Kyu; Kim, Jinsoo; Paik, Juryon

2014-01-01

Protocols for password-only authenticated key exchange (PAKE) in the three-party setting allow two clients registered with the same authentication server to derive a common secret key from their individual password shared with the server. Existing three-party PAKE protocols were proven secure under the assumption of the existence of random oracles or in a model that does not consider insider attacks. Therefore, these protocols may turn out to be insecure when the random oracle is instantiated with a particular hash function or an insider attack is mounted against the partner client. The contribution of this paper is to present the first three-party PAKE protocol whose security is proven without any idealized assumptions in a model that captures insider attacks. The proof model we use is a variant of the indistinguishability-based model of Bellare, Pointcheval, and Rogaway (2000), which is one of the most widely accepted models for security analysis of password-based key exchange protocols. We demonstrated that our protocol achieves not only the typical indistinguishability-based security of session keys but also the password security against undetectable online dictionary attacks. PMID:24977229

Improving Continuous-Variable Measurement-Device-Independent Multipartite Quantum Communication with Optical Amplifiers*

NASA Astrophysics Data System (ADS)

Guo, Ying; Zhao, Wei; Li, Fei; Huang, Duan; Liao, Qin; Xie, Cai-Lang

2017-08-01

The developing tendency of continuous-variable (CV) measurement-device-independent (MDI) quantum cryptography is to cope with the practical issue of implementing scalable quantum networks. Up to now, most theoretical and experimental researches on CV-MDI QKD are focused on two-party protocols. However, we suggest a CV-MDI multipartite quantum secret sharing (QSS) protocol use the EPR states coupled with optical amplifiers. More remarkable, QSS is the real application in multipartite CV-MDI QKD, in other words, is the concrete implementation method of multipartite CV-MDI QKD. It can implement a practical quantum network scheme, under which the legal participants create the secret correlations by using EPR states connecting to an untrusted relay via insecure links and applying the multi-entangled Greenberger-Horne-Zeilinger (GHZ) state analysis at relay station. Even if there is a possibility that the relay may be completely tampered, the legal participants are still able to extract a secret key from network communication. The numerical simulation indicates that the quantum network communication can be achieved in an asymmetric scenario, fulfilling the demands of a practical quantum network. Additionally, we illustrate that the use of optical amplifiers can compensate the partial inherent imperfections of detectors and increase the transmission distance of the CV-MDI quantum system.

Research on manufacturing service behavior modeling based on block chain theory

NASA Astrophysics Data System (ADS)

Zhao, Gang; Zhang, Guangli; Liu, Ming; Yu, Shuqin; Liu, Yali; Zhang, Xu

2018-04-01

According to the attribute characteristics of processing craft, the manufacturing service behavior is divided into service attribute, basic attribute, process attribute, resource attribute. The attribute information model of manufacturing service is established. The manufacturing service behavior information is successfully divided into public and private domain. Additionally, the block chain technology is introduced, and the information model of manufacturing service based on block chain principle is established, which solves the problem of sharing and secreting information of processing behavior, and ensures that data is not tampered with. Based on the key pairing verification relationship, the selective publishing mechanism for manufacturing information is established, achieving the traceability of product data, guarantying the quality of processing quality.

Entropic inequalities for a class of quantum secret-sharing states

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sarvepalli, Pradeep

It is well known that von Neumann entropy is nonmonotonic, unlike Shannon entropy (which is monotonically nondecreasing). Consequently, it is difficult to relate the entropies of the subsystems of a given quantum state. In this paper, we show that if we consider quantum secret-sharing states arising from a class of monotone span programs, then we can partially recover the monotonicity of entropy for the so-called unauthorized sets. Furthermore, we can show for these quantum states that the entropy of the authorized sets is monotonically nonincreasing.

Optimized decoy state QKD for underwater free space communication

NASA Astrophysics Data System (ADS)

Lopes, Minal; Sarwade, Nisha

Quantum cryptography (QC) is envisioned as a solution for global key distribution through fiber optic, free space and underwater optical communication due to its unconditional security. In view of this, this paper investigates underwater free space quantum key distribution (QKD) model for enhanced transmission distance, secret key rates and security. It is reported that secure underwater free space QKD is feasible in the clearest ocean water with the sifted key rates up to 207kbps. This paper extends this work by testing performance of optimized decoy state QKD protocol with underwater free space communication model. The attenuation of photons, quantum bit error rate and the sifted key generation rate of underwater quantum communication is obtained with vector radiative transfer theory and Monte Carlo method. It is observed from the simulations that optimized decoy state QKD evidently enhances the underwater secret key transmission distance as well as secret key rates.

An emerging case for membrane pore formation as a common mechanism for the unconventional secretion of FGF2 and IL-1β.

PubMed

Brough, David; Pelegrin, Pablo; Nickel, Walter

2017-10-01

Extracellular proteins with important signalling roles in processes, such as inflammation and angiogenesis, are known to employ unconventional routes of protein secretion. Although mechanisms of unconventional protein secretion are beginning to emerge, the precise molecular details have remained elusive for the majority of cargo proteins secreted by unconventional means. Recent findings suggest that for two examples of unconventionally secreted proteins, interleukin 1β (IL-1β) and fibroblast growth factor 2 (FGF2), the common molecular principle of pore formation may be shared. Under specific experimental conditions, secretion of IL-1β and FGF2 is triggered by phosphatidylinositol 4,5-bisphosphate [PI(4,5)P 2 ]-dependent formation of pores across the plasma membrane. However, the underlying mechanisms are different, with FGF2 known to directly interact with PI(4,5)P 2 , whereas in the case of IL-1β secretion, it is proposed that the N-terminal fragment of gasdermin D interacts with PI(4,5)P 2 to form the pore. Thus, although implemented in different ways, these findings suggest that pore formation may be shared by the unconventional secretion mechanisms for FGF2 and IL-1β in at least some cases. In this Opinion article, we discuss the unconventional mechanisms of FGF2 and IL-1β release with a particular emphasis on recent discoveries suggesting the importance of pore formation on the plasma membrane. © 2017. Published by The Company of Biologists Ltd.

The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks

NASA Astrophysics Data System (ADS)

Ristenpart, Thomas; Yilek, Scott

Multiparty signature protocols need protection against rogue-key attacks, made possible whenever an adversary can choose its public key(s) arbitrarily. For many schemes, provable security has only been established under the knowledge of secret key (KOSK) assumption where the adversary is required to reveal the secret keys it utilizes. In practice, certifying authorities rarely require the strong proofs of knowledge of secret keys required to substantiate the KOSK assumption. Instead, proofs of possession (POPs) are required and can be as simple as just a signature over the certificate request message. We propose a general registered key model, within which we can model both the KOSK assumption and in-use POP protocols. We show that simple POP protocols yield provable security of Boldyreva's multisignature scheme [11], the LOSSW multisignature scheme [28], and a 2-user ring signature scheme due to Bender, Katz, and Morselli [10]. Our results are the first to provide formal evidence that POPs can stop rogue-key attacks.

Experimental demonstration of graph-state quantum secret sharing.

PubMed

Bell, B A; Markham, D; Herrera-Martí, D A; Marin, A; Wadsworth, W J; Rarity, J G; Tame, M S

2014-11-21

Quantum communication and computing offer many new opportunities for information processing in a connected world. Networks using quantum resources with tailor-made entanglement structures have been proposed for a variety of tasks, including distributing, sharing and processing information. Recently, a class of states known as graph states has emerged, providing versatile quantum resources for such networking tasks. Here we report an experimental demonstration of graph state-based quantum secret sharing--an important primitive for a quantum network with applications ranging from secure money transfer to multiparty quantum computation. We use an all-optical setup, encoding quantum information into photons representing a five-qubit graph state. We find that one can reliably encode, distribute and share quantum information amongst four parties, with various access structures based on the complex connectivity of the graph. Our results show that graph states are a promising approach for realising sophisticated multi-layered communication protocols in quantum networks.

Counterfactual quantum cryptography.

PubMed

Noh, Tae-Gon

2009-12-04

Quantum cryptography allows one to distribute a secret key between two remote parties using the fundamental principles of quantum mechanics. The well-known established paradigm for the quantum key distribution relies on the actual transmission of signal particle through a quantum channel. In this Letter, we show that the task of a secret key distribution can be accomplished even though a particle carrying secret information is not in fact transmitted through the quantum channel. The proposed protocols can be implemented with current technologies and provide practical security advantages by eliminating the possibility that an eavesdropper can directly access the entire quantum system of each signal particle.

Counterfactual Quantum Cryptography

NASA Astrophysics Data System (ADS)

Noh, Tae-Gon

2009-12-01

Quantum cryptography allows one to distribute a secret key between two remote parties using the fundamental principles of quantum mechanics. The well-known established paradigm for the quantum key distribution relies on the actual transmission of signal particle through a quantum channel. In this Letter, we show that the task of a secret key distribution can be accomplished even though a particle carrying secret information is not in fact transmitted through the quantum channel. The proposed protocols can be implemented with current technologies and provide practical security advantages by eliminating the possibility that an eavesdropper can directly access the entire quantum system of each signal particle.

Distillation of secret-key from a class of compound memoryless quantum sources

DOE Office of Scientific and Technical Information (OSTI.GOV)

Boche, H., E-mail: boche@tum.de; Janßen, G., E-mail: gisbert.janssen@tum.de

We consider secret-key distillation from tripartite compound classical-quantum-quantum (cqq) sources with free forward public communication under strong security criterion. We design protocols which are universally reliable and secure in this scenario. These are shown to achieve asymptotically optimal rates as long as a certain regularity condition is fulfilled by the set of its generating density matrices. We derive a multi-letter formula which describes the optimal forward secret-key capacity for all compound cqq sources being regular in this sense. We also determine the forward secret-key distillation capacity for situations where the legitimate sending party has perfect knowledge of his/her marginal statemore » deriving from the source statistics. In this case regularity conditions can be dropped. Our results show that the capacities with and without the mentioned kind of state knowledge are equal as long as the source is generated by a regular set of density matrices. We demonstrate that regularity of cqq sources is not only a technical but also an operational issue. For this reason, we give an example of a source which has zero secret-key distillation capacity without sender knowledge, while achieving positive rates is possible if sender marginal knowledge is provided.« less

Quantum key distribution with finite resources: Secret key rates via Renyi entropies

DOE Office of Scientific and Technical Information (OSTI.GOV)

Abruzzo, Silvestre; Kampermann, Hermann; Mertz, Markus

A realistic quantum key distribution (QKD) protocol necessarily deals with finite resources, such as the number of signals exchanged by the two parties. We derive a bound on the secret key rate which is expressed as an optimization problem over Renyi entropies. Under the assumption of collective attacks by an eavesdropper, a computable estimate of our bound for the six-state protocol is provided. This bound leads to improved key rates in comparison to previous results.

A kind of universal quantum secret sharing protocol

NASA Astrophysics Data System (ADS)

Chen, Xiu-Bo; Dou, Zhao; Xu, Gang; He, Xiao-Yu; Yang, Yi-Xian

2017-01-01

Universality is an important feature, but less researched in quantum communication protocols. In this paper, a kind of universal quantum secret sharing protocol is investigated. Firstly, we design a quantum secret sharing protocol based on the Borras-Plastino-Batle (BPB) state. Departing from previous research, our protocol has a salient feature in that participants in our protocol only need projective measurement instead of any unitary operations. It makes our protocol more flexible. Secondly, universality of quantum communication protocols is studied for the first time. More specifically, module division of quantum communication protocols and coupling between different modules are discussed. Our aforementioned protocol is analyzed as an example. On one hand, plenty of quantum states (the BPB-class states and the BPB-like-class states, which are proposed in this paper) could be used as carrier to perform our protocol. On the other hand, our protocol also could be regarded as a quantum private comparison protocol with a little revision. These features are rare for quantum communication protocols, and make our protocol more robust. Thirdly, entanglements of the BPB-class states are calculated in the Appendix.

A kind of universal quantum secret sharing protocol.

PubMed

Chen, Xiu-Bo; Dou, Zhao; Xu, Gang; He, Xiao-Yu; Yang, Yi-Xian

2017-01-12

Universality is an important feature, but less researched in quantum communication protocols. In this paper, a kind of universal quantum secret sharing protocol is investigated. Firstly, we design a quantum secret sharing protocol based on the Borras-Plastino-Batle (BPB) state. Departing from previous research, our protocol has a salient feature in that participants in our protocol only need projective measurement instead of any unitary operations. It makes our protocol more flexible. Secondly, universality of quantum communication protocols is studied for the first time. More specifically, module division of quantum communication protocols and coupling between different modules are discussed. Our aforementioned protocol is analyzed as an example. On one hand, plenty of quantum states (the BPB-class states and the BPB-like-class states, which are proposed in this paper) could be used as carrier to perform our protocol. On the other hand, our protocol also could be regarded as a quantum private comparison protocol with a little revision. These features are rare for quantum communication protocols, and make our protocol more robust. Thirdly, entanglements of the BPB-class states are calculated in the Appendix.

A kind of universal quantum secret sharing protocol

PubMed Central

Chen, Xiu-Bo; Dou, Zhao; Xu, Gang; He, Xiao-Yu; Yang, Yi-Xian

2017-01-01

Universality is an important feature, but less researched in quantum communication protocols. In this paper, a kind of universal quantum secret sharing protocol is investigated. Firstly, we design a quantum secret sharing protocol based on the Borras-Plastino-Batle (BPB) state. Departing from previous research, our protocol has a salient feature in that participants in our protocol only need projective measurement instead of any unitary operations. It makes our protocol more flexible. Secondly, universality of quantum communication protocols is studied for the first time. More specifically, module division of quantum communication protocols and coupling between different modules are discussed. Our aforementioned protocol is analyzed as an example. On one hand, plenty of quantum states (the BPB-class states and the BPB-like-class states, which are proposed in this paper) could be used as carrier to perform our protocol. On the other hand, our protocol also could be regarded as a quantum private comparison protocol with a little revision. These features are rare for quantum communication protocols, and make our protocol more robust. Thirdly, entanglements of the BPB-class states are calculated in the Appendix. PMID:28079109

Improved Secret Image Sharing Scheme in Embedding Capacity without Underflow and Overflow.

PubMed

Pang, Liaojun; Miao, Deyu; Li, Huixian; Wang, Qiong

2015-01-01

Computational secret image sharing (CSIS) is an effective way to protect a secret image during its transmission and storage, and thus it has attracted lots of attentions since its appearance. Nowadays, it has become a hot topic for researchers to improve the embedding capacity and eliminate the underflow and overflow situations, which is embarrassing and difficult to deal with. The scheme, which has the highest embedding capacity among the existing schemes, has the underflow and overflow problems. Although the underflow and overflow situations have been well dealt with by different methods, the embedding capacities of these methods are reduced more or less. Motivated by these concerns, we propose a novel scheme, in which we take the differential coding, Huffman coding, and data converting to compress the secret image before embedding it to further improve the embedding capacity, and the pixel mapping matrix embedding method with a newly designed matrix is used to embed secret image data into the cover image to avoid the underflow and overflow situations. Experiment results show that our scheme can improve the embedding capacity further and eliminate the underflow and overflow situations at the same time.

Improved Secret Image Sharing Scheme in Embedding Capacity without Underflow and Overflow

PubMed Central

Pang, Liaojun; Miao, Deyu; Li, Huixian; Wang, Qiong

2015-01-01

Computational secret image sharing (CSIS) is an effective way to protect a secret image during its transmission and storage, and thus it has attracted lots of attentions since its appearance. Nowadays, it has become a hot topic for researchers to improve the embedding capacity and eliminate the underflow and overflow situations, which is embarrassing and difficult to deal with. The scheme, which has the highest embedding capacity among the existing schemes, has the underflow and overflow problems. Although the underflow and overflow situations have been well dealt with by different methods, the embedding capacities of these methods are reduced more or less. Motivated by these concerns, we propose a novel scheme, in which we take the differential coding, Huffman coding, and data converting to compress the secret image before embedding it to further improve the embedding capacity, and the pixel mapping matrix embedding method with a newly designed matrix is used to embed secret image data into the cover image to avoid the underflow and overflow situations. Experiment results show that our scheme can improve the embedding capacity further and eliminate the underflow and overflow situations at the same time. PMID:26351657

Evaluating Predicates over Encrypted Data

DTIC Science & Technology

2008-10-01

Predicate encryption is a new encryption paradigm where the secret key owner can perform fine-grained access control over the encrypted data. In...particular, the secret key owner can generate a capability corresponding to a query predicate (e.g., whether an encrypted email contains the keyword

Notes on two multiparty quantum secret sharing schemes

NASA Astrophysics Data System (ADS)

Gao, Gan

In the paper [H. Abulkasim et al., Int. J. Quantum Inform. 15 (2017) 1750023], Abulkasim et al. proposed a quantum secret sharing scheme based on Bell states. We study the security of the multiparty case in the proposed scheme and detect that it is not secure. In the paper [Y. Du and W. Bao, Opt. Commun. 308 (2013) 159], Du and Bao listed Gao’s scheme and gave a attack strategy on the listed scheme. We point out that their listing scheme is not the genuine Gao’s scheme and their research method is not advisable.

75 FR 17305 - National Industrial Security Program Directive No. 1

Federal Register 2010, 2011, 2012, 2013, 2014

2010-04-06

... Top Secret; Communications Security, except classified keys used for data transfer; Restricted Data... clearance under an SSA to Top Secret unless an approved NID covering the prospective Top Secret access has...

Plants as models for the study of human pathogenesis.

PubMed

Guttman, David S

2004-05-01

There are many common disease mechanisms used by bacterial pathogens of plants and humans. They use common means of attachment, secretion and genetic regulation. They share many virulence factors, such as extracellular polysaccharides and some type III secreted effectors. Plant and human innate immune systems also share many similarities. Many of these shared bacterial virulence mechanisms are homologous, but even more appear to have independently converged on a common function. This combination of homologous and analogous systems reveals conserved and critical steps in the disease process. Given these similarities, and the many experimental advantages of plant biology, including ease of replication, stringent genetic and reproductive control, and high throughput with low cost, it is proposed that plants would make excellent models for the study of human pathogenesis.

Cheating prevention in visual cryptography.

PubMed

Hu, Chih-Ming; Tzeng, Wen-Guey

2007-01-01

Visual cryptography (VC) is a method of encrypting a secret image into shares such that stacking a sufficient number of shares reveals the secret image. Shares are usually presented in transparencies. Each participant holds a transparency. Most of the previous research work on VC focuses on improving two parameters: pixel expansion and contrast. In this paper, we studied the cheating problem in VC and extended VC. We considered the attacks of malicious adversaries who may deviate from the scheme in any way. We presented three cheating methods and applied them on attacking existent VC or extended VC schemes. We improved one cheat-preventing scheme. We proposed a generic method that converts a VCS to another VCS that has the property of cheating prevention. The overhead of the conversion is near optimal in both contrast degression and pixel expansion.

Multipartite Gaussian steering: Monogamy constraints and quantum cryptography applications

NASA Astrophysics Data System (ADS)

Xiang, Yu; Kogias, Ioannis; Adesso, Gerardo; He, Qiongyi

2017-01-01

We derive laws for the distribution of quantum steering among different parties in multipartite Gaussian states under Gaussian measurements. We prove that a monogamy relation akin to the generalized Coffman-Kundu-Wootters inequality holds quantitatively for a recently introduced measure of Gaussian steering. We then define the residual Gaussian steering, stemming from the monogamy inequality, as an indicator of collective steering-type correlations. For pure three-mode Gaussian states, the residual acts as a quantifier of genuine multipartite steering, and is interpreted operationally in terms of the guaranteed key rate in the task of secure quantum secret sharing. Optimal resource states for the latter protocol are identified, and their possible experimental implementation discussed. Our results pin down the role of multipartite steering for quantum communication.

Bacterial Translocation Ratchets: Shared Physical Principles with Different Molecular Implementations: How bacterial secretion systems bias Brownian motion for efficient translocation of macromolecules.

PubMed

Hepp, Christof; Maier, Berenike

2017-10-01

Secretion systems enable bacteria to import and secrete large macromolecules including DNA and proteins. While most components of these systems have been identified, the molecular mechanisms of macromolecular transport remain poorly understood. Recent findings suggest that various bacterial secretion systems make use of the translocation ratchet mechanism for transporting polymers across the cell envelope. Translocation ratchets are powered by chemical potential differences generated by concentration gradients of ions or molecules that are specific to the respective secretion systems. Bacteria employ these potential differences for biasing Brownian motion of the macromolecules within the conduits of the secretion systems. Candidates for this mechanism include DNA import by the type II secretion/type IV pilus system, DNA export by the type IV secretion system, and protein export by the type I secretion system. Here, we propose that these three secretion systems employ different molecular implementations of the translocation ratchet mechanism. © 2017 The Authors. BioEssays Published by WILEY Periodicals, Inc.

Evidence of shared Epstein-Barr viral isolates between sexual partners, and low level EBV in genital secretions.

PubMed

Thomas, Ranjit; Macsween, Karen F; McAulay, Karen; Clutterbuck, Daniel; Anderson, Richard; Reid, Stuart; Higgins, Craig D; Swerdlow, Anthony J; Harrison, Nadine; Williams, Hilary; Crawford, Dorothy H

2006-09-01

Epstein-Barr virus is present in the saliva of most persistently infected individuals and is generally thought to be spread by close oral contact. However, there are now several reports of EBV in genital secretions, suggesting the possibility of sexual transmission between adults. The present study was undertaken to investigate the risk of sexual transmission of EBV. PCR analysis was used to examined the degree to which a group (n = 11) of patients with infectious mononucleosis (IM) shared the same viral isolates as their sexual partners, and compare this to the extent of isolate sharing among a different group (n = 18) of IM patients and their non-sexual contacts. There was significantly more sharing of EBV isolates among the IM/sexual-contact pairs than among the IM/non-sexual-contact pairs (P = 0.0012). Female cervical (n = 84), male urethral (n = 55), and semen (n = 30) samples from asymptomatic, unselected volunteers were analyzed for the presence of EBV DNA, revealing 7%, 5%, and 3% to be EBV positive, respectively. Fractionation of cervical and urethral samples into cellular and supernatant fluid components showed EBV to be mainly cell-associated. Quantitation of EBV in these samples gave levels of below 10 EBV genomes per microg of DNA. Overall the findings support the possibility that EBV could on occasions be transmitted sexually, however, the low levels detected in genital secretions compared to saliva suggest that this is not a major transmission route. The finding of small quantities of cell-associated virus suggests a latent infection; thus EBV is probably in the B lymphocyte rather than in the epithelial cell component of the secretions.

Physical Layer Secret-Key Generation Scheme for Transportation Security Sensor Network

PubMed Central

Yang, Bin; Zhang, Jianfeng

2017-01-01

Wireless Sensor Networks (WSNs) are widely used in different disciplines, including transportation systems, agriculture field environment monitoring, healthcare systems, and industrial monitoring. The security challenge of the wireless communication link between sensor nodes is critical in WSNs. In this paper, we propose a new physical layer secret-key generation scheme for transportation security sensor network. The scheme is based on the cooperation of all the sensor nodes, thus avoiding the key distribution process, which increases the security of the system. Different passive and active attack models are analyzed in this paper. We also prove that when the cooperative node number is large enough, even when the eavesdropper is equipped with multiple antennas, the secret-key is still secure. Numerical results are performed to show the efficiency of the proposed scheme. PMID:28657588

Physical Layer Secret-Key Generation Scheme for Transportation Security Sensor Network.

PubMed

Yang, Bin; Zhang, Jianfeng

2017-06-28

Wireless Sensor Networks (WSNs) are widely used in different disciplines, including transportation systems, agriculture field environment monitoring, healthcare systems, and industrial monitoring. The security challenge of the wireless communication link between sensor nodes is critical in WSNs. In this paper, we propose a new physical layer secret-key generation scheme for transportation security sensor network. The scheme is based on the cooperation of all the sensor nodes, thus avoiding the key distribution process, which increases the security of the system. Different passive and active attack models are analyzed in this paper. We also prove that when the cooperative node number is large enough, even when the eavesdropper is equipped with multiple antennas, the secret-key is still secure. Numerical results are performed to show the efficiency of the proposed scheme.

Fundamental rate-loss tradeoff for optical quantum key distribution.

PubMed

Takeoka, Masahiro; Guha, Saikat; Wilde, Mark M

2014-10-24

Since 1984, various optical quantum key distribution (QKD) protocols have been proposed and examined. In all of them, the rate of secret key generation decays exponentially with distance. A natural and fundamental question is then whether there are yet-to-be discovered optical QKD protocols (without quantum repeaters) that could circumvent this rate-distance tradeoff. This paper provides a major step towards answering this question. Here we show that the secret key agreement capacity of a lossy and noisy optical channel assisted by unlimited two-way public classical communication is limited by an upper bound that is solely a function of the channel loss, regardless of how much optical power the protocol may use. Our result has major implications for understanding the secret key agreement capacity of optical channels-a long-standing open problem in optical quantum information theory-and strongly suggests a real need for quantum repeaters to perform QKD at high rates over long distances.

Secrets of Mlearning Failures: Confronting Reality

ERIC Educational Resources Information Center

Cochrane, Thomas

2012-01-01

Having implemented and evaluated over 35 mlearning projects in a variety of contexts in higher education over the past 6 years the researcher is ready to share the untold secret: not all mlearning projects succeed! This article critiques three of the researcher's mlearning projects that can be classed as "failures" and compares them to successful…

Secret Key Crypto Implementations

NASA Astrophysics Data System (ADS)

Bertoni, Guido Marco; Melzani, Filippo

This chapter presents the algorithm selected in 2001 as the Advanced Encryption Standard. This algorithm is the base for implementing security and privacy based on symmetric key solutions in almost all new applications. Secret key algorithms are used in combination with modes of operation to provide different security properties. The most used modes of operation are presented in this chapter. Finally an overview of the different techniques of software and hardware implementations is given.

Cortisol Secretion and Change in Sleep Problems in Early Childhood: Moderation by Maternal Overcontrol

PubMed Central

Kiel, Elizabeth J.; Hummel, Alexandra C.; Luebbe, Aaron M.

2015-01-01

Childhood sleep problems are prevalent and relate to a wide range of negative psychological outcomes. However, it remains unclear how biological processes, such as HPA activity, may predict sleep problems over time in childhood in the context of certain parenting environments. Fifty-one mothers and their 18–20 month-old toddlers participated in a short-term longitudinal study assessing how shared variance among morning levels, diurnal change, and nocturnal change in toddlers’ cortisol secretion predicted change in sleep problems in the context of maternal overprotection and critical control. A composite characterized by low variability in, and, to a lesser extent, high morning values of cortisol, predicted increasing sleep problems from age 2 to age 3 when mothers reported high critical control. Results suggest value in assessing shared variance among different indices of cortisol secretion patterns and the interaction between cortisol and the environment in predicting sleep problems in early childhood. PMID:25766262

Memory attacks on device-independent quantum cryptography.

PubMed

Barrett, Jonathan; Colbeck, Roger; Kent, Adrian

2013-01-04

Device-independent quantum cryptographic schemes aim to guarantee security to users based only on the output statistics of any components used, and without the need to verify their internal functionality. Since this would protect users against untrustworthy or incompetent manufacturers, sabotage, or device degradation, this idea has excited much interest, and many device-independent schemes have been proposed. Here we identify a critical weakness of device-independent protocols that rely on public communication between secure laboratories. Untrusted devices may record their inputs and outputs and reveal information about them via publicly discussed outputs during later runs. Reusing devices thus compromises the security of a protocol and risks leaking secret data. Possible defenses include securely destroying or isolating used devices. However, these are costly and often impractical. We propose other more practical partial defenses as well as a new protocol structure for device-independent quantum key distribution that aims to achieve composable security in the case of two parties using a small number of devices to repeatedly share keys with each other (and no other party).

Practical secure quantum communications

NASA Astrophysics Data System (ADS)

Diamanti, Eleni

2015-05-01

We review recent advances in the field of quantum cryptography, focusing in particular on practical implementations of two central protocols for quantum network applications, namely key distribution and coin flipping. The former allows two parties to share secret messages with information-theoretic security, even in the presence of a malicious eavesdropper in the communication channel, which is impossible with classical resources alone. The latter enables two distrustful parties to agree on a random bit, again with information-theoretic security, and with a cheating probability lower than the one that can be reached in a classical scenario. Our implementations rely on continuous-variable technology for quantum key distribution and on a plug and play discrete-variable system for coin flipping, and necessitate a rigorous security analysis adapted to the experimental schemes and their imperfections. In both cases, we demonstrate the protocols with provable security over record long distances in optical fibers and assess the performance of our systems as well as their limitations. The reported advances offer a powerful toolbox for practical applications of secure communications within future quantum networks.

Cortistatin Is a Key Factor Regulating the Sex-Dependent Response of the GH and Stress Axes to Fasting in Mice.

PubMed

Cordoba-Chacón, José; Gahete, Manuel D; Pozo-Salas, Ana I; de Lecea, Luis; Castaño, Justo P; Luque, Raúl M

2016-07-01

Cortistatin (CORT) shares high structural and functional similarities with somatostatin (SST) but displays unique sex-dependent pituitary actions. Indeed, although female CORT-knockout (CORT-KO) mice exhibit enhanced GH expression/secretion, Proopiomelanocortin expression, and circulating ACTH/corticosterone/ghrelin levels, male CORT-KO mice only display increased plasma GH/corticosterone levels. Changes in peripheral ghrelin and SST (rather than hypothalamic levels) seem to regulate GH/ACTH axes in CORT-KOs under fed conditions. Because changes in GH/ACTH axes during fasting provide important adaptive mechanisms, we sought to determine whether CORT absence influences GH/ACTH axes during fasting. Accordingly, fed and fasted male/female CORT-KO were compared with littermate controls. Fasting increased circulating GH levels in male/female controls but not in CORT-KO, suggesting that CORT can be a relevant regulator of GH secretion during fasting. However, GH levels were already higher in CORT-KO than in controls in fed state, which might preclude a further elevation in GH levels. Interestingly, although fasting-induced pituitary GH expression was elevated in both male/female controls, GH expression only increased in fasted female CORT-KOs, likely owing to specific changes observed in key factors controlling somatotrope responsiveness (ie, circulating ghrelin and IGF-1, and pituitary GHRH and ghrelin receptor expression). Fasting increased corticosterone levels in control and, most prominently, in CORT-KO mice, which might be associated with a desensitization to SST signaling and to an augmentation in CRH and ghrelin-signaling regulating corticotrope function. Altogether, these results provide compelling evidence that CORT plays a key, sex-dependent role in the regulation of the GH/ACTH axes in response to fasting.

On a simple attack, limiting the range transmission of secret keys in a system of quantum cryptography based on coding in a sub-carrier frequency

NASA Astrophysics Data System (ADS)

Klimov, A. N.; Kulik, S. P.; Molotkov, S. N.; Potapova, T. A.

2017-03-01

In the paper by Gleim et al (2016 Opt. Express 24 2619), it was declared that the system of quantum cryptography, exploiting quantum key distribution (QKD) protocol BB84 with the additional reference state and encoding in a sub-carrier, is able to distribute secret keys at a distance of 210 km. The following shows that a simple attack realized with a beam splitter results in a loss of privacy of the keys over substantially smaller distances. It turns out that the actual length of the secret key transmission for the QKD system encoding in the sub-carrier frequency is ten times less than that declared in Gleim et al (2016 Opt. Express 24 2619). Therefore it is impossible to safely use the keys when distributed at a larger length of the communication channel than shown below. The maximum communication distance does not exceed 22 km, even in the most optimistic scenario.

Comparative analysis of secretomes from Ectomycorrhizal fungi with an emphasis on small-secreted proteins

DOE PAGES

Pellegrin, Clement; Morin, Emmanuelle; Martin, Francis M.; ...

2015-11-18

Fungi are major players in the carbon cycle in forest ecosystems due to the wide range of interactions they have with plants either through soil degradation processes by litter decayers or biotrophic interactions with pathogenic and ectomycorrhizal symbionts. Secretion of fungal proteins mediates these interactions by allowing the fungus to interact with its environment and/or host. Ectomycorrhizal (ECM) symbiosis independently appeared several times throughout evolution and involves approximately 80% of trees. Despite extensive physiological studies on ECM symbionts, little is known about the composition and specificities of their secretomes. In this study, we used a bioinformatics pipeline to predict andmore » analyze the secretomes of 49 fungal species, including 11 ECM fungi, wood and soil decayers and pathogenic fungi to tackle the following questions: (1) Are there differences between the secretomes of saprophytic and ECM fungi? (2) Are small-secreted proteins (SSPs) more abundant in biotrophic fungi than in saprophytic fungi? and (3) Are there SSPs shared between ECM, saprotrophic and pathogenic fungi? We showed that the number of predicted secreted proteins is similar in the surveyed species, independently of their lifestyle. The secretome from ECM fungi is characterized by a restricted number of secreted CAZymes, but their repertoires of secreted proteases and lipases are similar to those of saprotrophic fungi. Focusing on SSPs, we showed that the secretome of ECM fungi is enriched in SSPs compared with other species. Most of the SSPs are coded by orphan genes with no known PFAM domain or similarities to known sequences in databases. Finally, based on the clustering analysis, we identified shared- and lifestyle-specific SSPs between saprotrophic and ECM fungi. The presence of SSPs is not limited to fungi interacting with living plants as the genome of saprotrophic fungi also code for numerous SSPs. As a result, ECM fungi shared lifestyle-specific SSPs likely involved in symbiosis that are good candidates for further functional analyses.« less

Comparative analysis of secretomes from Ectomycorrhizal fungi with an emphasis on small-secreted proteins

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pellegrin, Clement; Morin, Emmanuelle; Martin, Francis M.

Fungi are major players in the carbon cycle in forest ecosystems due to the wide range of interactions they have with plants either through soil degradation processes by litter decayers or biotrophic interactions with pathogenic and ectomycorrhizal symbionts. Secretion of fungal proteins mediates these interactions by allowing the fungus to interact with its environment and/or host. Ectomycorrhizal (ECM) symbiosis independently appeared several times throughout evolution and involves approximately 80% of trees. Despite extensive physiological studies on ECM symbionts, little is known about the composition and specificities of their secretomes. In this study, we used a bioinformatics pipeline to predict andmore » analyze the secretomes of 49 fungal species, including 11 ECM fungi, wood and soil decayers and pathogenic fungi to tackle the following questions: (1) Are there differences between the secretomes of saprophytic and ECM fungi? (2) Are small-secreted proteins (SSPs) more abundant in biotrophic fungi than in saprophytic fungi? and (3) Are there SSPs shared between ECM, saprotrophic and pathogenic fungi? We showed that the number of predicted secreted proteins is similar in the surveyed species, independently of their lifestyle. The secretome from ECM fungi is characterized by a restricted number of secreted CAZymes, but their repertoires of secreted proteases and lipases are similar to those of saprotrophic fungi. Focusing on SSPs, we showed that the secretome of ECM fungi is enriched in SSPs compared with other species. Most of the SSPs are coded by orphan genes with no known PFAM domain or similarities to known sequences in databases. Finally, based on the clustering analysis, we identified shared- and lifestyle-specific SSPs between saprotrophic and ECM fungi. The presence of SSPs is not limited to fungi interacting with living plants as the genome of saprotrophic fungi also code for numerous SSPs. As a result, ECM fungi shared lifestyle-specific SSPs likely involved in symbiosis that are good candidates for further functional analyses.« less

Comparative Analysis of Secretomes from Ectomycorrhizal Fungi with an Emphasis on Small-Secreted Proteins

PubMed Central

Pellegrin, Clement; Morin, Emmanuelle; Martin, Francis M.; Veneault-Fourrey, Claire

2015-01-01

Fungi are major players in the carbon cycle in forest ecosystems due to the wide range of interactions they have with plants either through soil degradation processes by litter decayers or biotrophic interactions with pathogenic and ectomycorrhizal symbionts. Secretion of fungal proteins mediates these interactions by allowing the fungus to interact with its environment and/or host. Ectomycorrhizal (ECM) symbiosis independently appeared several times throughout evolution and involves approximately 80% of trees. Despite extensive physiological studies on ECM symbionts, little is known about the composition and specificities of their secretomes. In this study, we used a bioinformatics pipeline to predict and analyze the secretomes of 49 fungal species, including 11 ECM fungi, wood and soil decayers and pathogenic fungi to tackle the following questions: (1) Are there differences between the secretomes of saprophytic and ECM fungi? (2) Are small-secreted proteins (SSPs) more abundant in biotrophic fungi than in saprophytic fungi? and (3) Are there SSPs shared between ECM, saprotrophic and pathogenic fungi? We showed that the number of predicted secreted proteins is similar in the surveyed species, independently of their lifestyle. The secretome from ECM fungi is characterized by a restricted number of secreted CAZymes, but their repertoires of secreted proteases and lipases are similar to those of saprotrophic fungi. Focusing on SSPs, we showed that the secretome of ECM fungi is enriched in SSPs compared with other species. Most of the SSPs are coded by orphan genes with no known PFAM domain or similarities to known sequences in databases. Finally, based on the clustering analysis, we identified shared- and lifestyle-specific SSPs between saprotrophic and ECM fungi. The presence of SSPs is not limited to fungi interacting with living plants as the genome of saprotrophic fungi also code for numerous SSPs. ECM fungi shared lifestyle-specific SSPs likely involved in symbiosis that are good candidates for further functional analyses. PMID:26635749

Quantum-Secret-Sharing Scheme Based on Local Distinguishability of Orthogonal Seven-Qudit Entangled States

NASA Astrophysics Data System (ADS)

Liu, Cheng-Ji; Li, Zhi-Hui; Bai, Chen-Ming; Si, Meng-Meng

2018-02-01

The concept of judgment space was proposed by Wang et al. (Phys. Rev. A 95, 022320, 2017), which was used to study some important properties of quantum entangled states based on local distinguishability. In this study, we construct 15 kinds of seven-qudit quantum entangled states in the sense of permutation, calculate their judgment space and propose a distinguishability rule to make the judgment space more clearly. Based on this rule, we study the local distinguishability of the 15 kinds of seven-qudit quantum entangled states and then propose a ( k, n) threshold quantum secret sharing scheme. Finally, we analyze the security of the scheme.

Jones index, secret sharing and total quantum dimension

NASA Astrophysics Data System (ADS)

Fiedler, Leander; Naaijkens, Pieter; Osborne, Tobias J.

2017-02-01

We study the total quantum dimension in the thermodynamic limit of topologically ordered systems. In particular, using the anyons (or superselection sectors) of such models, we define a secret sharing scheme, storing information invisible to a malicious party, and argue that the total quantum dimension quantifies how well we can perform this task. We then argue that this can be made mathematically rigorous using the index theory of subfactors, originally due to Jones and later extended by Kosaki and Longo. This theory provides us with a ‘relative entropy’ of two von Neumann algebras and a quantum channel, and we argue how these can be used to quantify how much classical information two parties can hide form an adversary. We also review the total quantum dimension in finite systems, in particular how it relates to topological entanglement entropy. It is known that the latter also has an interpretation in terms of secret sharing schemes, although this is shown by completely different methods from ours. Our work provides a different and independent take on this, which at the same time is completely mathematically rigorous. This complementary point of view might be beneficial, for example, when studying the stability of the total quantum dimension when the system is perturbed.

A Secure and Efficient Scalable Secret Image Sharing Scheme with Flexible Shadow Sizes.

PubMed

Xie, Dong; Li, Lixiang; Peng, Haipeng; Yang, Yixian

2017-01-01

In a general (k, n) scalable secret image sharing (SSIS) scheme, the secret image is shared by n participants and any k or more than k participants have the ability to reconstruct it. The scalability means that the amount of information in the reconstructed image scales in proportion to the number of the participants. In most existing SSIS schemes, the size of each image shadow is relatively large and the dealer does not has a flexible control strategy to adjust it to meet the demand of differen applications. Besides, almost all existing SSIS schemes are not applicable under noise circumstances. To address these deficiencies, in this paper we present a novel SSIS scheme based on a brand-new technique, called compressed sensing, which has been widely used in many fields such as image processing, wireless communication and medical imaging. Our scheme has the property of flexibility, which means that the dealer can achieve a compromise between the size of each shadow and the quality of the reconstructed image. In addition, our scheme has many other advantages, including smooth scalability, noise-resilient capability, and high security. The experimental results and the comparison with similar works demonstrate the feasibility and superiority of our scheme.

Distributed metadata servers for cluster file systems using shared low latency persistent key-value metadata store

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bent, John M.; Faibish, Sorin; Pedone, Jr., James M.

A cluster file system is provided having a plurality of distributed metadata servers with shared access to one or more shared low latency persistent key-value metadata stores. A metadata server comprises an abstract storage interface comprising a software interface module that communicates with at least one shared persistent key-value metadata store providing a key-value interface for persistent storage of key-value metadata. The software interface module provides the key-value metadata to the at least one shared persistent key-value metadata store in a key-value format. The shared persistent key-value metadata store is accessed by a plurality of metadata servers. A metadata requestmore » can be processed by a given metadata server independently of other metadata servers in the cluster file system. A distributed metadata storage environment is also disclosed that comprises a plurality of metadata servers having an abstract storage interface to at least one shared persistent key-value metadata store.« less

Quantum-locked key distribution at nearly the classical capacity rate.

PubMed

Lupo, Cosmo; Lloyd, Seth

2014-10-17

Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This violation mirrors a large gap existing between two security criteria for quantum cryptography quantified by two entropic quantities: the Holevo information and the accessible information. We show that the latter becomes a sensible security criterion if an upper bound on the coherence time of the eavesdropper's quantum memory is known. Under this condition, we introduce a protocol for secret key generation through a memoryless qudit channel. For channels with enough symmetry, such as the d-dimensional erasure and depolarizing channels, this protocol allows secret key generation at an asymptotic rate as high as the classical capacity minus one bit.

Common and Distinct Capsid and Surface Protein Requirements for Secretion of Complete and Genome-free Hepatitis B Virions.

PubMed

Ning, Xiaojun; Luckenbaugh, Laurie; Liu, Kuancheng; Bruss, Volker; Sureau, Camille; Hu, Jianming

2018-05-09

During the morphogenesis of hepatitis B virus (HBV), an enveloped virus, two types of virions are secreted: (1) a minor population of complete virions containing a mature nucleocapsid with the characteristic, partially double-stranded, relaxed circular DNA genome and (2) a major population containing an empty capsid with no DNA or RNA (empty virions). Secretion of both types of virions requires interactions between the HBV capsid or core protein (HBc) and the viral surface or envelope proteins. We have studied the requirements from both HBc and envelope proteins for empty virion secretion, in comparison with those for secretion of complete virions. Substitutions within the N-terminal domain of HBc that block secretion of DNA-containing virions reduced but did not prevent secretion of empty virions. The HBc C-terminal domain was not essential for empty virion secretion. Among the three viral envelope proteins, the smallest, S, alone was sufficient for empty virion secretion at a basal level. The largest protein, L, essential for complete virion secretion, was not required for, but could stimulate empty virion secretion. Also, substitutions in L that eliminate secretion of complete virions reduced but did not eliminate empty virion secretion. S mutations that block secretion of the hepatitis D virus (HDV), an HBV satellite, did not block secretion of either empty or complete HBV virions. Together, these results indicate that both common and distinct signals on empty capsids vs. mature nucleocapsids interact with the S and L proteins during the formation of complete vs. empty virions. IMPORTANCE Hepatitis B virus (HBV) is a major cause of severe liver diseases including cirrhosis and cancer. In addition to the complete infectious virion particle, which contains an outer envelope layer and an interior capsid that, in turn, encloses a DNA genome, HBV infected cells also secrete non-infectious, incomplete viral particles in large excess over the complete virions. In particular, the empty (or genome-free) virion share with the complete virion the outer envelope and interior capsid but contain no genome. We have carried out a comparative study on the capsid and envelope requirements for the secretion of these two types of virion particles and uncovered both shared and distinct determinants on the capsid and envelope for their secretion. These results provide new information on HBV morphogenesis, and have implications for efforts to develop empty HBV virions as a novel biomarker and a new generation of HBV vaccine. Copyright © 2018 American Society for Microbiology.

The Virginia Slims identity crisis: an inside look at tobacco industry marketing to women

PubMed Central

Toll, B; Ling, P

2005-01-01

Objectives: Because no prior studies have comprehensively analysed previously secret tobacco industry documents describing marketing female brands, the Virginia Slims brand was studied to explore how Philip Morris and competitors develop and adapt promotional campaigns targeting women. Methods: Analysis of previously secret tobacco industry documents. The majority of the documents used were from Philip Morris. Results: The key to Virginia Slims advertising was creating an aspirational image which women associated with the brand. Virginia Slims co-opted women's liberation slogans to build a modern female image from 1968 through to the 1980s, and its market share grew from 0.24% to 3.16% during that time period. Ironically, the feminist image that worked very well for the brand was also the reason for its subsequent problems. Philip Morris experienced unprecedented losses in market share in the early 1990s, with a decline in market share for four consecutive years from 3.16% to 2.26%; they attributed this decline to both the fact that the brand's feminist image no longer appealed to young women aged 18–24 years, and increased competition from more contemporary and lower priced competitors. Throughout the 1990s, attempts to reacquire young women while retaining Virginia Slims loyal (now older) smokers were made using a "King Size" line extension, new slogans, and loyalty building promotions. Conclusions: Tobacco advertisers initially created distinct female brands with aspirational images; continued appeal to young women was critical for long term growth. The need for established brands to evolve to maintain relevance to young women creates an opportunity for tobacco counter-marketing, which should undermine tobacco brand imagery and promote aspirational smoke-free lifestyle images. Young women age 18–24 are extremely valuable to the tobacco industry and should be a focus for tobacco control programmes. PMID:15923467

Continuous-variable quantum key distribution protocols over noisy channels.

PubMed

García-Patrón, Raúl; Cerf, Nicolas J

2009-04-03

A continuous-variable quantum key distribution protocol based on squeezed states and heterodyne detection is introduced and shown to attain higher secret key rates over a noisy line than any other one-way Gaussian protocol. This increased resistance to channel noise can be understood as resulting from purposely adding noise to the signal that is converted into the secret key. This notion of noise-enhanced tolerance to noise also provides a better physical insight into the poorly understood discrepancies between the previously defined families of Gaussian protocols.

The evolution of siderophore production as a competitive trait.

PubMed

Niehus, Rene; Picot, Aurore; Oliveira, Nuno M; Mitri, Sara; Foster, Kevin R

2017-06-01

Microbes have the potential to be highly cooperative organisms. The archetype of microbial cooperation is often considered to be the secretion of siderophores, molecules scavenging iron, where cooperation is threatened by "cheater" genotypes that use siderophores without making them. Here, we show that this view neglects a key piece of biology: siderophores are imported by specific receptors that constrain their use by competing strains. We study the effect of this specificity in an ecoevolutionary model, in which we vary siderophore sharing among strains, and compare fully shared siderophores with private siderophores. We show that privatizing siderophores fundamentally alters their evolution. Rather than a canonical cooperative good, siderophores become a competitive trait used to pillage iron from other strains. We also study the physiological regulation of siderophores using in silico long-term evolution. Although shared siderophores evolve to be downregulated in the presence of a competitor, as expected for a cooperative trait, privatized siderophores evolve to be upregulated. We evaluate these predictions using published experimental work, which suggests that some siderophores are upregulated in response to competition akin to competitive traits like antibiotics. Although siderophores can act as a cooperative good for single genotypes, we argue that their role in competition is fundamental to understanding their biology. © 2017 The Author(s). Evolution © 2017 The Society for the Study of Evolution.

Suppression of Langerhans cell activation is conserved amongst human papillomavirus α and β genotypes, but not a µ genotype.

PubMed

Da Silva, Diane M; Movius, Carly A; Raff, Adam B; Brand, Heike E; Skeate, Joseph G; Wong, Michael K; Kast, W Martin

2014-03-01

Human papillomavirus (HPV) has evolved mechanisms that allow it to evade the human immune system. Studies have shown HPV-mediated suppression of activation of Langerhans cells (LC) is a key mechanism through which HPV16 evades initial immune surveillance. However, it has not been established whether high- and low-risk mucosal and cutaneous HPV genotypes share a common mechanism of immune suppression. Here, we demonstrate that LC exposed to capsids of HPV types 18, 31, 45, 11, (alpha-papillomaviruses) and HPV5 (beta-papillomavirus) similarly suppress LC activation, including lack of costimulatory molecule expression, lack of cytokine and chemokine secretion, lack of migration, and deregulated cellular signaling. In contrast, HPV1 (mu-papillomavirus) induced costimulatory molecule and cytokine upregulation, but LC migration and cellular signaling was suppressed. These results suggest that alpha and beta HPV genotypes, and partially a mu genotype, share a conserved mechanism of immune escape that enables these viruses to remain undetected in the absence of other inflammatory events. Copyright © 2014 Elsevier Inc. All rights reserved.

Vascular endothelial growth factor A (VEGF-A) decreases expression and secretion of pleiotrophin in a VEGF receptor-independent manner.

PubMed

Poimenidi, Evangelia; Theodoropoulou, Christina; Koutsioumpa, Marina; Skondra, Lamprini; Droggiti, Eirini; van den Broek, Marloes; Koolwijk, Pieter; Papadimitriou, Evangelia

2016-05-01

Vascular endothelial growth factor A (VEGF-A) is a key molecule in angiogenesis acting through VEGF receptors (VEGFRs), ανβ3 integrin, receptor protein tyrosine phosphatase beta/zeta (RPTPβ/ζ) and cell surface nucleolin (NCL). Pleiotrophin (PTN) stimulates endothelial cell migration and limits the angiogenic effects of VEGF-A165 to the levels of its own effect, possibly acting as a VEGF-A165 modifier. Since PTN and VEGF-A165 share receptors and actions on endothelial cells, in the present work we studied whether and how VEGF-A165 affects PTN expression or secretion. VEGF-A165 decreased PTN mRNA and protein levels acting at the transcriptional level. Bevacizumab, a selective VEGFR2 tyrosine kinase inhibitor and down-regulation of VEGFR2 expression by siRNA did not affect this decrease, suggesting that it is VEGFR-independent. VEGF-A121 also decreased PTN mRNA and protein levels, suggesting that heparin binding of VEGF-A165 is not involved. Blockage of cell surface NCL, lack of expression or mutation of β3 integrin and down-regulation of RPTPβ/ζ abolished the inhibitory effect of VEGF-A165 on PTN expression and secretion. Down-regulation of endogenous PTN in endothelial cells enhanced VEGF-A165-induced increase in migration and tube formation on matrigel. Collectively, these data suggest that VEGF-A down-regulates PTN expression and secretion through the RPTPβ/ζ-ανβ3-NCL axis to enhance its own effect on cell migration and further highlight the role of RPTPβ/ζ in VEGF-A actions. Copyright © 2016 Elsevier Inc. All rights reserved.

Differential Fault Analysis on CLEFIA with 128, 192, and 256-Bit Keys

NASA Astrophysics Data System (ADS)

Takahashi, Junko; Fukunaga, Toshinori

This paper describes a differential fault analysis (DFA) attack against CLEFIA. The proposed attack can be applied to CLEFIA with all supported keys: 128, 192, and 256-bit keys. DFA is a type of side-channel attack. This attack enables the recovery of secret keys by injecting faults into a secure device during its computation of the cryptographic algorithm and comparing the correct ciphertext with the faulty one. CLEFIA is a 128-bit blockcipher with 128, 192, and 256-bit keys developed by the Sony Corporation in 2007. CLEFIA employs a generalized Feistel structure with four data lines. We developed a new attack method that uses this characteristic structure of the CLEFIA algorithm. On the basis of the proposed attack, only 2 pairs of correct and faulty ciphertexts are needed to retrieve the 128-bit key, and 10.78 pairs on average are needed to retrieve the 192 and 256-bit keys. The proposed attack is more efficient than any previously reported. In order to verify the proposed attack and estimate the calculation time to recover the secret key, we conducted an attack simulation using a PC. The simulation results show that we can obtain each secret key within three minutes on average. This result shows that we can obtain the entire key within a feasible computational time.

Optical multiple-image hiding based on interference and grating modulation

NASA Astrophysics Data System (ADS)

He, Wenqi; Peng, Xiang; Meng, Xiangfeng

2012-07-01

We present a method for multiple-image hiding on the basis of interference-based encryption architecture and grating modulation. By using a modified phase retrieval algorithm, we can separately hide a number of secret images into one arbitrarily preselected host image associated with a set of phase-only masks (POMs), which are regarded as secret keys. Thereafter, a grating modulation operation is introduced to multiplex and store the different POMs into a single key mask, which is then assigned to the authorized users in privacy. For recovery, after an appropriate demultiplexing process, one can reconstruct the distributions of all the secret keys and then recover the corresponding hidden images with suppressed crosstalk. Computer simulation results are presented to validate the feasibility of our approach.

Method for adding nodes to a quantum key distribution system

DOEpatents

Grice, Warren P

2015-02-24

An improved quantum key distribution (QKD) system and method are provided. The system and method introduce new clients at intermediate points along a quantum channel, where any two clients can establish a secret key without the need for a secret meeting between the clients. The new clients perform operations on photons as they pass through nodes in the quantum channel, and participate in a non-secret protocol that is amended to include the new clients. The system and method significantly increase the number of clients that can be supported by a conventional QKD system, with only a modest increase in cost. The system and method are compatible with a variety of QKD schemes, including polarization, time-bin, continuous variable and entanglement QKD.

Counselling against HIV in Africa: a genealogy of confessional technologies.

PubMed

Nguyen, Vinh-Kim

2013-01-01

This paper contextualises counselling within a broader historical formation that links disclosure to healing and deploys confessional technologies to incite disclosure and awareness of the mysterious substance of the self. Foucault's argument that sexuality was the privileged arena for using confessional technologies to 'produce' the truth of the self is particularly relevant in light of the diffusion of counselling practices in Africa in the wake of the HIV epidemic, particularly with their emphasis on inciting appropriate sexual behaviour. Examination of the historical assemblage of counselling practices shows how they articulate what the self is, the nature of truth and a politics of language. This paper focuses on the genealogy of four key assumptions that express this confessional reason. These are that: (1) people can be 'empowered' to have control on their own lives by working on themselves, (2) secrets untold become pathogens, (3) the ability to heal requires that one first overcome personal illness, (4) the experience of sharing secrets is cathartic and healing. The genealogy intertwines four strands: that of the Unconscious as revealed by Freud and his followers, attempts to treat shell-shocked veterans of World War I, group psychotherapy and participatory research after World War II.

A disulfide-bond A oxidoreductase-like protein (DsbA-L) regulates adiponectin multimerization

PubMed Central

Liu, Meilian; Zhou, Lijun; Xu, Aimin; Lam, Karen S. L.; Wetzel, Michael D.; Xiang, Ruihua; Zhang, Jingjing; Xin, Xiaoban; Dong, Lily Q.; Liu, Feng

2008-01-01

Impairments in adiponectin multimerization lead to defects in adiponectin secretion and function and are associated with diabetes, yet the underlying mechanisms remain largely unknown. We have identified an adiponectin-interacting protein, previously named GST-kappa, by yeast 2-hybrid screening. The adiponectin-interacting protein contains 2 thioredoxin domains and has very little sequence similarity to other GST isoforms. However, this protein shares high sequence and secondary structure homology to bacterial disulfide-bond A oxidoreductase (DsbA) and is thus renamed DsbA-like protein (DsbA-L). DsbA-L is highly expressed in adipose tissue, and its expression level is negatively correlated with obesity in mice and humans. DsbA-L expression in 3T3-L1 adipocytes is stimulated by the insulin sensitizer rosiglitazone and inhibited by the inflammatory cytokine TNFα. Overexpression of DsbA-L promoted adiponectin multimerization while suppressing DsbA-L expression by RNAi markedly and selectively reduced adiponectin levels and secretion in 3T3-L1 adipocytes. Our results identify DsbA-L as a key regulator for adiponectin biosynthesis and uncover a potential new target for developing therapeutic drugs for the treatment of insulin resistance and its associated metabolic disorders. PMID:19011089

Type IV Pili in Gram-Positive Bacteria

PubMed Central

Craig, Lisa

2013-01-01

SUMMARY Type IV pili (T4P) are surface-exposed fibers that mediate many functions in bacteria, including locomotion, adherence to host cells, DNA uptake (competence), and protein secretion and that can act as nanowires carrying electric current. T4P are composed of a polymerized protein, pilin, and their assembly apparatuses share protein homologs with type II secretion systems in eubacteria and the flagella of archaea. T4P are found throughout Gram-negative bacterial families and have been studied most extensively in certain model Gram-negative species. Recently, it was discovered that T4P systems are also widespread among Gram-positive species, in particular the clostridia. Since Gram-positive and Gram-negative bacteria have many differences in cell wall architecture and other features, it is remarkable how similar the T4P core proteins are between these organisms, yet there are many key and interesting differences to be found as well. In this review, we compare the two T4P systems and identify and discuss the features they have in common and where they differ to provide a very broad-based view of T4P systems across all eubacterial species. PMID:24006467

How to implement decoy-state quantum key distribution for a satellite uplink with 50-dB channel loss

NASA Astrophysics Data System (ADS)

Meyer-Scott, Evan; Yan, Zhizhong; MacDonald, Allison; Bourgoin, Jean-Philippe; Hübel, Hannes; Jennewein, Thomas

2011-12-01

Quantum key distribution (QKD) takes advantage of fundamental properties of quantum physics to allow two distant parties to share a secret key; however, QKD is hampered by a distance limitation of a few hundred kilometers on Earth. The most immediate solution for global coverage is to use a satellite, which can receive separate QKD transmissions from two or more ground stations and act as a trusted node to link these ground stations. In this article we report on a system capable of performing QKD in the high loss regime expected in an uplink to a satellite using weak coherent pulses and decoy states. Such a scenario profits from the simplicity of its receiver payload, but has so far been considered to be infeasible due to very high transmission losses (40-50 dB). The high loss is overcome by implementing an innovative photon source and advanced timing analysis. Our system handles up to 57 dB photon loss in the infinite key limit, confirming the viability of the satellite uplink scenario. We emphasize that while this system was designed with a satellite uplink in mind, it could just as easily overcome high losses on any free space QKD link.

Coherent one-way quantum key distribution

NASA Astrophysics Data System (ADS)

Stucki, Damien; Fasel, Sylvain; Gisin, Nicolas; Thoma, Yann; Zbinden, Hugo

2007-05-01

Quantum Key Distribution (QKD) consists in the exchange of a secrete key between two distant points [1]. Even if quantum key distribution systems exist and commercial systems are reaching the market [2], there are still improvements to be made: simplify the construction of the system; increase the secret key rate. To this end, we present a new protocol for QKD tailored to work with weak coherent pulses and at high bit rates [3]. The advantages of this system are that the setup is experimentally simple and it is tolerant to reduced interference visibility and to photon number splitting attacks, thus resulting in a high efficiency in terms of distilled secret bits per qubit. After having successfully tested the feasibility of the system [3], we are currently developing a fully integrated and automated prototype within the SECOQC project [4]. We present the latest results using the prototype. We also discuss the issue of the photon detection, which still remains the bottleneck for QKD.

Performance improvement of eight-state continuous-variable quantum key distribution with an optical amplifier

NASA Astrophysics Data System (ADS)

Guo, Ying; Li, Renjie; Liao, Qin; Zhou, Jian; Huang, Duan

2018-02-01

Discrete modulation is proven to be beneficial to improving the performance of continuous-variable quantum key distribution (CVQKD) in long-distance transmission. In this paper, we suggest a construct to improve the maximal generated secret key rate of discretely modulated eight-state CVQKD using an optical amplifier (OA) with a slight cost of transmission distance. In the proposed scheme, an optical amplifier is exploited to compensate imperfection of Bob's apparatus, so that the generated secret key rate of eight-state protocol is enhanced. Specifically, we investigate two types of optical amplifiers, phase-insensitive amplifier (PIA) and phase-sensitive amplifier (PSA), and thereby obtain approximately equivalent improved performance for eight-state CVQKD system when applying these two different amplifiers. Numeric simulation shows that the proposed scheme can well improve the generated secret key rate of eight-state CVQKD in both asymptotic limit and finite-size regime. We also show that the proposed scheme can achieve the relatively high-rate transmission at long-distance communication system.

Seeking to Expand Middle Level Success to All Students: A Not-So-Secret Recipe

ERIC Educational Resources Information Center

White, Jesse

2014-01-01

The recipe for success of Strive Preparatory Charter School (formerly West Denver Preparatory Charter School) is not a secret. This summer program, turned four-campus, middle level phenomenon, is proving to satisfy the appetite of parents hungry for a change in their children's educational opportunities. The intent of this article is to share a…

"It is the 'starting over' part that is so hard": Using an online group to support hospice bereavement.

PubMed

Wittenberg-Lyles, Elaine; Washington, Karla; Oliver, Debra Parker; Shaunfield, Sara; Gage, L Ashley; Mooney, Megan; Lewis, Alexandria

2015-04-01

Although hospice agencies are required to provide informal caregivers (family or friends of the patient) with formal bereavement support when their loved one passes, most bereavement interventions lack standardization and remain untested. We employed the Dual Processing Model of Bereavement as a theoretical framework for assessing the potential of a secret Facebook group for bereaved hospice caregivers. A mixed-methods approach was utilized to analyze online communication (posts and comments) in the secret Facebook group, and self-reported outcome measures on depression and anxiety were compared pre- and post-intervention. Sixteen caregivers participated in the secret Facebook group over a period of nine months. The majority of online talk was oriented to restoration, revealing abrupt and anticipated triggers that evoked feelings of loss. Caregivers also shared loss orientation through storytelling, sharing and giving advice, and encouraging others to manage the challenges of coping. Caregiver anxiety and depression were lower after the intervention. This pilot study provides insight into the use of a secret Facebook group to facilitate bereavement support to caregivers. Findings highlight the promise of Facebook for hospice bereavement support. Providers and researchers are encouraged to explore the positive outcomes associated with bereavement support.

Two-out-of-two color matching based visual cryptography schemes.

PubMed

Machizaud, Jacques; Fournel, Thierry

2012-09-24

Visual cryptography which consists in sharing a secret message between transparencies has been extended to color prints. In this paper, we propose a new visual cryptography scheme based on color matching. The stacked printed media reveal a uniformly colored message decoded by the human visual system. In contrast with the previous color visual cryptography schemes, the proposed one enables to share images without pixel expansion and to detect a forgery as the color of the message is kept secret. In order to correctly print the colors on the media and to increase the security of the scheme, we use spectral models developed for color reproduction describing printed colors from an optical point of view.

A novel secret sharing with two users based on joint transform correlator and compressive sensing

NASA Astrophysics Data System (ADS)

Zhao, Tieyu; Chi, Yingying

2018-05-01

Recently, joint transform correlator (JTC) has been widely applied to image encryption and authentication. This paper presents a novel secret sharing scheme with two users based on JTC. Two users must be present during the decryption that the system has high security and reliability. In the scheme, two users use their fingerprints to encrypt plaintext, and they can decrypt only if both of them provide the fingerprints which are successfully authenticated. The linear relationship between the plaintext and ciphertext is broken using the compressive sensing, which can resist existing attacks on JTC. The results of the theoretical analysis and numerical simulation confirm the validity of the system.

Salivary Glands in Predatory Mollusks: Evolutionary Considerations.

PubMed

Ponte, Giovanna; Modica, Maria Vittoria

2017-01-01

Many marine mollusks attain or increase their predatory efficiency using complex chemical secretions, which are often produced and delivered through specialized anatomical structures of the foregut. The secretions produced in venom glands of Conus snails and allies have been extensively studied, revealing an amazing chemical diversity of small, highly constrained neuropeptides, whose characterization led to significant pharmacological developments. Conversely, salivary glands, the other main secretory structures of molluscan foregut, have been neglected despite their shared occurrence in the two lineages including predatory members: Gastropoda and Cephalopoda. Over the last few years, the interest for the chemistry of salivary mixtures increased based on their potential biomedical applications. Recent investigation with -omics technologies are complementing the classical biochemical descriptions, that date back to the 1950s, highlighting the high level of diversification of salivary secretions in predatory mollusks, and suggesting they can be regarded as a pharmaceutical cornucopia. As with other animal venoms, some of the salivary toxins are reported to target, for example, sodium and/or potassium ion channels or receptors and transporters for neurotransmitters such as, glutamate, serotonin, neurotensin, and noradrenaline, thus manipulating the neuromuscular system of the preys. Other bioactive components possess anticoagulant, anesthetic and hypotensive activities. Here, we overview available knowledge on the salivary glands of key predatory molluscan taxa, gastropods, and cephalopods, summarizing their anatomical, physiological and biochemical complexity in order to facilitate future comparative studies on main evolutionary trends and functional convergence in the acquisition of successful predatory strategies.

Salivary Glands in Predatory Mollusks: Evolutionary Considerations

PubMed Central

Ponte, Giovanna; Modica, Maria Vittoria

2017-01-01

Many marine mollusks attain or increase their predatory efficiency using complex chemical secretions, which are often produced and delivered through specialized anatomical structures of the foregut. The secretions produced in venom glands of Conus snails and allies have been extensively studied, revealing an amazing chemical diversity of small, highly constrained neuropeptides, whose characterization led to significant pharmacological developments. Conversely, salivary glands, the other main secretory structures of molluscan foregut, have been neglected despite their shared occurrence in the two lineages including predatory members: Gastropoda and Cephalopoda. Over the last few years, the interest for the chemistry of salivary mixtures increased based on their potential biomedical applications. Recent investigation with -omics technologies are complementing the classical biochemical descriptions, that date back to the 1950s, highlighting the high level of diversification of salivary secretions in predatory mollusks, and suggesting they can be regarded as a pharmaceutical cornucopia. As with other animal venoms, some of the salivary toxins are reported to target, for example, sodium and/or potassium ion channels or receptors and transporters for neurotransmitters such as, glutamate, serotonin, neurotensin, and noradrenaline, thus manipulating the neuromuscular system of the preys. Other bioactive components possess anticoagulant, anesthetic and hypotensive activities. Here, we overview available knowledge on the salivary glands of key predatory molluscan taxa, gastropods, and cephalopods, summarizing their anatomical, physiological and biochemical complexity in order to facilitate future comparative studies on main evolutionary trends and functional convergence in the acquisition of successful predatory strategies. PMID:28848453

Study on the key technology of optical encryption based on compressive ghost imaging with double random-phase encoding

NASA Astrophysics Data System (ADS)

Zhang, Leihong; Pan, Zilan; Liang, Dong; Ma, Xiuhua; Zhang, Dawei

2015-12-01

An optical encryption method based on compressive ghost imaging (CGI) with double random-phase encoding (DRPE), named DRPE-CGI, is proposed. The information is first encrypted by the sender with DRPE, the DRPE-coded image is encrypted by the system of computational ghost imaging with a secret key. The key of N random-phase vectors is generated by the sender and will be shared with the receiver who is the authorized user. The receiver decrypts the DRPE-coded image with the key, with the aid of CGI and a compressive sensing technique, and then reconstructs the original information by the technique of DRPE-decoding. The experiments suggest that cryptanalysts cannot get any useful information about the original image even if they eavesdrop 60% of the key at a given time, so the security of DRPE-CGI is higher than that of the security of conventional ghost imaging. Furthermore, this method can reduce 40% of the information quantity compared with ghost imaging while the qualities of reconstructing the information are the same. It can also improve the quality of the reconstructed plaintext information compared with DRPE-GI with the same sampling times. This technique can be immediately applied to encryption and data storage with the advantages of high security, fast transmission, and high quality of reconstructed information.

Secrets and Misperceptions: The Creation of Self-Fulfilling Illusions

PubMed Central

Cowan, Sarah K.

2015-01-01

This study examines who hears what secrets, comparing two similar secrets-one that is highly stigmatized and one that is less so. Using a unique survey representative of American adults and intake forms from a medical clinic, I document marked differences in who hears these secrets. People who are sympathetic to the stigmatizing secret are more likely to hear of it than those who may react negatively. This is a consequence of people not just selectively disclosing their own secrets but selectively sharing others’ as well. As a result, people in the same social network will be exposed to and influenced by different information about those they know and hence experience that network differently. When people effectively exist in networks tailored by others not to offend, then the information they hear tends to be that of which they already approve. Were they to hear secrets they disapproved of, then their attitudes might change, but they are less likely to hear those secrets. As such, the patterns of secret hearing contribute to a stasis in public opinion. PMID:26082932

Secreting and sensing the same molecule allows cells to achieve versatile social behaviors

PubMed Central

Youk, Hyun; Lim, Wendell A.

2014-01-01

Cells that secrete and sense the same signaling molecule are ubiquitous. To uncover the functional capabilities of the core ‘secrete-and-sense’ circuit motif shared by these cells, we engineered yeast to secrete and sense the mating pheromone. Perturbing each circuit element revealed parameters that control the degree to which the cell communicated with itself versus with its neighbors. This tunable interplay of self- and neighbor-communication enables cells to span a diverse repertoire of cellular behaviors. These include a cell being asocial by responding only to itself, social through quorum sensing and an isogenic population of cells splitting into social and asocial subpopulations. A mathematical model explained these behaviors. The versatility of the secrete-and-sense circuit motif may explain its recurrence across species. PMID:24503857

A Secure and Efficient Scalable Secret Image Sharing Scheme with Flexible Shadow Sizes

PubMed Central

Xie, Dong; Li, Lixiang; Peng, Haipeng; Yang, Yixian

2017-01-01

In a general (k, n) scalable secret image sharing (SSIS) scheme, the secret image is shared by n participants and any k or more than k participants have the ability to reconstruct it. The scalability means that the amount of information in the reconstructed image scales in proportion to the number of the participants. In most existing SSIS schemes, the size of each image shadow is relatively large and the dealer does not has a flexible control strategy to adjust it to meet the demand of differen applications. Besides, almost all existing SSIS schemes are not applicable under noise circumstances. To address these deficiencies, in this paper we present a novel SSIS scheme based on a brand-new technique, called compressed sensing, which has been widely used in many fields such as image processing, wireless communication and medical imaging. Our scheme has the property of flexibility, which means that the dealer can achieve a compromise between the size of each shadow and the quality of the reconstructed image. In addition, our scheme has many other advantages, including smooth scalability, noise-resilient capability, and high security. The experimental results and the comparison with similar works demonstrate the feasibility and superiority of our scheme. PMID:28072851

Protein kinase C mediates platelet secretion and thrombus formation through protein kinase D2.

PubMed

Konopatskaya, Olga; Matthews, Sharon A; Harper, Matthew T; Gilio, Karen; Cosemans, Judith M E M; Williams, Christopher M; Navarro, Maria N; Carter, Deborah A; Heemskerk, Johan W M; Leitges, Michael; Cantrell, Doreen; Poole, Alastair W

2011-07-14

Platelets are highly specialized blood cells critically involved in hemostasis and thrombosis. Members of the protein kinase C (PKC) family have established roles in regulating platelet function and thrombosis, but the molecular mechanisms are not clearly understood. In particular, the conventional PKC isoform, PKCα, is a major regulator of platelet granule secretion, but the molecular pathway from PKCα to secretion is not defined. Protein kinase D (PKD) is a family of 3 kinases activated by PKC, which may represent a step in the PKC signaling pathway to secretion. In the present study, we show that PKD2 is the sole PKD member regulated downstream of PKC in platelets, and that the conventional, but not novel, PKC isoforms provide the upstream signal. Platelets from a gene knock-in mouse in which 2 key phosphorylation sites in PKD2 have been mutated (Ser707Ala/Ser711Ala) show a significant reduction in agonist-induced dense granule secretion, but not in α-granule secretion. This deficiency in dense granule release was responsible for a reduced platelet aggregation and a marked reduction in thrombus formation. Our results show that in the molecular pathway to secretion, PKD2 is a key component of the PKC-mediated pathway to platelet activation and thrombus formation through its selective regulation of dense granule secretion.

Long-distance practical quantum key distribution by entanglement swapping.

PubMed

Scherer, Artur; Sanders, Barry C; Tittel, Wolfgang

2011-02-14

We develop a model for practical, entanglement-based long-distance quantum key distribution employing entanglement swapping as a key building block. Relying only on existing off-the-shelf technology, we show how to optimize resources so as to maximize secret key distribution rates. The tools comprise lossy transmission links, such as telecom optical fibers or free space, parametric down-conversion sources of entangled photon pairs, and threshold detectors that are inefficient and have dark counts. Our analysis provides the optimal trade-off between detector efficiency and dark counts, which are usually competing, as well as the optimal source brightness that maximizes the secret key rate for specified distances (i.e. loss) between sender and receiver.

Sequential Quantum Secret Sharing Using a Single Qudit

NASA Astrophysics Data System (ADS)

Bai, Chen-Ming; Li, Zhi-Hui; Li, Yong-Ming

2018-05-01

In this paper we propose a novel and efficient quantum secret sharing protocol using d-level single particle, which it can realize a general access structure via the thought of concatenation. In addition, Our scheme includes all advantages of Tavakoli’s scheme [Phys. Rev. A 92 (2015) 030302(R)]. In contrast to Tavakoli’s scheme, the efficiency of our scheme is 1 for the same situation, and the access structure is more general and has advantages in practical significance. Furthermore, we also analyze the security of our scheme in the primary quantum attacks. Sponsored by the National Natural Science Foundation of China under Grant Nos. 61373150 and 61602291, and Industrial Research and Development Project of Science and Technology of Shaanxi Province under Grant No. 2013k0611

Recent Works Share Mothers' Unique Experiences

PubMed Central

Shilling, Teri

2005-01-01

In this column, reviewers offer perspectives and comments on The Official Lamaze Guide, a book by Judith Lothian and Charlotte De Vries; Breastfeeding, a slideshow by Roni Chastain; 100 Promises to My Baby, a book by Mallika Chopra; and The Breastfeeding Café: Mothers Share the Joys, Challenges, and Secrets of Nursing, a book by Barbara L. Berhmann.

Microscale optical cryptography using a subdiffraction-limit optical key

NASA Astrophysics Data System (ADS)

Ogura, Yusuke; Aino, Masahiko; Tanida, Jun

2018-04-01

We present microscale optical cryptography using a subdiffraction-limit optical pattern, which is finer than the diffraction-limit size of the decrypting optical system, as a key and a substrate with a reflectance distribution as an encrypted image. Because of the subdiffraction-limit spatial coding, this method enables us to construct a secret image with the diffraction-limit resolution. Simulation and experimental results demonstrate, both qualitatively and quantitatively, that the secret image becomes recognizable when and only when the substrate is illuminated with the designed key pattern.

Image encryption with chaotic map and Arnold transform in the gyrator transform domains

NASA Astrophysics Data System (ADS)

Sang, Jun; Luo, Hongling; Zhao, Jun; Alam, Mohammad S.; Cai, Bin

2017-05-01

An image encryption method combing chaotic map and Arnold transform in the gyrator transform domains was proposed. Firstly, the original secret image is XOR-ed with a random binary sequence generated by a logistic map. Then, the gyrator transform is performed. Finally, the amplitude and phase of the gyrator transform are permutated by Arnold transform. The decryption procedure is the inverse operation of encryption. The secret keys used in the proposed method include the control parameter and the initial value of the logistic map, the rotation angle of the gyrator transform, and the transform number of the Arnold transform. Therefore, the key space is large, while the key data volume is small. The numerical simulation was conducted to demonstrate the effectiveness of the proposed method and the security analysis was performed in terms of the histogram of the encrypted image, the sensitiveness to the secret keys, decryption upon ciphertext loss, and resistance to the chosen-plaintext attack.

Approach to design neural cryptography: a generalized architecture and a heuristic rule.

PubMed

Mu, Nankun; Liao, Xiaofeng; Huang, Tingwen

2013-06-01

Neural cryptography, a type of public key exchange protocol, is widely considered as an effective method for sharing a common secret key between two neural networks on public channels. How to design neural cryptography remains a great challenge. In this paper, in order to provide an approach to solve this challenge, a generalized network architecture and a significant heuristic rule are designed. The proposed generic framework is named as tree state classification machine (TSCM), which extends and unifies the existing structures, i.e., tree parity machine (TPM) and tree committee machine (TCM). Furthermore, we carefully study and find that the heuristic rule can improve the security of TSCM-based neural cryptography. Therefore, TSCM and the heuristic rule can guide us to designing a great deal of effective neural cryptography candidates, in which it is possible to achieve the more secure instances. Significantly, in the light of TSCM and the heuristic rule, we further expound that our designed neural cryptography outperforms TPM (the most secure model at present) on security. Finally, a series of numerical simulation experiments are provided to verify validity and applicability of our results.

Multiplexed Sequence Encoding: A Framework for DNA Communication.

PubMed

Zakeri, Bijan; Carr, Peter A; Lu, Timothy K

2016-01-01

Synthetic DNA has great propensity for efficiently and stably storing non-biological information. With DNA writing and reading technologies rapidly advancing, new applications for synthetic DNA are emerging in data storage and communication. Traditionally, DNA communication has focused on the encoding and transfer of complete sets of information. Here, we explore the use of DNA for the communication of short messages that are fragmented across multiple distinct DNA molecules. We identified three pivotal points in a communication-data encoding, data transfer & data extraction-and developed novel tools to enable communication via molecules of DNA. To address data encoding, we designed DNA-based individualized keyboards (iKeys) to convert plaintext into DNA, while reducing the occurrence of DNA homopolymers to improve synthesis and sequencing processes. To address data transfer, we implemented a secret-sharing system-Multiplexed Sequence Encoding (MuSE)-that conceals messages between multiple distinct DNA molecules, requiring a combination key to reveal messages. To address data extraction, we achieved the first instance of chromatogram patterning through multiplexed sequencing, thereby enabling a new method for data extraction. We envision these approaches will enable more widespread communication of information via DNA.

Perspectives and limitations of QKD integration in metropolitan area networks.

PubMed

Aleksic, Slavisa; Hipp, Florian; Winkler, Dominic; Poppe, Andreas; Schrenk, Bernhard; Franzl, Gerald

2015-04-20

Quantum key distribution (QKD) systems have already reached a reasonable level of maturity. However, a smooth integration and a wide adoption of commercial QKD systems in metropolitan area networks has still remained challenging because of technical and economical obstacles. Mainly the need for dedicated fibers and the strong dependence of the secret key rate on both loss budget and background noise in the quantum channel hinder a practical, flexible and robust implementation of QKD in current and next-generation optical metro networks. In this paper, we discuss these obstacles and present approaches to share existing fiber infrastructures among quantum and classical channels. Particularly, a proposal for a smooth integration of QKD in optical metro networks, which implies removing spurious background photons caused by optical transmitters, amplifiers and nonlinear effects in fibers, is presented and discussed. We determine and characterize impairments on quantum channels caused by many classical telecom channels at practically used power levels coexisting within the same fiber. Extensive experimental results are presented and indicate that a practical integration of QKD in conventional optical metro networks is possible.

Biliary obstruction - slideshow

MedlinePlus

... ency/presentations/100199.htm Biliary obstruction - series—Normal anatomy To use the sharing ... Overview Bile is a digestive fluid secreted by the liver and stored in the gallbladder which normally is ...

Quantum Public Key Cryptosystem Based on Bell States

NASA Astrophysics Data System (ADS)

Wu, WanQing; Cai, QingYu; Zhang, HuanGuo; Liang, XiaoYan

2017-11-01

Classical public key cryptosystems ( P K C), such as R S A, E I G a m a l, E C C, are no longer secure in quantum algorithms, and quantum cryptography has become a novel research topic. In this paper we present a quantum asymmetrical cryptosystem i.e. quantum public key cryptosystem ( Q P K C) based on the Bell states. In particular, in the proposed QPKC the public key are given by the first n particles of Bell states and generalized Pauli operations. The corresponding secret key are the last n particles of Bell states and the inverse of generalized Pauli operations. The proposed QPKC encrypts the message using a public key and decrypts the ciphertext using a private key. By H o l e v o ' s theorem, we proved the security of the secret key and messages during the QPKC.

Structural Characterization and Oligomerization of the TssL Protein, a Component Shared by Bacterial Type VI and Type IVb Secretion Systems*

PubMed Central

Durand, Eric; Zoued, Abdelrahim; Spinelli, Silvia; Watson, Paul J. H.; Aschtgen, Marie-Stéphanie; Journet, Laure; Cambillau, Christian; Cascales, Eric

2012-01-01

The Type VI secretion system (T6SS) is a macromolecular system distributed in Gram-negative bacteria, responsible for the secretion of effector proteins into target cells. The T6SS has a broad versatility as it can target both eukaryotic and prokaryotic cells. It is therefore involved in host pathogenesis or killing neighboring bacterial cells to colonize a new niche. At the architecture level, the T6SS core apparatus is composed of 13 proteins, which assemble in two subcomplexes. One of these subcomplexes, composed of subunits that share structural similarities with bacteriophage tail and baseplate components, is anchored to the cell envelope by the membrane subcomplex. This latter is constituted of at least three proteins, TssL, TssM, and TssJ. The crystal structure of the TssJ outer membrane lipoprotein and its interaction with the inner membrane TssM protein have been recently reported. TssL and TssM share sequence homology and characteristics with two components of the Type IVb secretion system (T4bSS), IcmH/DotU and IcmF, respectively. In this study, we report the crystal structure of the cytoplasmic domain of the TssL inner membrane protein from the enteroaggregative Escherichia coli Sci-1 T6SS. It folds as a hook-like structure composed of two three-helix bundles. Two TssL molecules associate to form a functional complex. Although the TssL trans-membrane segment is the main determinant of self-interaction, contacts between the cytoplasmic domains are required for TssL function. Based on sequence homology and secondary structure prediction, we propose that the TssL structure is the prototype for the members of the TssL and IcmH/DotU families. PMID:22371492

A Lipolytic Lecithin:Cholesterol Acyltransferase Secreted by Toxoplasma Facilitates Parasite Replication and Egress*

PubMed Central

Pszenny, Viviana; Ehrenman, Karen; Romano, Julia D.; Kennard, Andrea; Schultz, Aric; Roos, David S.; Grigg, Michael E.; Carruthers, Vern B.; Coppens, Isabelle

2016-01-01

The protozoan parasite Toxoplasma gondii develops within a parasitophorous vacuole (PV) in mammalian cells, where it scavenges cholesterol. When cholesterol is present in excess in its environment, the parasite expulses this lipid into the PV or esterifies it for storage in lipid bodies. Here, we characterized a unique T. gondii homologue of mammalian lecithin:cholesterol acyltransferase (LCAT), a key enzyme that produces cholesteryl esters via transfer of acyl groups from phospholipids to the 3-OH of free cholesterol, leading to the removal of excess cholesterol from tissues. TgLCAT contains a motif characteristic of serine lipases “AHSLG” and the catalytic triad consisting of serine, aspartate, and histidine (SDH) from LCAT enzymes. TgLCAT is secreted by the parasite, but unlike other LCAT enzymes it is cleaved into two proteolytic fragments that share the residues of the catalytic triad and need to be reassembled to reconstitute enzymatic activity. TgLCAT uses phosphatidylcholine as substrate to form lysophosphatidylcholine that has the potential to disrupt membranes. The released fatty acid is transferred to cholesterol, but with a lower transesterification activity than mammalian LCAT. TgLCAT is stored in a subpopulation of dense granule secretory organelles, and following secretion, it localizes to the PV and parasite plasma membrane. LCAT-null parasites have impaired growth in vitro, reduced virulence in animals, and exhibit delays in egress from host cells. Parasites overexpressing LCAT show increased virulence and faster egress. These observations demonstrate that TgLCAT influences the outcome of an infection, presumably by facilitating replication and egress depending on the developmental stage of the parasite. PMID:26694607

Comparative analyses of Legionella species identifies genetic features of strains causing Legionnaires' disease.

PubMed

Gomez-Valero, Laura; Rusniok, Christophe; Rolando, Monica; Neou, Mario; Dervins-Ravault, Delphine; Demirtas, Jasmin; Rouy, Zoe; Moore, Robert J; Chen, Honglei; Petty, Nicola K; Jarraud, Sophie; Etienne, Jerome; Steinert, Michael; Heuner, Klaus; Gribaldo, Simonetta; Médigue, Claudine; Glöckner, Gernot; Hartland, Elizabeth L; Buchrieser, Carmen

2014-01-01

The genus Legionella comprises over 60 species. However, L. pneumophila and L. longbeachae alone cause over 95% of Legionnaires’ disease. To identify the genetic bases underlying the different capacities to cause disease we sequenced and compared the genomes of L. micdadei, L. hackeliae and L. fallonii (LLAP10), which are all rarely isolated from humans. We show that these Legionella species possess different virulence capacities in amoeba and macrophages, correlating with their occurrence in humans. Our comparative analysis of 11 Legionella genomes belonging to five species reveals highly heterogeneous genome content with over 60% representing species-specific genes; these comprise a complete prophage in L. micdadei, the first ever identified in a Legionella genome. Mobile elements are abundant in Legionella genomes; many encode type IV secretion systems for conjugative transfer, pointing to their importance for adaptation of the genus. The Dot/Icm secretion system is conserved, although the core set of substrates is small, as only 24 out of over 300 described Dot/Icm effector genes are present in all Legionella species. We also identified new eukaryotic motifs including thaumatin, synaptobrevin or clathrin/coatomer adaptine like domains. Legionella genomes are highly dynamic due to a large mobilome mainly comprising type IV secretion systems, while a minority of core substrates is shared among the diverse species. Eukaryotic like proteins and motifs remain a hallmark of the genus Legionella. Key factors such as proteins involved in oxygen binding, iron storage, host membrane transport and certain Dot/Icm substrates are specific features of disease-related strains.

Modulation of interleukin-1 secretion by immunosuppressive drugs, alone and in combination.

PubMed

Reisman, L; Lin, W G; Martinelli, G P

1995-03-01

This study evaluates the ability of the immunosuppressive drugs dexamethasone, cyclosporine, FK506 and rapamycin, alone and in combination to suppress interleukin-1 beta (IL-1 beta) secretion in vitro by THP-1 cells when stimulated by lipopolysaccharide. All four drugs, when added to cell culture medium at therapeutic concentrations, significantly decrease secretion of the monokine to well below control levels. However, only dexamethasone completely suppresses IL-1 beta secretion in a dose-dependent fashion. Cyclosporine, FK506 and rapamycin only partially suppress secretion of IL-1 beta at concentrations within their therapeutic ranges and increasing concentrations of the drugs do not result in further suppression of secretion. Likewise, the combination of any two of these three drugs does not provide any additional suppressive effect. Dexamethasone, however, when added in increasing concentrations in combination with any of the other drugs, results in further suppression of IL-1 secretion in a dose-dependent fashion. These data suggest that cyclosporine, FK506 and rapamycin all share a common effect on the production of IL-1 beta, different from that of dexamethasone.

Energy-Efficient Implementation of ECDH Key Exchange for Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Lederer, Christian; Mader, Roland; Koschuch, Manuel; Großschädl, Johann; Szekely, Alexander; Tillich, Stefan

Wireless Sensor Networks (WSNs) are playing a vital role in an ever-growing number of applications ranging from environmental surveillance over medical monitoring to home automation. Since WSNs are often deployed in unattended or even hostile environments, they can be subject to various malicious attacks, including the manipulation and capture of nodes. The establishment of a shared secret key between two or more individual nodes is one of the most important security services needed to guarantee the proper functioning of a sensor network. Despite some recent advances in this field, the efficient implementation of cryptographic key establishment for WSNs remains a challenge due to the resource constraints of small sensor nodes such as the MICAz mote. In this paper we present a lightweight implementation of the elliptic curve Diffie-Hellman (ECDH) key exchange for ZigBee-compliant sensor nodes equipped with an ATmega128 processor running the TinyOS operating system. Our implementation uses a 192-bit prime field specified by the NIST as underlying algebraic structure and requires only 5.20 ·106 clock cycles to compute a scalar multiplication if the base point is fixed and known a priori. A scalar multiplication using a random base point takes about 12.33 ·106 cycles. Our results show that a full ECDH key exchange between two MICAz motes consumes an energy of 57.33 mJ (including radio communication), which is significantly better than most previously reported ECDH implementations on comparable platforms.

Implementing Diffie-Hellman key exchange using quantum EPR pairs

NASA Astrophysics Data System (ADS)

Mandal, Sayonnha; Parakh, Abhishek

2015-05-01

This paper implements the concepts of perfect forward secrecy and the Diffie-Hellman key exchange using EPR pairs to establish and share a secret key between two non-authenticated parties and transfer messages between them without the risk of compromise. Current implementations of quantum cryptography are based on the BB84 protocol, which is susceptible to siphoning attacks on the multiple photons emitted by practical laser sources. This makes BB84-based quantum cryptography protocol unsuitable for network computing environments. Diffie-Hellman does not require the two parties to be mutually authenticated to each other, yet it can provide a basis for a number of authenticated protocols, most notably the concept of perfect forward secrecy. The work proposed in this paper provides a new direction in utilizing quantum EPR pairs in quantum key exchange. Although, classical cryptography boasts of efficient and robust protocols like the Diffie-Hellman key exchange, in the current times, with the advent of quantum computing they are very much vulnerable to eavesdropping and cryptanalytic attacks. Using quantum cryptographic principles, however, these classical encryption algorithms show more promise and a more robust and secure structure for applications. The unique properties of quantum EPR pairs also, on the other hand, go a long way in removing attacks like eavesdropping by their inherent nature of one particle of the pair losing its state if a measurement occurs on the other. The concept of perfect forward secrecy is revisited in this paper to attribute tighter security to the proposed protocol.

SIMPL Systems, or: Can We Design Cryptographic Hardware without Secret Key Information?

NASA Astrophysics Data System (ADS)

Rührmair, Ulrich

This paper discusses a new cryptographic primitive termed SIMPL system. Roughly speaking, a SIMPL system is a special type of Physical Unclonable Function (PUF) which possesses a binary description that allows its (slow) public simulation and prediction. Besides this public key like functionality, SIMPL systems have another advantage: No secret information is, or needs to be, contained in SIMPL systems in order to enable cryptographic protocols - neither in the form of a standard binary key, nor as secret information hidden in random, analog features, as it is the case for PUFs. The cryptographic security of SIMPLs instead rests on (i) a physical assumption on their unclonability, and (ii) a computational assumption regarding the complexity of simulating their output. This novel property makes SIMPL systems potentially immune against many known hardware and software attacks, including malware, side channel, invasive, or modeling attacks.

Autotransporters and Their Role in the Virulence of Burkholderia pseudomallei and Burkholderia mallei.

PubMed

Lazar Adler, Natalie R; Stevens, Joanne M; Stevens, Mark P; Galyov, Edouard E

2011-01-01

Burkholderia pseudomallei and Burkholderia mallei are closely related Gram-negative bacteria responsible for the infectious diseases melioidosis and glanders, respectively. Autotransporters (ATs) comprise a large and diverse family of secreted and outer membrane proteins that includes virulence-associated invasins, adhesins, proteases, and actin-nucleating factors. The B. pseudomallei K96243 genome contains 11 predicted ATs, eight of which share homologs in the B. mallei ATCC 23344 genome. This review distils key findings from in silico, in vitro, and in vivo studies on the ATs of B. pseudomallei and B. mallei. To date, the best characterized of the predicted ATs of B. pseudomallei and B. mallei is BimA, a predicted trimeric AT mediating actin-based motility which varies in sequence and mode of action between Burkholderia species. Of the remaining eight predicted B. pseudomallei trimeric autotransporters, five of which are also present in B. mallei, two (BoaA and BoaB), have been implicated in bacterial adhesion to epithelial cells. Several predicted Burkholderia ATs are recognized by human humoral and cell-mediated immunity, indicating that they are expressed during infection and may be useful for diagnosis and vaccine-mediated protection. Further studies on the mode of secretion and functions of Burkholderia ATs will facilitate the rational design of control strategies.

Scarcity of autoreactive human blood IgA+ memory B cells

PubMed Central

Prigent, Julie; Lorin, Valérie; Kök, Ayrin; Hieu, Thierry; Bourgeau, Salomé

2016-01-01

Class‐switched memory B cells are key components of the “reactive” humoral immunity, which ensures a fast and massive secretion of high‐affinity antigen‐specific antibodies upon antigenic challenge. In humans, IgA class‐switched (IgA+) memory B cells and IgA antibodies are abundant in the blood. Although circulating IgA+ memory B cells and their corresponding secreted immunoglobulins likely possess major protective and/or regulatory immune roles, little is known about their specificity and function. Here, we show that IgA+ and IgG+ memory B‐cell antibodies cloned from the same healthy humans share common immunoglobulin gene features. IgA and IgG memory antibodies have comparable lack of reactivity to vaccines, common mucosa‐tropic viruses and commensal bacteria. However, the IgA+ memory B‐cell compartment contains fewer polyreactive clones and importantly, only rare self‐reactive clones compared to IgG+ memory B cells. Self‐reactivity of IgAs is acquired following B‐cell affinity maturation but not antibody class switching. Together, our data suggest the existence of different regulatory mechanisms for removing autoreactive clones from the IgG+ and IgA+ memory B‐cell repertoires, and/or different maturation pathways potentially reflecting the distinct nature and localization of the cognate antigens recognized by individual B‐cell populations. PMID:27469325

Multiple spatial modes based QKD over marine free-space optical channels in the presence of atmospheric turbulence.

PubMed

Sun, Xiaole; Djordjevic, Ivan B; Neifeld, Mark A

2016-11-28

We investigate a multiple spatial modes based quantum key distribution (QKD) scheme that employs multiple independent parallel beams through a marine free-space optical channel over open ocean. This approach provides the potential to increase secret key rate (SKR) linearly with the number of channels. To improve the SKR performance, we describe a back-propagation mode (BPM) method to mitigate the atmospheric turbulence effects. Our simulation results indicate that the secret key rate can be improved significantly by employing the proposed BPM-based multi-channel QKD scheme.

Practical issues in quantum-key-distribution postprocessing

NASA Astrophysics Data System (ADS)

Fung, Chi-Hang Fred; Ma, Xiongfeng; Chau, H. F.

2010-01-01

Quantum key distribution (QKD) is a secure key generation method between two distant parties by wisely exploiting properties of quantum mechanics. In QKD, experimental measurement outcomes on quantum states are transformed by the two parties to a secret key. This transformation is composed of many logical steps (as guided by security proofs), which together will ultimately determine the length of the final secret key and its security. We detail the procedure for performing such classical postprocessing taking into account practical concerns (including the finite-size effect and authentication and encryption for classical communications). This procedure is directly applicable to realistic QKD experiments and thus serves as a recipe that specifies what postprocessing operations are needed and what the security level is for certain lengths of the keys. Our result is applicable to the BB84 protocol with a single or entangled photon source.

Reversible integer wavelet transform for blind image hiding method

PubMed Central

Bibi, Nargis; Mahmood, Zahid; Akram, Tallha; Naqvi, Syed Rameez

2017-01-01

In this article, a blind data hiding reversible methodology to embed the secret data for hiding purpose into cover image is proposed. The key advantage of this research work is to resolve the privacy and secrecy issues raised during the data transmission over the internet. Firstly, data is decomposed into sub-bands using the integer wavelets. For decomposition, the Fresnelet transform is utilized which encrypts the secret data by choosing a unique key parameter to construct a dummy pattern. The dummy pattern is then embedded into an approximated sub-band of the cover image. Our proposed method reveals high-capacity and great imperceptibility of the secret embedded data. With the utilization of family of integer wavelets, the proposed novel approach becomes more efficient for hiding and retrieving process. It retrieved the secret hidden data from the embedded data blindly, without the requirement of original cover image. PMID:28498855

76 FR 53900 - Change in Bank Control Notices; Acquisitions of Shares of a Bank or Bank Holding Company

Federal Register 2010, 2011, 2012, 2013, 2014

2011-08-30

... Mark Jones and April Jones, individually, all of Key West, Florida; to acquire additional voting shares of First State Bank of the Florida Keys Holding Company, and thereby indirectly acquire additional voting shares of First State Bank of the Florida Keys, both in Key West, Florida. Board of Governors of...

Teleradiology mobile internet system with a new information security solution

NASA Astrophysics Data System (ADS)

Satoh, Hitoshi; Niki, Noboru; Eguchi, Kenji; Ohmatsu, Hironobu; Kusumoto, Masahiko; Kaneko, Masahiro; Moriyama, Noriyuki

2014-03-01

We have developed an external storage system by using secret sharing scheme and tokenization for regional medical cooperation, PHR service and information preservation. The use of mobile devices such as smart phones and tablets will be accelerated for a PHR service, and the confidential medical information is exposed to the risk of damage and intercept. We verified the transfer rate of the sending and receiving of data to and from the external storage system that connected it with PACS by the Internet this time. External storage systems are the data centers that exist in Okinawa, in Osaka, in Sapporo and in Tokyo by using secret sharing scheme. PACS continuously transmitted 382 CT images to the external data centers. Total capacity of the CT images is about 200MB. The total time that had been required to transmit was about 250 seconds. Because the preservation method to use secret sharing scheme is applied, security is strong. But, it also takes the information transfer time of this system too much. Therefore, DICOM data is masked to the header information part because it is made to anonymity in our method. The DICOM data made anonymous is preserved in the data base in the hospital. Header information including individual information is divided into two or more tallies by secret sharing scheme, and preserved at two or more external data centers. The token to relate the DICOM data anonymity made to header information preserved outside is strictly preserved in the token server. The capacity of header information that contains patient's individual information is only about 2% of the entire DICOM data. This total time that had been required to transmit was about 5 seconds. Other, common solutions that can protect computer communication networks from attacks are classified as cryptographic techniques or authentication techniques. Individual number IC card is connected with electronic certification authority of web medical image conference system. Individual number IC card is given only to the person to whom the authority to operate web medical image conference system was given.

Attack to AN Image Encryption Based on Chaotic Logistic Map

NASA Astrophysics Data System (ADS)

Wang, Xing-Yuan; Chen, Feng; Wang, Tian; Xu, Dahai; Ma, Yutian

2013-10-01

This paper offers two different attacks on a freshly proposed image encryption based on chaotic logistic map. The cryptosystem under study first uses a secret key of 80-bit and employed two chaotic logistic maps. We derived the initial conditions of the logistic maps from using the secret key by providing different weights to all its bits. Additionally, in this paper eight different types of procedures are used to encrypt the pixels of an image in the proposed encryption process of which one of them will be used for a certain pixel which is determined by the product of the logistic map. The secret key is revised after encrypting each block which consisted of 16 pixels of the image. The encrypting process have weakness, worst of which is that every byte of plaintext is independent when substituted, so the cipher text of the byte will not change even the other bytes have changed. As a result of weakness, a chosen plaintext attack and a chosen cipher text attack can be completed without any knowledge of the key value to recuperate the ciphered image.

Nectar secretion requires sucrose phosphate synthases and the sugar transporter SWEET9.

PubMed

Lin, I Winnie; Sosso, Davide; Chen, Li-Qing; Gase, Klaus; Kim, Sang-Gyu; Kessler, Danny; Klinkenberg, Peter M; Gorder, Molly K; Hou, Bi-Huei; Qu, Xiao-Qing; Carter, Clay J; Baldwin, Ian T; Frommer, Wolf B

2014-04-24

Angiosperms developed floral nectaries that reward pollinating insects. Although nectar function and composition have been characterized, the mechanism of nectar secretion has remained unclear. Here we identify SWEET9 as a nectary-specific sugar transporter in three eudicot species: Arabidopsis thaliana, Brassica rapa (extrastaminal nectaries) and Nicotiana attenuata (gynoecial nectaries). We show that SWEET9 is essential for nectar production and can function as an efflux transporter. We also show that sucrose phosphate synthase genes, encoding key enzymes for sucrose biosynthesis, are highly expressed in nectaries and that their expression is also essential for nectar secretion. Together these data are consistent with a model in which sucrose is synthesized in the nectary parenchyma and subsequently secreted into the extracellular space via SWEET9, where sucrose is hydrolysed by an apoplasmic invertase to produce a mixture of sucrose, glucose and fructose. The recruitment of SWEET9 for sucrose export may have been a key innovation, and could have coincided with the evolution of core eudicots and contributed to the evolution of nectar secretion to reward pollinators.

Central Nervous System Neuropeptide Y Signaling Modulates VLDL Triglyceride Secretion

PubMed Central

Stafford, John M.; Yu, Fang; Printz, Richard; Hasty, Alyssa H.; Swift, Larry L.; Niswender, Kevin D.

2014-01-01

OBJECTIVE Elevated triglyceride (TG) is the major plasma lipid abnormality in obese and diabetic patients and contributes to cardiovascular morbidity in these disorders. We sought to identify novel mechanisms leading to hypertriglyceridemia. Resistance to negative feedback signals from adipose tissue in key central nervous system (CNS) energy homeostatic circuits contributes to the development of obesity. Because triglycerides both represent the largest energy depot in the body and are elevated in both the plasma and adipose in obesity and diabetes, we hypothesized that the same neural circuits that regulate energy balance also regulate the secretion of TGs into plasma. RESEARCH DESIGN AND METHODS In normal fasting rats, the TG secretion rate was estimated by serial blood sampling after intravascular tyloxapol pretreatment. Neuropeptide Y (NPY) signaling in the CNS was modulated by intracerebroventricular injection of NPY, receptor antagonist, and receptor agonist. RESULTS A single intracerebroventricular injection of NPY increased TG secretion by 2.5-fold in the absence of food intake, and this was determined to be VLDL by fast performance liquid chromatography (FPLC). This effect was recapitulated by activating NPY signaling in downstream neurons with an NPY-Y5 receptor agonist. An NPY-Y1 receptor antagonist decreased the elevated TGs in the form of VLDL secretion rate by 50% compared with vehicle. Increased TG secretion was due to increased secretion of VLDL particles, rather than secretion of larger particles, because apolipoprotein B100 was elevated in FPLC fractions corresponding to VLDL. CONCLUSIONS We find that a key neuropeptide system involved in energy homeostasis in the CNS exerts control over VLDL-TG secretion into the bloodstream. PMID:18332095

Metropolitan Quantum Key Distribution with Silicon Photonics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bunandar, Darius; Lentine, Anthony; Lee, Catherine

Photonic integrated circuits provide a compact and stable platform for quantum photonics. Here we demonstrate a silicon photonics quantum key distribution (QKD) encoder in the first high-speed polarization-based QKD field tests. The systems reach composable secret key rates of 1.039 Mbps in a local test (on a 103.6-m fiber with a total emulated loss of 9.2 dB) and 157 kbps in an intercity metropolitan test (on a 43-km fiber with 16.4 dB loss). Our results represent the highest secret key generation rate for polarization-based QKD experiments at a standard telecom wavelength and demonstrate photonic integrated circuits as a promising, scalablemore » resource for future formation of metropolitan quantum-secure communications networks.« less

Metropolitan Quantum Key Distribution with Silicon Photonics

DOE PAGES

Bunandar, Darius; Lentine, Anthony; Lee, Catherine; ...

2018-04-06

Photonic integrated circuits provide a compact and stable platform for quantum photonics. Here we demonstrate a silicon photonics quantum key distribution (QKD) encoder in the first high-speed polarization-based QKD field tests. The systems reach composable secret key rates of 1.039 Mbps in a local test (on a 103.6-m fiber with a total emulated loss of 9.2 dB) and 157 kbps in an intercity metropolitan test (on a 43-km fiber with 16.4 dB loss). Our results represent the highest secret key generation rate for polarization-based QKD experiments at a standard telecom wavelength and demonstrate photonic integrated circuits as a promising, scalablemore » resource for future formation of metropolitan quantum-secure communications networks.« less

Finite-size analysis of a continuous-variable quantum key distribution

DOE Office of Scientific and Technical Information (OSTI.GOV)

Leverrier, Anthony; Grosshans, Frederic; Grangier, Philippe

2010-06-15

The goal of this paper is to extend the framework of finite-size analysis recently developed for quantum key distribution to continuous-variable protocols. We do not solve this problem completely here, and we mainly consider the finite-size effects on the parameter estimation procedure. Despite the fact that some questions are left open, we are able to give an estimation of the secret key rate for protocols which do not contain a postselection procedure. As expected, these results are significantly more pessimistic than those obtained in the asymptotic regime. However, we show that recent continuous-variable protocols are able to provide fully securemore » secret keys in the finite-size scenario, over distances larger than 50 km.« less

Experimental study on discretely modulated continuous-variable quantum key distribution

DOE Office of Scientific and Technical Information (OSTI.GOV)

Shen Yong; Zou Hongxin; Chen Pingxing

2010-08-15

We present a discretely modulated continuous-variable quantum key distribution system in free space by using strong coherent states. The amplitude noise in the laser source is suppressed to the shot-noise limit by using a mode cleaner combined with a frequency shift technique. Also, it is proven that the phase noise in the source has no impact on the final secret key rate. In order to increase the encoding rate, we use broadband homodyne detectors and the no-switching protocol. In a realistic model, we establish a secret key rate of 46.8 kbits/s against collective attacks at an encoding rate of 10more » MHz for a 90% channel loss when the modulation variance is optimal.« less

Long-distance continuous-variable quantum key distribution with a Gaussian modulation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jouguet, Paul; SeQureNet, 23 avenue d'Italie, F-75013 Paris; Kunz-Jacques, Sebastien

2011-12-15

We designed high-efficiency error correcting codes allowing us to extract an errorless secret key in a continuous-variable quantum key distribution (CVQKD) protocol using a Gaussian modulation of coherent states and a homodyne detection. These codes are available for a wide range of signal-to-noise ratios on an additive white Gaussian noise channel with a binary modulation and can be combined with a multidimensional reconciliation method proven secure against arbitrary collective attacks. This improved reconciliation procedure considerably extends the secure range of a CVQKD with a Gaussian modulation, giving a secret key rate of about 10{sup -3} bit per pulse at amore » distance of 120 km for reasonable physical parameters.« less

Metropolitan Quantum Key Distribution with Silicon Photonics

NASA Astrophysics Data System (ADS)

Bunandar, Darius; Lentine, Anthony; Lee, Catherine; Cai, Hong; Long, Christopher M.; Boynton, Nicholas; Martinez, Nicholas; DeRose, Christopher; Chen, Changchen; Grein, Matthew; Trotter, Douglas; Starbuck, Andrew; Pomerene, Andrew; Hamilton, Scott; Wong, Franco N. C.; Camacho, Ryan; Davids, Paul; Urayama, Junji; Englund, Dirk

2018-04-01

Photonic integrated circuits provide a compact and stable platform for quantum photonics. Here we demonstrate a silicon photonics quantum key distribution (QKD) encoder in the first high-speed polarization-based QKD field tests. The systems reach composable secret key rates of 1.039 Mbps in a local test (on a 103.6-m fiber with a total emulated loss of 9.2 dB) and 157 kbps in an intercity metropolitan test (on a 43-km fiber with 16.4 dB loss). Our results represent the highest secret key generation rate for polarization-based QKD experiments at a standard telecom wavelength and demonstrate photonic integrated circuits as a promising, scalable resource for future formation of metropolitan quantum-secure communications networks.

An Enhanced Privacy-Preserving Authentication Scheme for Vehicle Sensor Networks.

PubMed

Zhou, Yousheng; Zhao, Xiaofeng; Jiang, Yi; Shang, Fengjun; Deng, Shaojiang; Wang, Xiaojun

2017-12-08

Vehicle sensor networks (VSNs) are ushering in a promising future by enabling more intelligent transportation systems and providing a more efficient driving experience. However, because of their inherent openness, VSNs are subject to a large number of potential security threats. Although various authentication schemes have been proposed for addressing security problems, they are not suitable for VSN applications because of their high computation and communication costs. Chuang and Lee have developed a trust-extended authentication mechanism (TEAM) for vehicle-to-vehicle communication using a transitive trust relationship, which they claim can resist various attacks. However, it fails to counter internal attacks because of the utilization of a shared secret key. In this paper, to eliminate the vulnerability of TEAM, an enhanced privacy-preserving authentication scheme for VSNs is constructed. The security of our proposed scheme is proven under the random oracle model based on the assumption of the computational Diffie-Hellman problem.

Diacetin, a reliable cue and private communication channel in a specialized pollination system

PubMed Central

Schäffler, Irmgard; Steiner, Kim E.; Haid, Mark; van Berkel, Sander S.; Gerlach, Günter; Johnson, Steven D.; Wessjohann, Ludger; Dötterl, Stefan

2015-01-01

The interaction between floral oil secreting plants and oil-collecting bees is one of the most specialized of all pollination mutualisms. Yet, the specific stimuli used by the bees to locate their host flowers have remained elusive. This study identifies diacetin, a volatile acetylated glycerol, as a floral signal compound shared by unrelated oil plants from around the globe. Electrophysiological measurements of antennae and behavioural assays identified diacetin as the key volatile used by oil-collecting bees to locate their host flowers. Furthermore, electrophysiological measurements indicate that only oil-collecting bees are capable of detecting diacetin. The structural and obvious biosynthetic similarity between diacetin and associated floral oils make it a reliable cue for oil-collecting bees. It is easily perceived by oil bees, but can’t be detected by other potential pollinators. Therefore, diacetin represents the first demonstrated private communication channel in a pollination system. PMID:26245141

An Enhanced Privacy-Preserving Authentication Scheme for Vehicle Sensor Networks

PubMed Central

Zhou, Yousheng; Zhao, Xiaofeng; Jiang, Yi; Shang, Fengjun; Deng, Shaojiang; Wang, Xiaojun

2017-01-01

Vehicle sensor networks (VSNs) are ushering in a promising future by enabling more intelligent transportation systems and providing a more efficient driving experience. However, because of their inherent openness, VSNs are subject to a large number of potential security threats. Although various authentication schemes have been proposed for addressing security problems, they are not suitable for VSN applications because of their high computation and communication costs. Chuang and Lee have developed a trust-extended authentication mechanism (TEAM) for vehicle-to-vehicle communication using a transitive trust relationship, which they claim can resist various attacks. However, it fails to counter internal attacks because of the utilization of a shared secret key. In this paper, to eliminate the vulnerability of TEAM, an enhanced privacy-preserving authentication scheme for VSNs is constructed. The security of our proposed scheme is proven under the random oracle model based on the assumption of the computational Diffie–Hellman problem. PMID:29292792

Anonymous quantum nonlocality.

PubMed

Liang, Yeong-Cherng; Curchod, Florian John; Bowles, Joseph; Gisin, Nicolas

2014-09-26

We investigate the phenomenon of anonymous quantum nonlocality, which refers to the existence of multipartite quantum correlations that are not local in the sense of being Bell-inequality-violating but where the nonlocality is--due to its biseparability with respect to all bipartitions--seemingly nowhere to be found. Such correlations can be produced by the nonlocal collaboration involving definite subset(s) of parties but to an outsider, the identity of these nonlocally correlated parties is completely anonymous. For all n≥3, we present an example of an n-partite quantum correlation exhibiting anonymous nonlocality derived from the n-partite Greenberger-Horne-Zeilinger state. An explicit biseparable decomposition of these correlations is provided for any partitioning of the n parties into two groups. Two applications of these anonymous Greenberger-Horne-Zeilinger correlations in the device-independent setting are discussed: multipartite secret sharing between any two groups of parties and bipartite quantum key distribution that is robust against nearly arbitrary leakage of information.

Diversity and Phylogenetic Distribution of Extracellular Microbial Peptidases

NASA Astrophysics Data System (ADS)

Nguyen, Trang; Mueller, Ryan; Myrold, David

2017-04-01

Depolymerization of proteinaceous compounds by extracellular proteolytic enzymes is a bottleneck in the nitrogen cycle, limiting the rate of the nitrogen turnover in soils. Protein degradation is accomplished by a diverse range of extracellular (secreted) peptidases. Our objective was to better understand the evolution of these enzymes and how their functional diversity corresponds to known phylogenetic diversity. Peptidase subfamilies from 110 archaeal, 1,860 bacterial, and 97 fungal genomes were extracted from the MEROPS database along with corresponding SSU sequences for each genome from the SILVA database, resulting in 43,177 secreted peptidases belonging to 34 microbial phyla and 149 peptidase subfamilies. We compared the distribution of each peptidase subfamily across all taxa to the phylogenetic relationships of these organisms based on their SSU gene sequences. The occurrence and abundance of genes coding for secreted peptidases varied across microbial taxa, distinguishing the peptidase complement of the three microbial kingdoms. Bacteria had the highest frequency of secreted peptidase coding genes per 1,000 genes and contributed from 1% to 6% of the gene content. Fungi only had a slightly higher number of secreted peptidase gene content than archaea, standardized by the total genes. The relative abundance profiles of secreted peptidases in each microbial kingdom also varied, in which aspartic family was found to be the greatest in fungi (25%), whereas it was only 12% in archaea and 4% in bacteria. Serine, metallo, and cysteine families consistently contributed widely up to 75% of the secreted peptidase abundance across the three kingdoms. Overall, bacteria had a much wider collection of secreted peptidases, whereas fungi and archaea shared most of their secreted peptidase families. Principle coordinate analysis of the peptidase subfamily-based dissimilarities showed distinguishable clusters for different groups of microorganisms. The distribution of secreted peptidases was found to be significantly correlated with phylogenetic relationships within kingdoms (archaea rMantel=0.364, p=0.001; bacteria rMantel=0.257, p=0.001, and fungi rMantel=0.281, p=0.005), inferring an evolutionary relationship where subsets of phylogenetically related organisms share similar types of secreted peptidases. We also tested the phylogenetic signal strength of each peptidase subfamily for each microbial kingdom based on the binary traits of the distribution (presence or absence of secreted peptidase subfamilies in individual species). About one-third of the peptidase subfamilies displayed a strong evolutionary signal; the rest were phylogenetically over-dispersed, suggesting that these subfamilies are randomly distributed across the tree of life or the result of events such as horizontal gene transfer. Study of the diversity and phylogenetic distribution of secreted peptidases offered a mechanistic basis to anticipate the proteolytic potential function of microbial communities.

Experimentally feasible security check for n-qubit quantum secret sharing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schauer, Stefan; Huber, Marcus; Hiesmayr, Beatrix C.

In this article we present a general security strategy for quantum secret sharing (QSS) protocols based on the scheme presented by Hillery, Buzek, and Berthiaume (HBB) [Phys. Rev. A 59, 1829 (1999)]. We focus on a generalization of the HBB protocol to n communication parties thus including n-partite Greenberger-Horne-Zeilinger states. We show that the multipartite version of the HBB scheme is insecure in certain settings and impractical when going to large n. To provide security for such QSS schemes in general we use the framework presented by some of the authors [M. Huber, F. Mintert, A. Gabriel, B. C. Hiesmayr,more » Phys. Rev. Lett. 104, 210501 (2010)] to detect certain genuine n-partite entanglement between the communication parties. In particular, we present a simple inequality which tests the security.« less

MIX and match: mobile T6SS MIX-effectors enhance bacterial fitness

PubMed Central

Salomon, Dor

2016-01-01

ABSTRACT Protein secretion systems that mediate interbacterial competition secret a wide repertoire of antibacterial toxins. A major player in these competitions is the newly discovered bacterial type VI secretion system (T6SS). We recently found that a subset of polymorphic MIX-effectors, which are a widespread class of effectors secreted by T6SSs, are horizontally shared between marine bacteria and are used to diversify their T6SS effector repertoires, thus enhancing their environmental fitness. In this commentary, I expand on the ideas that were introduced in the previous report, and further speculate on the possible mobility of other MIX-effectors. In addition, I discuss the possible role of horizontal gene transfer in the dissemination of MIX-effectors through bacterial genomes, as well as its possible role in diversifying the T6SS effector repertoire. PMID:27066305

"In search of a tale they can live with": about loss, family secrets, and selective disclosure.

PubMed

Rober, Peter; Walravens, Geertje; Versteynen, Leen

2012-07-01

Several authors have written about family secrets in the family therapy literature in interesting ways. According to these authors, the questions "who knows the secret?" and "who does not know the secret?" are central. In the present study, we have qualitatively analyzed the documentary film Familiegeheim (Family Secret) by the Dutch director Jaap van Hoewijk. The film shows van Hoewijk's investigation into the death of his father in 1974 and tells the story of a family in which the suicide of the father is kept secret from the three children. Our analysis of the film highlights the complex ways in which families deal with sensitive issues like loss, grief, and suicide. The concept of family secrets seems to poorly capture this complexity, focusing one-sidedly on the destructive effects of withholding delicate information. The concept of selective disclosure is proposed as an alternative. Selective disclosure refers to the complex processes involved in dealing with the dialectic tension between sharing information and keeping it secret. The concept is not only focused on the destructiveness of secrecy but, in addition, also makes room for an appreciation of the caution with which family members deal with sensitive family issues. © 2011 American Association for Marriage and Family Therapy.

Preservation of a lower bound of quantum secret key rate in the presence of decoherence

NASA Astrophysics Data System (ADS)

Datta, Shounak; Goswami, Suchetana; Pramanik, Tanumoy; Majumdar, A. S.

2017-03-01

It is well known that the interaction of quantum systems with the environment reduces the inherent quantum correlations. Under special circumstances the effect of decoherence can be reversed, for example, the interaction modelled by an amplitude damping channel can boost the teleportation fidelity from the classical to the quantum region for a bipartite quantum state. Here, we first show that this phenomenon fails to preserve the quantum secret key rate derived under individual attack. We further show that the technique of weak measurement can be used to slow down the process of decoherence, thereby helping to preserve the quantum secret key rate when one or both systems are interacting with the environment via an amplitude damping channel. Most interestingly, in certain cases weak measurement with post-selection where one considers both success and failure of the technique is shown to be more useful than without it when both systems interact with the environment.

Access to Network Login by Three-Factor Authentication for Effective Information Security.

PubMed

Vaithyasubramanian, S; Christy, A; Saravanan, D

2016-01-01

Today's technology development in the field of computer along with internet of things made huge difference in the transformation of our lives. Basic computer framework and web client need to make significant login signify getting to mail, long range interpersonal communication, internet keeping money, booking tickets, perusing online daily papers, and so forth. The login user name and secret key mapping validate if the logging user is the intended client. Secret key is assumed an indispensable part in security. The objective of MFA is to make a layered safeguard and make it more troublesome for an unauthenticated entity to get to an objective, for example, a physical area, processing gadget, system, or database. In the event that one element is bargained or broken, the assailant still has two more boundaries to rupture before effectively breaking into the objective. An endeavor has been made by utilizing three variable types of authentication. In this way managing additional secret key includes an additional layer of security.

Access to Network Login by Three-Factor Authentication for Effective Information Security

PubMed Central

Vaithyasubramanian, S.; Christy, A.; Saravanan, D.

2016-01-01

Today's technology development in the field of computer along with internet of things made huge difference in the transformation of our lives. Basic computer framework and web client need to make significant login signify getting to mail, long range interpersonal communication, internet keeping money, booking tickets, perusing online daily papers, and so forth. The login user name and secret key mapping validate if the logging user is the intended client. Secret key is assumed an indispensable part in security. The objective of MFA is to make a layered safeguard and make it more troublesome for an unauthenticated entity to get to an objective, for example, a physical area, processing gadget, system, or database. In the event that one element is bargained or broken, the assailant still has two more boundaries to rupture before effectively breaking into the objective. An endeavor has been made by utilizing three variable types of authentication. In this way managing additional secret key includes an additional layer of security. PMID:27006976

Childhood Obesity: Common Misconceptions

MedlinePlus

... Issues Listen Español Text Size Email Print Share Childhood Obesity: Common Misconceptions Page Content Article Body Everyone, it ... for less than 1% of the cases of childhood obesity. Yes, hypothyroidism (a deficit in thyroid secretion) and ...

Neuroendocrine mechanisms in pregnancy and parturition.

PubMed

Petraglia, Felice; Imperatore, Alberto; Challis, John R G

2010-12-01

The complex mechanisms controlling human parturition involves mother, fetus, and placenta, and stress is a key element activating a series of physiological adaptive responses. Preterm birth is a clinical syndrome that shares several characteristics with term birth. A major role for the neuroendocrine mechanisms has been proposed, and placenta/membranes are sources for neurohormones and peptides. Oxytocin (OT) is the neurohormone whose major target is uterine contractility and placenta represents a novel source that contributes to the mechanisms of parturition. The CRH/urocortin (Ucn) family is another important neuroendocrine pathway involved in term and preterm birth. The CRH/Ucn family consists of four ligands: CRH, Ucn, Ucn2, and Ucn3. These peptides have a pleyotropic function and are expressed by human placenta and fetal membranes. Uterine contractility, blood vessel tone, and immune function are influenced by CRH/Ucns during pregnancy and undergo major changes at parturition. Among the others, neurohormones, relaxin, parathyroid hormone-related protein, opioids, neurosteroids, and monoamines are expressed and secreted from placental tissues at parturition. Preterm birth is the consequence of a premature and sustained activation of endocrine and immune responses. A preterm birth evidence for a premature activation of OT secretion as well as increased maternal plasma CRH levels suggests a pathogenic role of these neurohormones. A decrease of maternal serum CRH-binding protein is a concurrent event. At midgestation, placental hypersecretion of CRH or Ucn has been proposed as a predictive marker of subsequent preterm delivery. While placenta represents the major source for CRH, fetus abundantly secretes Ucn and adrenal dehydroepiandrosterone in women with preterm birth. The relevant role of neuroendocrine mechanisms in preterm birth is sustained by basic and clinic implications.

Multiplexed Sequence Encoding: A Framework for DNA Communication

PubMed Central

Zakeri, Bijan; Carr, Peter A.; Lu, Timothy K.

2016-01-01

Synthetic DNA has great propensity for efficiently and stably storing non-biological information. With DNA writing and reading technologies rapidly advancing, new applications for synthetic DNA are emerging in data storage and communication. Traditionally, DNA communication has focused on the encoding and transfer of complete sets of information. Here, we explore the use of DNA for the communication of short messages that are fragmented across multiple distinct DNA molecules. We identified three pivotal points in a communication—data encoding, data transfer & data extraction—and developed novel tools to enable communication via molecules of DNA. To address data encoding, we designed DNA-based individualized keyboards (iKeys) to convert plaintext into DNA, while reducing the occurrence of DNA homopolymers to improve synthesis and sequencing processes. To address data transfer, we implemented a secret-sharing system—Multiplexed Sequence Encoding (MuSE)—that conceals messages between multiple distinct DNA molecules, requiring a combination key to reveal messages. To address data extraction, we achieved the first instance of chromatogram patterning through multiplexed sequencing, thereby enabling a new method for data extraction. We envision these approaches will enable more widespread communication of information via DNA. PMID:27050646

Calculation of key reduction for B92 QKD protocol

NASA Astrophysics Data System (ADS)

Mehic, Miralem; Partila, Pavol; Tovarek, Jaromir; Voznak, Miroslav

2015-05-01

It is well known that Quantum Key Distribution (QKD) can be used with the highest level of security for distribution of the secret key, which is further used for symmetrical encryption. B92 is one of the oldest QKD protocols. It uses only two non-orthogonal states, each one coding for one bit-value. It is much faster and simpler when compared to its predecessors, but with the idealized maximum efficiencies of 25% over the quantum channel. B92 consists of several phases in which initial key is significantly reduced: secret key exchange, extraction of the raw key (sifting), error rate estimation, key reconciliation and privacy amplification. QKD communication is performed over two channels: the quantum channel and the classical public channel. In order to prevent a man-in-the-middle attack and modification of messages on the public channel, authentication of exchanged values must be performed. We used Wegman-Carter authentication because it describes an upper bound for needed symmetric authentication key. We explained the reduction of the initial key in each of QKD phases.

Attacking a practical quantum-key-distribution system with wavelength-dependent beam-splitter and multiwavelength sources

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Hong-Wei; Zhengzhou Information Science and Technology Institute, Zhengzhou, 450004; Wang, Shuang

2011-12-15

It is well known that the unconditional security of quantum-key distribution (QKD) can be guaranteed by quantum mechanics. However, practical QKD systems have some imperfections, which can be controlled by the eavesdropper to attack the secret key. With current experimental technology, a realistic beam splitter, made by fused biconical technology, has a wavelength-dependent property. Based on this fatal security loophole, we propose a wavelength-dependent attacking protocol, which can be applied to all practical QKD systems with passive state modulation. Moreover, we experimentally attack a practical polarization encoding QKD system to obtain all the secret key information at the cost ofmore » only increasing the quantum bit error rate from 1.3 to 1.4%.« less

A Quasi-Copysafe Security of Documents on Normal Papersheets

DTIC Science & Technology

2000-10-01

Commercial Components ", held in Budapest, Hungary, 23-25 October 2000, and published in RTO MP-072. 32-2 Steganography : Hiding/embedding the secret information...hostile attacks (jitter attack, etc.) aiming to fool the receiver/detector by either impairing or diminishing or removing the secret message. After a...replace a watermark, when that requires the secret key. Problems : Attackers rather try to modify the watermark content. Or try to discredit the

Damage signals in the insect immune response

PubMed Central

Krautz, Robert; Arefin, Badrul; Theopold, Ulrich

2014-01-01

Insects and mammals share an ancient innate immune system comprising both humoral and cellular responses. The insect immune system consists of the fat body, which secretes effector molecules into the hemolymph and several classes of hemocytes, which reside in the hemolymph and of protective border epithelia. Key features of wound- and immune responses are shared between insect and mammalian immune systems including the mode of activation by commonly shared microbial (non-self) patterns and the recognition of these patterns by dedicated receptors. It is unclear how metazoan parasites in insects, which lack these shared motifs, are recognized. Research in recent years has demonstrated that during entry into the insect host, many eukaryotic pathogens leave traces that alert potential hosts of the damage they have afflicted. In accordance with terminology used in the mammalian immune systems, these signals have been dubbed danger- or damage-associated signals. Damage signals are necessary byproducts generated during entering hosts either by mechanical or proteolytic damage. Here, we briefly review the current stage of knowledge on how wound closure and wound healing during mechanical damage is regulated and how damage-related signals contribute to these processes. We also discuss how sensors of proteolytic activity induce insect innate immune responses. Strikingly damage-associated signals are also released from cells that have aberrant growth, including tumor cells. These signals may induce apoptosis in the damaged cells, the recruitment of immune cells to the aberrant tissue and even activate humoral responses. Thus, this ensures the removal of aberrant cells and compensatory proliferation to replace lost tissue. Several of these pathways may have been co-opted from wound healing and developmental processes. PMID:25071815

SLC26 anion exchangers of guinea pig pancreatic duct: molecular cloning and functional characterization

PubMed Central

Stewart, Andrew K.; Shmukler, Boris E.; Vandorpe, David H.; Reimold, Fabian; Heneghan, John F.; Nakakuki, M.; Akhavein, Arash; Ko, Shigeru; Ishiguro, Hiroshi

2011-01-01

The secretin-stimulated human pancreatic duct secretes HCO3−-rich fluid essential for normal digestion. Optimal stimulation of pancreatic HCO3− secretion likely requires coupled activities of the cystic fibrosis transmembrane regulator (CFTR) anion channel and apical SLC26 Cl−/HCO3− exchangers. However, whereas stimulated human and guinea pig pancreatic ducts secrete ∼140 mM HCO3− or more, mouse and rat ducts secrete ∼40–70 mM HCO3−. Moreover, the axial distribution and physiological roles of SLC26 anion exchangers in pancreatic duct secretory processes remain controversial and may vary among mammalian species. Thus the property of high HCO3− secretion shared by human and guinea pig pancreatic ducts prompted us to clone from guinea pig pancreatic duct cDNAs encoding Slc26a3, Slc26a6, and Slc26a11 polypeptides. We then functionally characterized these anion transporters in Xenopus oocytes and human embryonic kidney (HEK) 293 cells. In Xenopus oocytes, gpSlc26a3 mediated only Cl−/Cl− exchange and electroneutral Cl−/HCO3− exchange. gpSlc26a6 in Xenopus oocytes mediated Cl−/Cl− exchange and bidirectional exchange of Cl− for oxalate and sulfate, but Cl−/HCO3− exchange was detected only in HEK 293 cells. gpSlc26a11 in Xenopus oocytes exhibited pH-dependent Cl−, oxalate, and sulfate transport but no detectable Cl−/HCO3− exchange. The three gpSlc26 anion transporters exhibited distinct pharmacological profiles of 36Cl− influx, including partial sensitivity to CFTR inhibitors Inh-172 and GlyH101, but only Slc26a11 was inhibited by PPQ-102. This first molecular and functional assessment of recombinant SLC26 anion transporters from guinea pig pancreatic duct enhances our understanding of pancreatic HCO3− secretion in species that share a high HCO3− secretory output. PMID:21593449

Mitochondrial metabolism of pyruvate is essential for regulating glucose-stimulated insulin secretion.

PubMed

Patterson, Jessica N; Cousteils, Katelyn; Lou, Jennifer W; Manning Fox, Jocelyn E; MacDonald, Patrick E; Joseph, Jamie W

2014-05-09

It is well known that mitochondrial metabolism of pyruvate is critical for insulin secretion; however, we know little about how pyruvate is transported into mitochondria in β-cells. Part of the reason for this lack of knowledge is that the carrier gene was only discovered in 2012. In the current study, we assess the role of the recently identified carrier in the regulation of insulin secretion. Our studies show that β-cells express both mitochondrial pyruvate carriers (Mpc1 and Mpc2). Using both pharmacological inhibitors and siRNA-mediated knockdown of the MPCs we show that this carrier plays a key role in regulating insulin secretion in clonal 832/13 β-cells as well as rat and human islets. We also show that the MPC is an essential regulator of both the ATP-regulated potassium (KATP) channel-dependent and -independent pathways of insulin secretion. Inhibition of the MPC blocks the glucose-stimulated increase in two key signaling molecules involved in regulating insulin secretion, the ATP/ADP ratio and NADPH/NADP(+) ratio. The MPC also plays a role in in vivo glucose homeostasis as inhibition of MPC by the pharmacological inhibitor α-cyano-β-(1-phenylindol-3-yl)-acrylate (UK5099) resulted in impaired glucose tolerance. These studies clearly show that the newly identified mitochondrial pyruvate carrier sits at an important branching point in nutrient metabolism and that it is an essential regulator of insulin secretion.

Practical quantum key distribution protocol without monitoring signal disturbance.

PubMed

Sasaki, Toshihiko; Yamamoto, Yoshihisa; Koashi, Masato

2014-05-22

Quantum cryptography exploits the fundamental laws of quantum mechanics to provide a secure way to exchange private information. Such an exchange requires a common random bit sequence, called a key, to be shared secretly between the sender and the receiver. The basic idea behind quantum key distribution (QKD) has widely been understood as the property that any attempt to distinguish encoded quantum states causes a disturbance in the signal. As a result, implementation of a QKD protocol involves an estimation of the experimental parameters influenced by the eavesdropper's intervention, which is achieved by randomly sampling the signal. If the estimation of many parameters with high precision is required, the portion of the signal that is sacrificed increases, thus decreasing the efficiency of the protocol. Here we propose a QKD protocol based on an entirely different principle. The sender encodes a bit sequence onto non-orthogonal quantum states and the receiver randomly dictates how a single bit should be calculated from the sequence. The eavesdropper, who is unable to learn the whole of the sequence, cannot guess the bit value correctly. An achievable rate of secure key distribution is calculated by considering complementary choices between quantum measurements of two conjugate observables. We found that a practical implementation using a laser pulse train achieves a key rate comparable to a decoy-state QKD protocol, an often-used technique for lasers. It also has a better tolerance of bit errors and of finite-sized-key effects. We anticipate that this finding will give new insight into how the probabilistic nature of quantum mechanics can be related to secure communication, and will facilitate the simple and efficient use of conventional lasers for QKD.

Security of a single-state semi-quantum key distribution protocol

NASA Astrophysics Data System (ADS)

Zhang, Wei; Qiu, Daowen; Mateus, Paulo

2018-06-01

Semi-quantum key distribution protocols are allowed to set up a secure secret key between two users. Compared with their full quantum counterparts, one of the two users is restricted to perform some "classical" or "semi-quantum" operations, which potentially makes them easily realizable by using less quantum resource. However, the semi-quantum key distribution protocols mainly rely on a two-way quantum channel. The eavesdropper has two opportunities to intercept the quantum states transmitted in the quantum communication stage. It may allow the eavesdropper to get more information and make the security analysis more complicated. In the past ten years, many semi-quantum key distribution protocols have been proposed and proved to be robust. However, there are few works concerning their unconditional security. It is doubted that how secure the semi-quantum ones are and how much noise they can tolerate to establish a secure secret key. In this paper, we prove the unconditional security of a single-state semi-quantum key distribution protocol proposed by Zou et al. (Phys Rev A 79:052312, 2009). We present a complete proof from information theory aspect by deriving a lower bound of the protocol's key rate in the asymptotic scenario. Using this bound, we figure out an error threshold value such that for all error rates that are less than this threshold value, the secure secret key can be established between the legitimate users definitely. Otherwise, the users should abort the protocol. We make an illustration of the protocol under the circumstance that the reverse quantum channel is a depolarizing one with parameter q. Additionally, we compare the error threshold value with some full quantum protocols and several existing semi-quantum ones whose unconditional security proofs have been provided recently.

Preserving privacy of online digital physiological signals using blind and reversible steganography.

PubMed

Shiu, Hung-Jr; Lin, Bor-Sing; Huang, Chien-Hung; Chiang, Pei-Ying; Lei, Chin-Laung

2017-11-01

Physiological signals such as electrocardiograms (ECG) and electromyograms (EMG) are widely used to diagnose diseases. Presently, the Internet offers numerous cloud storage services which enable digital physiological signals to be uploaded for convenient access and use. Numerous online databases of medical signals have been built. The data in them must be processed in a manner that preserves patients' confidentiality. A reversible error-correcting-coding strategy will be adopted to transform digital physiological signals into a new bit-stream that uses a matrix in which is embedded the Hamming code to pass secret messages or private information. The shared keys are the matrix and the version of the Hamming code. An online open database, the MIT-BIH arrhythmia database, was used to test the proposed algorithms. The time-complexity, capacity and robustness are evaluated. Comparisons of several evaluations subject to related work are also proposed. This work proposes a reversible, low-payload steganographic scheme for preserving the privacy of physiological signals. An (n,  m)-hamming code is used to insert (n - m) secret bits into n bits of a cover signal. The number of embedded bits per modification is higher than in comparable methods, and the computational power is efficient and the scheme is secure. Unlike other Hamming-code based schemes, the proposed scheme is both reversible and blind. Copyright © 2017 Elsevier B.V. All rights reserved.

Key principles for a national clinical decision support knowledge sharing framework: synthesis of insights from leading subject matter experts.

PubMed

Kawamoto, Kensaku; Hongsermeier, Tonya; Wright, Adam; Lewis, Janet; Bell, Douglas S; Middleton, Blackford

2013-01-01

To identify key principles for establishing a national clinical decision support (CDS) knowledge sharing framework. As part of an initiative by the US Office of the National Coordinator for Health IT (ONC) to establish a framework for national CDS knowledge sharing, key stakeholders were identified. Stakeholders' viewpoints were obtained through surveys and in-depth interviews, and findings and relevant insights were summarized. Based on these insights, key principles were formulated for establishing a national CDS knowledge sharing framework. Nineteen key stakeholders were recruited, including six executives from electronic health record system vendors, seven executives from knowledge content producers, three executives from healthcare provider organizations, and three additional experts in clinical informatics. Based on these stakeholders' insights, five key principles were identified for effectively sharing CDS knowledge nationally. These principles are (1) prioritize and support the creation and maintenance of a national CDS knowledge sharing framework; (2) facilitate the development of high-value content and tooling, preferably in an open-source manner; (3) accelerate the development or licensing of required, pragmatic standards; (4) acknowledge and address medicolegal liability concerns; and (5) establish a self-sustaining business model. Based on the principles identified, a roadmap for national CDS knowledge sharing was developed through the ONC's Advancing CDS initiative. The study findings may serve as a useful guide for ongoing activities by the ONC and others to establish a national framework for sharing CDS knowledge and improving clinical care.

Distributed generation of shared RSA keys in mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Liu, Yi-Liang; Huang, Qin; Shen, Ying

2005-12-01

Mobile Ad Hoc Networks is a totally new concept in which mobile nodes are able to communicate together over wireless links in an independent manner, independent of fixed physical infrastructure and centralized administrative infrastructure. However, the nature of Ad Hoc Networks makes them very vulnerable to security threats. Generation and distribution of shared keys for CA (Certification Authority) is challenging for security solution based on distributed PKI(Public-Key Infrastructure)/CA. The solutions that have been proposed in the literature and some related issues are discussed in this paper. The solution of a distributed generation of shared threshold RSA keys for CA is proposed in the present paper. During the process of creating an RSA private key share, every CA node only has its own private security. Distributed arithmetic is used to create the CA's private share locally, and that the requirement of centralized management institution is eliminated. Based on fully considering the Mobile Ad Hoc network's characteristic of self-organization, it avoids the security hidden trouble that comes by holding an all private security share of CA, with which the security and robustness of system is enhanced.

Protecting Trade Secrets in Canada

PubMed Central

Courage, Noel; Calzavara, Janice

2015-01-01

Patents in the life sciences industries are a key form of intellectual property (IP), particularly for products such as brand-name drugs and medical devices. However, trade secrets can also be a useful tool for many types of innovations. In appropriate cases, trade secrets can offer long-term protection of IP for a lower financial cost than patenting. This type of protection must be approached with caution as there is little room for error when protecting a trade secret. Strong agreements and scrupulous security can help to protect the secret. Once a trade secret is disclosed to the public, it cannot be restored as the owner's property; however, if the information is kept from the public domain, the owner can have a property right of unlimited duration in the information. In some situations patents and trade secrets may be used cooperatively to protect innovation, particularly for manufacturing processes. PMID:25986591

A more secure parallel keyed hash function based on chaotic neural network

NASA Astrophysics Data System (ADS)

Huang, Zhongquan

2011-08-01

Although various hash functions based on chaos or chaotic neural network were proposed, most of them can not work efficiently in parallel computing environment. Recently, an algorithm for parallel keyed hash function construction based on chaotic neural network was proposed [13]. However, there is a strict limitation in this scheme that its secret keys must be nonce numbers. In other words, if the keys are used more than once in this scheme, there will be some potential security flaw. In this paper, we analyze the cause of vulnerability of the original one in detail, and then propose the corresponding enhancement measures, which can remove the limitation on the secret keys. Theoretical analysis and computer simulation indicate that the modified hash function is more secure and practical than the original one. At the same time, it can keep the parallel merit and satisfy the other performance requirements of hash function, such as good statistical properties, high message and key sensitivity, and strong collision resistance, etc.

Autonomous Information Unit for Fine-Grain Data Access Control and Information Protection in a Net-Centric System

NASA Technical Reports Server (NTRS)

Chow, Edward T.; Woo, Simon S.; James, Mark; Paloulian, George K.

2012-01-01

As communication and networking technologies advance, networks will become highly complex and heterogeneous, interconnecting different network domains. There is a need to provide user authentication and data protection in order to further facilitate critical mission operations, especially in the tactical and mission-critical net-centric networking environment. The Autonomous Information Unit (AIU) technology was designed to provide the fine-grain data access and user control in a net-centric system-testing environment to meet these objectives. The AIU is a fundamental capability designed to enable fine-grain data access and user control in the cross-domain networking environments, where an AIU is composed of the mission data, metadata, and policy. An AIU provides a mechanism to establish trust among deployed AIUs based on recombining shared secrets, authentication and verify users with a username, X.509 certificate, enclave information, and classification level. AIU achieves data protection through (1) splitting data into multiple information pieces using the Shamir's secret sharing algorithm, (2) encrypting each individual information piece using military-grade AES-256 encryption, and (3) randomizing the position of the encrypted data based on the unbiased and memory efficient in-place Fisher-Yates shuffle method. Therefore, it becomes virtually impossible for attackers to compromise data since attackers need to obtain all distributed information as well as the encryption key and the random seeds to properly arrange the data. In addition, since policy can be associated with data in the AIU, different user access and data control strategies can be included. The AIU technology can greatly enhance information assurance and security management in the bandwidth-limited and ad hoc net-centric environments. In addition, AIU technology can be applicable to general complex network domains and applications where distributed user authentication and data protection are necessary. AIU achieves fine-grain data access and user control, reducing the security risk significantly, simplifying the complexity of various security operations, and providing the high information assurance across different network domains.

On Hierarchical Threshold Access Structures

DTIC Science & Technology

2010-11-01

One of the recent generalizations of (t, n) secret sharing for hierarchical threshold access structures is given by Tassa, where he answers the...of theoretical background. We give a conceptually simpler alternative for the understanding of the realization of hierarchical threshold access

Differential Fault Analysis on CLEFIA

NASA Astrophysics Data System (ADS)

Chen, Hua; Wu, Wenling; Feng, Dengguo

CLEFIA is a new 128-bit block cipher proposed by SONY corporation recently. The fundamental structure of CLEFIA is a generalized Feistel structure consisting of 4 data lines. In this paper, the strength of CLEFIA against the differential fault attack is explored. Our attack adopts the byte-oriented model of random faults. Through inducing randomly one byte fault in one round, four bytes of faults can be simultaneously obtained in the next round, which can efficiently reduce the total induce times in the attack. After attacking the last several rounds' encryptions, the original secret key can be recovered based on some analysis of the key schedule. The data complexity analysis and experiments show that only about 18 faulty ciphertexts are needed to recover the entire 128-bit secret key and about 54 faulty ciphertexts for 192/256-bit keys.

A fiber-based quasi-continuous-wave quantum key distribution system

PubMed Central

Shen, Yong; Chen, Yan; Zou, Hongxin; Yuan, Jianmin

2014-01-01

We report a fiber-based quasi-continuous-wave (CW) quantum key distribution (QKD) system with continuous variables (CV). This system employs coherent light pulses and time multiplexing to maximally reduce cross talk in the fiber. No-switching detection scheme is adopted to optimize the repetition rate. Information is encoded on the sideband of the pulsed coherent light to fully exploit the continuous wave nature of laser field. With this configuration, high secret key rate can be achieved. For the 50 MHz detected bandwidth in our experiment, when the multidimensional reconciliation protocol is applied, a secret key rate of 187 kb/s can be achieved over 50 km of optical fiber against collective attacks, which have been shown to be asymptotically optimal. Moreover, recently studied loopholes have been fixed in our system. PMID:24691409

Accurate prediction of secreted substrates and identification of a conserved putative secretion signal for type III secretion systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Samudrala, Ram; Heffron, Fred; McDermott, Jason E.

2009-04-24

The type III secretion system is an essential component for virulence in many Gram-negative bacteria. Though components of the secretion system apparatus are conserved, its substrates, effector proteins, are not. We have used a machine learning approach to identify new secreted effectors. The method integrates evolutionary measures, such as the pattern of homologs in a range of other organisms, and sequence-based features, such as G+C content, amino acid composition and the N-terminal 30 residues of the protein sequence. The method was trained on known effectors from Salmonella typhimurium and validated on a corresponding set of effectors from Pseudomonas syringae, aftermore » eliminating effectors with detectable sequence similarity. The method was able to identify all of the known effectors in P. syringae with a specificity of 84% and sensitivity of 82%. The reciprocal validation, training on P. syringae and validating on S. typhimurium, gave similar results with a specificity of 86% when the sensitivity level was 87%. These results show that type III effectors in disparate organisms share common features. We found that maximal performance is attained by including an N-terminal sequence of only 30 residues, which agrees with previous studies indicating that this region contains the secretion signal. We then used the method to define the most important residues in this putative secretion signal. Finally, we present novel predictions of secreted effectors in S. typhimurium, some of which have been experimentally validated, and apply the method to predict secreted effectors in the genetically intractable human pathogen Chlamydia trachomatis. This approach is a novel and effective way to identify secreted effectors in a broad range of pathogenic bacteria for further experimental characterization and provides insight into the nature of the type III secretion signal.« less

Efficiency of primary saliva secretion: an analysis of parameter dependence in dynamic single-cell and acinus models, with application to aquaporin knockout studies

PubMed Central

Maclaren, Oliver J.; Sneyd, James; Crampin, Edmund J.

2012-01-01

Secretion from the salivary glands is driven by osmosis following the establishment of osmotic gradients between the lumen, the cell and the interstitium by active ion transport. We consider a dynamic model of osmotically-driven primary saliva secretion, and use singular perturbation approaches and scaling assumptions to reduce the model. Our analysis shows that isosmotic secretion is the most efficient secretion regime, and that this holds for single isolated cells and for multiple cells assembled into an acinus. For typical parameter variations, we rule out any significant synergistic effect on total water secretion of an acinar arrangement of cells about a single shared lumen. Conditions for the attainment of isosmotic secretion are considered, and we derive an expression for how the concentration gradient between the interstitium and the lumen scales with water and chloride transport parameters. Aquaporin knockout studies are interpreted in the context of our analysis and further investigated using simulations of transport efficiency with different membrane water permeabilities. We conclude that recent claims that aquaporin knockout studies can be interpreted as evidence against a simple osmotic mechanism are not supported by our work. Many of the results that we obtain are independent of specific transporter details, and our analysis can be easily extended to apply to models that use other proposed ionic mechanisms of saliva secretion. PMID:22258315

Mutations in ppe38 block PE_PGRS secretion and increase virulence of Mycobacterium tuberculosis.

PubMed

Ates, Louis S; Dippenaar, Anzaan; Ummels, Roy; Piersma, Sander R; van der Woude, Aniek D; van der Kuij, Kim; Le Chevalier, Fabien; Mata-Espinosa, Dulce; Barrios-Payán, Jorge; Marquina-Castillo, Brenda; Guapillo, Carolina; Jiménez, Connie R; Pain, Arnab; Houben, Edith N G; Warren, Robin M; Brosch, Roland; Hernández-Pando, Rogelio; Bitter, Wilbert

2018-02-01

Mycobacterium tuberculosis requires a large number of secreted and exported proteins for its virulence, immune modulation and nutrient uptake. Most of these proteins are transported by the different type VII secretion systems 1,2 . The most recently evolved type VII secretion system, ESX-5, secretes dozens of substrates belonging to the PE and PPE families, which are named for conserved proline and glutamic acid residues close to the amino terminus 3,4 . However, the role of these proteins remains largely elusive 1 . Here, we show that mutations of ppe38 completely block the secretion of two large subsets of ESX-5 substrates, that is, PPE-MPTR and PE_PGRS, together comprising >80 proteins. Importantly, hypervirulent clinical M. tuberculosis strains of the Beijing lineage have such a mutation and a concomitant loss of secretion 5 . Restoration of PPE38-dependent secretion partially reverted the hypervirulence phenotype of a Beijing strain, and deletion of ppe38 in moderately virulent M. tuberculosis increased virulence. This indicates that these ESX-5 substrates have an important role in virulence attenuation. Phylogenetic analysis revealed that deletion of ppe38 occurred at the branching point of the 'modern' Beijing sublineage and is shared by Beijing outbreak strains worldwide, suggesting that this deletion may have contributed to their success and global distribution 6,7 .

Continuous-variable quantum cryptography with an untrusted relay: Detailed security analysis of the symmetric configuration

NASA Astrophysics Data System (ADS)

Ottaviani, Carlo; Spedalieri, Gaetana; Braunstein, Samuel L.; Pirandola, Stefano

2015-02-01

We consider the continuous-variable protocol of Pirandola et al. [arXiv:1312.4104] where the secret key is established by the measurement of an untrusted relay. In this network protocol, two authorized parties are connected to an untrusted relay by insecure quantum links. Secret correlations are generated by a continuous-variable Bell detection performed on incoming coherent states. In the present work we provide a detailed study of the symmetric configuration, where the relay is midway between the parties. We analyze symmetric eavesdropping strategies against the quantum links explicitly showing that, at fixed transmissivity and thermal noise, two-mode coherent attacks are optimal, manifestly outperforming one-mode collective attacks based on independent entangling cloners. Such an advantage is shown both in terms of security threshold and secret-key rate.

Advanced technologies for encryption of satellite links

NASA Astrophysics Data System (ADS)

McMahan, Sherry S.

The use of encryption on satellite links is discussed. Advanced technology exists to provide transmission security for large earth station with data rates up to 50 megabits per second. One of the major concerns in the use of encryption equipment with very small aperture terminals (VSAT) is the key management issue and the related operational costs. The low cost requirement and the lack of physical protection of remote VSATs place severe constraints on the design of encryption equipment. Encryption may be accomplished by embedding a tamper proof encryption module into the baseband unit of each VSAT. VSAT networks are usually star networks where there is a single large earth station that serves as a hub and all satellite communications takes place between each VSAT and the hub earth station. The hub earth station has the secret master key of each VSAT. These master keys are used to downline load encrypted session keys to each VSAT. A more secure alternative is to use public key techniques where each embedded VSAT encryption module internally generates its own secret and public numbers. The secret number never leaves the module while the public number is sent to the hub at the time of initialization of the encryption module into the VSAT. Physical access control to encryption modules of VSAT systems can be implemented using passwords, smart cards or biometrics.

A two-dimensional electrophoretic profile of the proteins secreted by Herbaspirillum seropedicae strain Z78.

PubMed

Chaves, Daniela Fojo Seixas; de Souza, Emanuel Maltempi; Monteiro, Rose Adele; de Oliveira Pedrosa, Fábio

2009-11-02

Herbaspirillum seropedicae is an endophytic bacterium that associates with rice, sugarcane and other economically important crops. Secreted proteins play a key role in the plant-bacterial interaction. Using 2D electrophoresis and peptide mass fingerprint mass spectrometry, 63 protein spots representing 41 different secreted proteins were identified during growth of H. seropedicae under nitrogen-sufficient conditions. In silico analysis showed that 25.4% of the proteins had signal peptides and 15.9% were predicted to be non-classically secreted. Among the most abundant were flagellar components and ABC-type transport system proteins. Nine secreted proteins had also been identified in the cellular proteome, suggesting that they also play a role in the extracellular environment. No type III secreted proteins were detected by comparison of the wild type strain with an hrcN mutant strain.

Key principles for a national clinical decision support knowledge sharing framework: synthesis of insights from leading subject matter experts

PubMed Central

Hongsermeier, Tonya; Wright, Adam; Lewis, Janet; Bell, Douglas S; Middleton, Blackford

2013-01-01

Objective To identify key principles for establishing a national clinical decision support (CDS) knowledge sharing framework. Materials and methods As part of an initiative by the US Office of the National Coordinator for Health IT (ONC) to establish a framework for national CDS knowledge sharing, key stakeholders were identified. Stakeholders' viewpoints were obtained through surveys and in-depth interviews, and findings and relevant insights were summarized. Based on these insights, key principles were formulated for establishing a national CDS knowledge sharing framework. Results Nineteen key stakeholders were recruited, including six executives from electronic health record system vendors, seven executives from knowledge content producers, three executives from healthcare provider organizations, and three additional experts in clinical informatics. Based on these stakeholders' insights, five key principles were identified for effectively sharing CDS knowledge nationally. These principles are (1) prioritize and support the creation and maintenance of a national CDS knowledge sharing framework; (2) facilitate the development of high-value content and tooling, preferably in an open-source manner; (3) accelerate the development or licensing of required, pragmatic standards; (4) acknowledge and address medicolegal liability concerns; and (5) establish a self-sustaining business model. Discussion Based on the principles identified, a roadmap for national CDS knowledge sharing was developed through the ONC's Advancing CDS initiative. Conclusion The study findings may serve as a useful guide for ongoing activities by the ONC and others to establish a national framework for sharing CDS knowledge and improving clinical care. PMID:22865671

Practical challenges in quantum key distribution

DOE PAGES

Diamanti, Eleni; Lo, Hoi -Kwong; Qi, Bing; ...

2016-11-08

Here, quantum key distribution (QKD) promises unconditional security in data communication and is currently being deployed in commercial applications. Nonetheless, before QKD can be widely adopted, it faces a number of important challenges such as secret key rate, distance, size, cost and practical security. Here, we survey those key challenges and the approaches that are currently being taken to address them.

Practical challenges in quantum key distribution

DOE Office of Scientific and Technical Information (OSTI.GOV)

Diamanti, Eleni; Lo, Hoi -Kwong; Qi, Bing

Here, quantum key distribution (QKD) promises unconditional security in data communication and is currently being deployed in commercial applications. Nonetheless, before QKD can be widely adopted, it faces a number of important challenges such as secret key rate, distance, size, cost and practical security. Here, we survey those key challenges and the approaches that are currently being taken to address them.

Completely device-independent quantum key distribution

NASA Astrophysics Data System (ADS)

Aguilar, Edgar A.; Ramanathan, Ravishankar; Kofler, Johannes; Pawłowski, Marcin

2016-08-01

Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a common secret key, which then can be used in a classical cryptographic scheme. Using quantum entanglement, one can reduce the necessary assumptions that the parties have to make about their devices, giving rise to device-independent QKD (DIQKD). However, in all existing protocols to date the parties need to have an initial (at least partially) random seed as a resource. In this work, we show that this requirement can be dropped. Using recent advances in the fields of randomness amplification and randomness expansion, we demonstrate that it is sufficient for the message the parties want to communicate to be (partially) unknown to the adversaries—an assumption without which any type of cryptography would be pointless to begin with. One party can use her secret message to locally generate a secret sequence of bits, which can then be openly used by herself and the other party in a DIQKD protocol. Hence our work reduces the requirements needed to perform secure DIQKD and establish safe communication.

Novel secret key generation techniques using memristor devices

NASA Astrophysics Data System (ADS)

Abunahla, Heba; Shehada, Dina; Yeun, Chan Yeob; Mohammad, Baker; Jaoude, Maguy Abi

2016-02-01

This paper proposes novel secret key generation techniques using memristor devices. The approach depends on using the initial profile of a memristor as a master key. In addition, session keys are generated using the master key and other specified parameters. In contrast to existing memristor-based security approaches, the proposed development is cost effective and power efficient since the operation can be achieved with a single device rather than a crossbar structure. An algorithm is suggested and demonstrated using physics based Matlab model. It is shown that the generated keys can have dynamic size which provides perfect security. Moreover, the proposed encryption and decryption technique using the memristor based generated keys outperforms Triple Data Encryption Standard (3DES) and Advanced Encryption Standard (AES) in terms of processing time. This paper is enriched by providing characterization results of a fabricated microscale Al/TiO2/Al memristor prototype in order to prove the concept of the proposed approach and study the impacts of process variations. The work proposed in this paper is a milestone towards System On Chip (SOC) memristor based security.

Color extended visual cryptography using error diffusion.

PubMed

Kang, InKoo; Arce, Gonzalo R; Lee, Heung-Kyu

2011-01-01

Color visual cryptography (VC) encrypts a color secret message into n color halftone image shares. Previous methods in the literature show good results for black and white or gray scale VC schemes, however, they are not sufficient to be applied directly to color shares due to different color structures. Some methods for color visual cryptography are not satisfactory in terms of producing either meaningless shares or meaningful shares with low visual quality, leading to suspicion of encryption. This paper introduces the concept of visual information pixel (VIP) synchronization and error diffusion to attain a color visual cryptography encryption method that produces meaningful color shares with high visual quality. VIP synchronization retains the positions of pixels carrying visual information of original images throughout the color channels and error diffusion generates shares pleasant to human eyes. Comparisons with previous approaches show the superior performance of the new method.

46 CFR 298.3 - Applications.

Code of Federal Regulations, 2010 CFR

2010-10-01

... ADMINISTRATION, DEPARTMENT OF TRANSPORTATION VESSEL FINANCING ASSISTANCE OBLIGATION GUARANTEES Introduction § 298... if you are not a well established firm with strong financial qualifications and strong market shares... attachments, contains information you consider to be trade secrets or commercial or financial information and...

SNARE-encoding genes VdSec22 and VdSso1 mediate protein secretion required for full virulence in Verticillium dahliae

USDA-ARS?s Scientific Manuscript database

Proteins that mediate cellular and subcellular membrane fusion are key factors in vesicular trafficking in all eukaryotic cells, including the secretion and transport of plant pathogen virulence factors. In this study, we identified vesicle fusion components that included 22 soluble N-ethylmaleimide...

Pituitary-hormone secretion by thyrotropinomas.

PubMed

Roelfsema, Ferdinand; Kok, Simon; Kok, Petra; Pereira, Alberto M; Biermasz, Nienke R; Smit, Jan W; Frolich, Marijke; Keenan, Daniel M; Veldhuis, Johannes D; Romijn, Johannes A

2009-01-01

Hormone secretion by somatotropinomas, corticotropinomas and prolactinomas exhibits increased pulse frequency, basal and pulsatile secretion, accompanied by greater disorderliness. Increased concentrations of growth hormone (GH) or prolactin (PRL) are observed in about 30% of thyrotropinomas leading to acromegaly or disturbed sexual functions beyond thyrotropin (TSH)-induced hyperthyroidism. Regulation of non-TSH pituitary hormones in this context is not well understood. We there therefore evaluated TSH, GH and PRL secretion in 6 patients with up-to-date analytical and mathematical tools by 24-h blood sampling at 10-min intervals in a clinical research laboratory. The profiles were analyzed with a new deconvolution method, approximate entropy, cross-approximate entropy, cross-correlation and cosinor regression. TSH burst frequency and basal and pulsatile secretion were increased in patients compared with controls. TSH secretion patterns in patients were more irregular, but the diurnal rhythm was preserved at a higher mean with a 2.5 h phase delay. Although only one patient had clinical acromegaly, GH secretion and IGF-I levels were increased in two other patients and all three had a significant cross-correlation between the GH and TSH. PRL secretion was increased in one patient, but all patients had a significant cross-correlation with TSH and showed decreased PRL regularity. Cross-ApEn synchrony between TSH and GH did not differ between patients and controls, but TSH and PRL synchrony was reduced in patients. We conclude that TSH secretion by thyrotropinomas shares many characteristics of other pituitary hormone-secreting adenomas. In addition, abnormalities in GH and PRL secretion exist ranging from decreased (joint) regularity to overt hypersecretion, although not always clinically obvious, suggesting tumoral transformation of thyrotrope lineage cells.

Extremality of Gaussian quantum states.

PubMed

Wolf, Michael M; Giedke, Geza; Cirac, J Ignacio

2006-03-03

We investigate Gaussian quantum states in view of their exceptional role within the space of all continuous variables states. A general method for deriving extremality results is provided and applied to entanglement measures, secret key distillation and the classical capacity of bosonic quantum channels. We prove that for every given covariance matrix the distillable secret key rate and the entanglement, if measured appropriately, are minimized by Gaussian states. This result leads to a clearer picture of the validity of frequently made Gaussian approximations. Moreover, it implies that Gaussian encodings are optimal for the transmission of classical information through bosonic channels, if the capacity is additive.

Key on demand (KoD) for software-defined optical networks secured by quantum key distribution (QKD).

PubMed

Cao, Yuan; Zhao, Yongli; Colman-Meixner, Carlos; Yu, Xiaosong; Zhang, Jie

2017-10-30

Software-defined optical networking (SDON) will become the next generation optical network architecture. However, the optical layer and control layer of SDON are vulnerable to cyberattacks. While, data encryption is an effective method to minimize the negative effects of cyberattacks, secure key interchange is its major challenge which can be addressed by the quantum key distribution (QKD) technique. Hence, in this paper we discuss the integration of QKD with WDM optical networks to secure the SDON architecture by introducing a novel key on demand (KoD) scheme which is enabled by a novel routing, wavelength and key assignment (RWKA) algorithm. The QKD over SDON with KoD model follows two steps to provide security: i) quantum key pools (QKPs) construction for securing the control channels (CChs) and data channels (DChs); ii) the KoD scheme uses RWKA algorithm to allocate and update secret keys for different security requirements. To test our model, we define a security probability index which measures the security gain in CChs and DChs. Simulation results indicate that the security performance of CChs and DChs can be enhanced by provisioning sufficient secret keys in QKPs and performing key-updating considering potential cyberattacks. Also, KoD is beneficial to achieve a positive balance between security requirements and key resource usage.

Security analysis of orthogonal-frequency-division-multiplexing-based continuous-variable quantum key distribution with imperfect modulation

NASA Astrophysics Data System (ADS)

Zhang, Hang; Mao, Yu; Huang, Duan; Li, Jiawei; Zhang, Ling; Guo, Ying

2018-05-01

We introduce a reliable scheme for continuous-variable quantum key distribution (CV-QKD) by using orthogonal frequency division multiplexing (OFDM). As a spectrally efficient multiplexing technique, OFDM allows a large number of closely spaced orthogonal subcarrier signals used to carry data on several parallel data streams or channels. We place emphasis on modulator impairments which would inevitably arise in the OFDM system and analyze how these impairments affect the OFDM-based CV-QKD system. Moreover, we also evaluate the security in the asymptotic limit and the Pirandola-Laurenza-Ottaviani-Banchi upper bound. Results indicate that although the emergence of imperfect modulation would bring about a slight decrease in the secret key bit rate of each subcarrier, the multiplexing technique combined with CV-QKD results in a desirable improvement on the total secret key bit rate which can raise the numerical value about an order of magnitude.

Experimental quantum key distribution at 1.3 gigabit-per-second secret-key rate over a 10 dB loss channel

NASA Astrophysics Data System (ADS)

Zhang, Zheshen; Chen, Changchen; Zhuang, Quntao; Wong, Franco N. C.; Shapiro, Jeffrey H.

2018-04-01

Quantum key distribution (QKD) enables unconditionally secure communication ensured by the laws of physics, opening a promising route to security infrastructure for the coming age of quantum computers. QKD’s demonstrated secret-key rates (SKRs), however, fall far short of the gigabit-per-second rates of classical communication, hindering QKD’s widespread deployment. QKD’s low SKRs are largely due to existing single-photon-based protocols’ vulnerability to channel loss. Floodlight QKD (FL-QKD) boosts SKR by transmitting many photons per encoding, while offering security against collective attacks. Here, we report an FL-QKD experiment operating at a 1.3 Gbit s‑1 SKR over a 10 dB loss channel. To the best of our knowledge, this is the first QKD demonstration that achieves a gigabit-per-second-class SKR, representing a critical advance toward high-rate QKD at metropolitan-area distances.

Secret information reconciliation based on punctured low-density parity-check codes for continuous-variable quantum key distribution

NASA Astrophysics Data System (ADS)

Jiang, Xue-Qin; Huang, Peng; Huang, Duan; Lin, Dakai; Zeng, Guihua

2017-02-01

Achieving information theoretic security with practical complexity is of great interest to continuous-variable quantum key distribution in the postprocessing procedure. In this paper, we propose a reconciliation scheme based on the punctured low-density parity-check (LDPC) codes. Compared to the well-known multidimensional reconciliation scheme, the present scheme has lower time complexity. Especially when the chosen punctured LDPC code achieves the Shannon capacity, the proposed reconciliation scheme can remove the information that has been leaked to an eavesdropper in the quantum transmission phase. Therefore, there is no information leaked to the eavesdropper after the reconciliation stage. This indicates that the privacy amplification algorithm of the postprocessing procedure is no more needed after the reconciliation process. These features lead to a higher secret key rate, optimal performance, and availability for the involved quantum key distribution scheme.

Security proof of continuous-variable quantum key distribution using three coherent states

NASA Astrophysics Data System (ADS)

Brádler, Kamil; Weedbrook, Christian

2018-02-01

We introduce a ternary quantum key distribution (QKD) protocol and asymptotic security proof based on three coherent states and homodyne detection. Previous work had considered the binary case of two coherent states and here we nontrivially extend this to three. Our motivation is to leverage the practical benefits of both discrete and continuous (Gaussian) encoding schemes creating a best-of-both-worlds approach; namely, the postprocessing of discrete encodings and the hardware benefits of continuous ones. We present a thorough and detailed security proof in the limit of infinite signal states which allows us to lower bound the secret key rate. We calculate this is in the context of collective eavesdropping attacks and reverse reconciliation postprocessing. Finally, we compare the ternary coherent state protocol to other well-known QKD schemes (and fundamental repeaterless limits) in terms of secret key rates and loss.

Continuous-variable measurement-device-independent quantum key distribution: Composable security against coherent attacks

NASA Astrophysics Data System (ADS)

Lupo, Cosmo; Ottaviani, Carlo; Papanastasiou, Panagiotis; Pirandola, Stefano

2018-05-01

We present a rigorous security analysis of continuous-variable measurement-device-independent quantum key distribution (CV MDI QKD) in a finite-size scenario. The security proof is obtained in two steps: by first assessing the security against collective Gaussian attacks, and then extending to the most general class of coherent attacks via the Gaussian de Finetti reduction. Our result combines recent state-of-the-art security proofs for CV QKD with findings about min-entropy calculus and parameter estimation. In doing so, we improve the finite-size estimate of the secret key rate. Our conclusions confirm that CV MDI protocols allow for high rates on the metropolitan scale, and may achieve a nonzero secret key rate against the most general class of coherent attacks after 107-109 quantum signal transmissions, depending on loss and noise, and on the required level of security.

Quantum key distribution using continuous-variable non-Gaussian states

NASA Astrophysics Data System (ADS)

Borelli, L. F. M.; Aguiar, L. S.; Roversi, J. A.; Vidiella-Barranco, A.

2016-02-01

In this work, we present a quantum key distribution protocol using continuous-variable non-Gaussian states, homodyne detection and post-selection. The employed signal states are the photon added then subtracted coherent states (PASCS) in which one photon is added and subsequently one photon is subtracted from the field. We analyze the performance of our protocol, compared with a coherent state-based protocol, for two different attacks that could be carried out by the eavesdropper (Eve). We calculate the secret key rate transmission in a lossy line for a superior channel (beam-splitter) attack, and we show that we may increase the secret key generation rate by using the non-Gaussian PASCS rather than coherent states. We also consider the simultaneous quadrature measurement (intercept-resend) attack, and we show that the efficiency of Eve's attack is substantially reduced if PASCS are used as signal states.

High-rate measurement-device-independent quantum cryptography

NASA Astrophysics Data System (ADS)

Pirandola, Stefano; Ottaviani, Carlo; Spedalieri, Gaetana; Weedbrook, Christian; Braunstein, Samuel L.; Lloyd, Seth; Gehring, Tobias; Jacobsen, Christian S.; Andersen, Ulrik L.

2015-06-01

Quantum cryptography achieves a formidable task—the remote distribution of secret keys by exploiting the fundamental laws of physics. Quantum cryptography is now headed towards solving the practical problem of constructing scalable and secure quantum networks. A significant step in this direction has been the introduction of measurement-device independence, where the secret key between two parties is established by the measurement of an untrusted relay. Unfortunately, although qubit-implemented protocols can reach long distances, their key rates are typically very low, unsuitable for the demands of a metropolitan network. Here we show, theoretically and experimentally, that a solution can come from the use of continuous-variable systems. We design a coherent-state network protocol able to achieve remarkably high key rates at metropolitan distances, in fact three orders of magnitude higher than those currently achieved. Our protocol could be employed to build high-rate quantum networks where devices securely connect to nearby access points or proxy servers.

Security of a semi-quantum protocol where reflections contribute to the secret key

NASA Astrophysics Data System (ADS)

Krawec, Walter O.

2016-05-01

In this paper, we provide a proof of unconditional security for a semi-quantum key distribution protocol introduced in a previous work. This particular protocol demonstrated the possibility of using X basis states to contribute to the raw key of the two users (as opposed to using only direct measurement results) even though a semi-quantum participant cannot directly manipulate such states. In this work, we provide a complete proof of security by deriving a lower bound of the protocol's key rate in the asymptotic scenario. Using this bound, we are able to find an error threshold value such that for all error rates less than this threshold, it is guaranteed that A and B may distill a secure secret key; for error rates larger than this threshold, A and B should abort. We demonstrate that this error threshold compares favorably to several fully quantum protocols. We also comment on some interesting observations about the behavior of this protocol under certain noise scenarios.

Parameter Estimation with Almost No Public Communication for Continuous-Variable Quantum Key Distribution

NASA Astrophysics Data System (ADS)

Lupo, Cosmo; Ottaviani, Carlo; Papanastasiou, Panagiotis; Pirandola, Stefano

2018-06-01

One crucial step in any quantum key distribution (QKD) scheme is parameter estimation. In a typical QKD protocol the users have to sacrifice part of their raw data to estimate the parameters of the communication channel as, for example, the error rate. This introduces a trade-off between the secret key rate and the accuracy of parameter estimation in the finite-size regime. Here we show that continuous-variable QKD is not subject to this constraint as the whole raw keys can be used for both parameter estimation and secret key generation, without compromising the security. First, we show that this property holds for measurement-device-independent (MDI) protocols, as a consequence of the fact that in a MDI protocol the correlations between Alice and Bob are postselected by the measurement performed by an untrusted relay. This result is then extended beyond the MDI framework by exploiting the fact that MDI protocols can simulate device-dependent one-way QKD with arbitrarily high precision.

A broad diversity of volatile carboxylic acids, released by a bacterial aminoacylase from axilla secretions, as candidate molecules for the determination of human-body odor type.

PubMed

Natsch, Andreas; Derrer, Samuel; Flachsmann, Felix; Schmid, Joachim

2006-01-01

Human body odor is to a large part determined by secretions of glands in the axillary regions. Two key odoriferous principles, 3-methylhex-2-enoic acid (3MH2; 4/5) and 3-hydroxy-3-methylhexanoic acid (HMHA; 6) have been shown to be released from glutamine conjugates secreted in the axilla by a specific N(alpha)-acyl-glutamine aminoacylase (N-AGA) obtained from axilla isolates of Corynebacteria sp. However, the low number of different odorants reported in humans stands in contrast to the observed high inter-individual variability in body odors. Axilla secretions of individual donors were, therefore, analyzed in detail. The secretions were treated with N-AGA, analyzed by GC/MS, and compared to undigested controls. Over 28 different carboxylic acids were released by this enzyme from odorless axilla secretions (Table 1). Many of these body odorants have not been reported before from a natural source, and they include several aliphatic 3-hydroxy acids with 4-Me branches, 3,4-unsaturated, 4-Et-branched aliphatic acids, and a variety of degradation products of amino acids. The odor threshold of some of the acids was found to be in the range of 1 ng. Most of these compounds were present in all donors tested, but in highly variable relative amounts, and they are, thus, candidate molecules as key components of a 'compound odor' determining the individual types of human body odor.

A Secure Group Communication Architecture for a Swarm of Autonomous Unmanned Aerial Vehicles

DTIC Science & Technology

2008-03-01

members to use the same decryption key. This shared decryption key is called the Session Encryption Key ( SEK ) or Traffic Encryption Key (TEK...Since everyone shares the SEK , members need to hold additional Key Encryption Keys (KEK) that are used to securely distribute the SEK to each valid...managing this process. To preserve the secrecy of the multicast data, the SEK needs to be updated upon certain events such as a member joining and

Secret Writing. Keys to the Mysteries of Reading and Writing.

ERIC Educational Resources Information Center

Sears, Peter

With a central theme of how people create a means to communicate reliably, and based on language-making exercises that touch students' imaginations, this book aims to interest students in language and how language is made. Since students like codes and ciphers, the book begins with secret writing, which is then used to reveal the foundation of…

Unifying Concepts in Stimulus-Secretion Coupling in Endocrine Cells and Some Implications for Therapeutics

ERIC Educational Resources Information Center

Misler, Stanley

2009-01-01

Stimulus-secretion coupling (SSC) in endocrine cells remains underappreciated as a subject for the study/teaching of general physiology. In the present article, we review key new electrophysiological, electrochemical, and fluorescence optical techniques for the study of exocytosis in single cells that have made this a fertile area for recent…

Unconditional security proof of long-distance continuous-variable quantum key distribution with discrete modulation.

PubMed

Leverrier, Anthony; Grangier, Philippe

2009-05-08

We present a continuous-variable quantum key distribution protocol combining a discrete modulation and reverse reconciliation. This protocol is proven unconditionally secure and allows the distribution of secret keys over long distances, thanks to a reverse reconciliation scheme efficient at very low signal-to-noise ratio.

Location-Aware Dynamic Session-Key Management for Grid-Based Wireless Sensor Networks

PubMed Central

Chen, Chin-Ling; Lin, I-Hsien

2010-01-01

Security is a critical issue for sensor networks used in hostile environments. When wireless sensor nodes in a wireless sensor network are distributed in an insecure hostile environment, the sensor nodes must be protected: a secret key must be used to protect the nodes transmitting messages. If the nodes are not protected and become compromised, many types of attacks against the network may result. Such is the case with existing schemes, which are vulnerable to attacks because they mostly provide a hop-by-hop paradigm, which is insufficient to defend against known attacks. We propose a location-aware dynamic session-key management protocol for grid-based wireless sensor networks. The proposed protocol improves the security of a secret key. The proposed scheme also includes a key that is dynamically updated. This dynamic update can lower the probability of the key being guessed correctly. Thus currently known attacks can be defended. By utilizing the local information, the proposed scheme can also limit the flooding region in order to reduce the energy that is consumed in discovering routing paths. PMID:22163606

Towards secure quantum key distribution protocol for wireless LANs: a hybrid approach

NASA Astrophysics Data System (ADS)

Naik, R. Lalu; Reddy, P. Chenna

2015-12-01

The primary goals of security such as authentication, confidentiality, integrity and non-repudiation in communication networks can be achieved with secure key distribution. Quantum mechanisms are highly secure means of distributing secret keys as they are unconditionally secure. Quantum key distribution protocols can effectively prevent various attacks in the quantum channel, while classical cryptography is efficient in authentication and verification of secret keys. By combining both quantum cryptography and classical cryptography, security of communications over networks can be leveraged. Hwang, Lee and Li exploited the merits of both cryptographic paradigms for provably secure communications to prevent replay, man-in-the-middle, and passive attacks. In this paper, we propose a new scheme with the combination of quantum cryptography and classical cryptography for 802.11i wireless LANs. Since quantum cryptography is premature in wireless networks, our work is a significant step forward toward securing communications in wireless networks. Our scheme is known as hybrid quantum key distribution protocol. Our analytical results revealed that the proposed scheme is provably secure for wireless networks.

Location-aware dynamic session-key management for grid-based Wireless Sensor Networks.

PubMed

Chen, Chin-Ling; Lin, I-Hsien

2010-01-01

Security is a critical issue for sensor networks used in hostile environments. When wireless sensor nodes in a wireless sensor network are distributed in an insecure hostile environment, the sensor nodes must be protected: a secret key must be used to protect the nodes transmitting messages. If the nodes are not protected and become compromised, many types of attacks against the network may result. Such is the case with existing schemes, which are vulnerable to attacks because they mostly provide a hop-by-hop paradigm, which is insufficient to defend against known attacks. We propose a location-aware dynamic session-key management protocol for grid-based wireless sensor networks. The proposed protocol improves the security of a secret key. The proposed scheme also includes a key that is dynamically updated. This dynamic update can lower the probability of the key being guessed correctly. Thus currently known attacks can be defended. By utilizing the local information, the proposed scheme can also limit the flooding region in order to reduce the energy that is consumed in discovering routing paths.

Open source system OpenVPN in a function of Virtual Private Network

NASA Astrophysics Data System (ADS)

Skendzic, A.; Kovacic, B.

2017-05-01

Using of Virtual Private Networks (VPN) can establish high security level in network communication. VPN technology enables high security networking using distributed or public network infrastructure. VPN uses different security and managing rules inside networks. It can be set up using different communication channels like Internet or separate ISP communication infrastructure. VPN private network makes security communication channel over public network between two endpoints (computers). OpenVPN is an open source software product under GNU General Public License (GPL) that can be used to establish VPN communication between two computers inside business local network over public communication infrastructure. It uses special security protocols and 256-bit Encryption and it is capable of traversing network address translators (NATs) and firewalls. It allows computers to authenticate each other using a pre-shared secret key, certificates or username and password. This work gives review of VPN technology with a special accent on OpenVPN. This paper will also give comparison and financial benefits of using open source VPN software in business environment.

RSA Key Development Using Fingerprint Image on Text Message

NASA Astrophysics Data System (ADS)

Rahman, Sayuti; Triana, Indah; Khairani, Sumi; Yasir, Amru; Sundari, Siti

2017-12-01

Along with the development of technology today, humans are very facilitated in accessing information and Communicate with various media, including through the Internet network . Messages are sent by media such as text are not necessarily guaranteed security. it is often found someone that wants to send a secret message to the recipient, but the messages can be known by irresponsible people. So the sender feels dissappointed because the secret message that should be known only to the recipient only becomes known by the irresponsible people . It is necessary to do security the message by using the RSA algorithm, Using fingerprint image to generate RSA key.This is a solution to enrich the security of a message,it is needed to process images firstly before generating RSA keys with feature extraction.

Hacking commercial quantum cryptography systems by tailored bright illumination

NASA Astrophysics Data System (ADS)

Lydersen, Lars; Wiechers, Carlos; Wittmann, Christoffer; Elser, Dominique; Skaar, Johannes; Makarov, Vadim

2010-10-01

The peculiar properties of quantum mechanics allow two remote parties to communicate a private, secret key, which is protected from eavesdropping by the laws of physics. So-called quantum key distribution (QKD) implementations always rely on detectors to measure the relevant quantum property of single photons. Here we demonstrate experimentally that the detectors in two commercially available QKD systems can be fully remote-controlled using specially tailored bright illumination. This makes it possible to tracelessly acquire the full secret key; we propose an eavesdropping apparatus built from off-the-shelf components. The loophole is likely to be present in most QKD systems using avalanche photodiodes to detect single photons. We believe that our findings are crucial for strengthening the security of practical QKD, by identifying and patching technological deficiencies.

Type-IVC Secretion System: A Novel Subclass of Type IV Secretion System (T4SS) Common Existing in Gram-Positive Genus Streptococcus

PubMed Central

Chen, Chen; Gao, George F.

2012-01-01

A growing number of pathogens are being found to possess specialized secretion systems which they use in various ways to subvert host defenses. Type IV secretion system (T4SS) is one of versatile secretion systems essential for the virulence and even survival of some bacteria species, and they enable the secretion of protein and DNA substrates across the cell envelope. T4SS was once believed to be present only in Gram-negative bacteria. In this study, we present evidence of a new subclass of T4SS, Type-IVC secretion system and indicate its common existence in the Gram-positive bacterial genus Streptococcus. We further identified that VirB1, VirB4, VirB6 and VirD4 are the minimal key components of this system. Using genome comparisons and evolutionary relationship analysis, we proposed that Type-IVC secretion system is movable via transposon factors and mediates the conjugative transfer of DNA, enhances bacterial pathogenicity, and could cause large-scale outbreaks of infections in humans. PMID:23056296

On the security of compressed encryption with partial unitary sensing matrices embedding a secret keystream

NASA Astrophysics Data System (ADS)

Yu, Nam Yul

2017-12-01

The principle of compressed sensing (CS) can be applied in a cryptosystem by providing the notion of security. In this paper, we study the computational security of a CS-based cryptosystem that encrypts a plaintext with a partial unitary sensing matrix embedding a secret keystream. The keystream is obtained by a keystream generator of stream ciphers, where the initial seed becomes the secret key of the CS-based cryptosystem. For security analysis, the total variation distance, bounded by the relative entropy and the Hellinger distance, is examined as a security measure for the indistinguishability. By developing upper bounds on the distance measures, we show that the CS-based cryptosystem can be computationally secure in terms of the indistinguishability, as long as the keystream length for each encryption is sufficiently large with low compression and sparsity ratios. In addition, we consider a potential chosen plaintext attack (CPA) from an adversary, which attempts to recover the key of the CS-based cryptosystem. Associated with the key recovery attack, we show that the computational security of our CS-based cryptosystem is brought by the mathematical intractability of a constrained integer least-squares (ILS) problem. For a sub-optimal, but feasible key recovery attack, we consider a successive approximate maximum-likelihood detection (SAMD) and investigate the performance by developing an upper bound on the success probability. Through theoretical and numerical analyses, we demonstrate that our CS-based cryptosystem can be secure against the key recovery attack through the SAMD.

Exosome secretion is a key pathway for clearance of pathological TDP-43.

PubMed

Iguchi, Yohei; Eid, Lara; Parent, Martin; Soucy, Geneviève; Bareil, Christine; Riku, Yuichi; Kawai, Kaori; Takagi, Shinnosuke; Yoshida, Mari; Katsuno, Masahisa; Sobue, Gen; Julien, Jean-Pierre

2016-12-01

Cytoplasmic TDP-43 aggregation is a pathological hallmark of amyotrophic lateral sclerosis and frontotemporal lobar degeneration. Here we investigated the role of exosomes in the secretion and propagation of TDP-43 aggregates. TDP-43 was detected in secreted exosomes from Neuro2a cells and primary neurons but not from astrocytes or microglia. Evidence is presented that protein aggregation and autophagy inhibition are factors that promote exosomal secretion of TDP-43. We also report that levels of exosomal TDP-43 full length and C-terminal fragment species are upregulated in human amyotrophic lateral sclerosis brains. Exposure of Neuro2a cells to exosomes from amyotrophic lateral sclerosis brain, but not from control brain, caused cytoplasmic redistribution of TDP-43, suggesting that secreted exosomes might contribute to propagation of TDP-43 proteinopathy. Yet, inhibition of exosome secretion by inactivation of neutral sphingomyelinase 2 with GW4869 or by silencing RAB27A provoked formation of TDP-43 aggregates in Neuro2a cells. Moreover, administration of GW4869 exacerbated the disease phenotypes of transgenic mice expressing human TDP-43 A315T mutant. Thus, even though results suggest that exosomes containing pathological TDP-43 may play a key role in the propagation of TDP-43 proteinopathy, a therapeutic strategy for amyotrophic lateral sclerosis based on inhibition of exosome production would seem inappropriate, as in vivo data suggest that exosome secretion plays an overall beneficial role in neuronal clearance of pathological TDP-43. © The Author (2016). Published by Oxford University Press on behalf of the Guarantors of Brain. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Identification and functional analysis of secreted effectors from phytoparasitic nematodes.

PubMed

Rehman, Sajid; Gupta, Vijai K; Goyal, Aakash K

2016-03-21

Plant parasitic nematodes develop an intimate and long-term feeding relationship with their host plants. They induce a multi-nucleate feeding site close to the vascular bundle in the roots of their host plant and remain sessile for the rest of their life. Nematode secretions, produced in the oesophageal glands and secreted through a hollow stylet into the host plant cytoplasm, are believed to play key role in pathogenesis. To combat these persistent pathogens, the identity and functional analysis of secreted effectors can serve as a key to devise durable control measures. In this review, we will recapitulate the knowledge over the identification and functional characterization of secreted nematode effector repertoire from phytoparasitic nematodes. Despite considerable efforts, the identity of genes encoding nematode secreted proteins has long been severely hampered because of their microscopic size, long generation time and obligate biotrophic nature. The methodologies such as bioinformatics, protein structure modeling, in situ hybridization microscopy, and protein-protein interaction have been used to identify and to attribute functions to the effectors. In addition, RNA interference (RNAi) has been instrumental to decipher the role of the genes encoding secreted effectors necessary for parasitism and genes attributed to normal development. Recent comparative and functional genomic approaches have accelerated the identification of effectors from phytoparasitic nematodes and offers opportunities to control these pathogens. Plant parasitic nematodes pose a serious threat to global food security of various economically important crops. There is a wealth of genomic and transcriptomic information available on plant parasitic nematodes and comparative genomics has identified many effectors. Bioengineering crops with dsRNA of phytonematode genes can disrupt the life cycle of parasitic nematodes and therefore holds great promise to develop resistant crops against plant-parasitic nematodes.

Diverse CLE peptides from cyst nematode species

USDA-ARS?s Scientific Manuscript database

Plant CLAVATA3/ESR (CLE)-like peptides play diverse roles in plant growth and development including maintenance of the stem cell population in the root meristem. Small secreted peptides sharing similarity to plant CLE signaling peptides have been isolated from several cyst nematode species including...

Sharing the Secrets

ERIC Educational Resources Information Center

Good, Rebecca

2008-01-01

Instructional leadership is defined in a broader yet more intense definition today than it was 20 years ago. Originally, the role involved traditional tasks such as setting clear goals, allocating resources to instruction, managing the curriculum, monitoring lesson plans, and evaluating teachers. Today it includes much deeper involvement in the…

Sharing Teaching Ideas.

ERIC Educational Resources Information Center

Mathematics Teacher, 1985

1985-01-01

Discusses: (1) use of matrix techniques to write secret codes (includes ready-to-duplicate worksheets); (2) a method of multiplication and division of polynomials in one variable that is not tedius, time-consuming, or dependent on guesswork; and (3) adding and subtracting rational expressions and solving rational equations. (JN)

Role of nematode peptides and other small molecules in plant parasitism

USDA-ARS?s Scientific Manuscript database

Molecular, genetic, and biochemical studies are demonstrating an increasingly important role of peptide signaling in nematode parasitism of plants. To date, the majority of nematode-secreted peptides identified share similarity with plant CLAVATA3/ESR (CLE) peptides, but bioinformatics analyses of n...

Defense Acquisition Review Journal. Volume 15, Number 3, Issue 49, December 2008

DTIC Science & Technology

2008-12-01

objectives (Bennis & Biederman , 1997). The Defense Acquisition University and many of its external corporate university partners share the belief that an... Biederman , P. W. (1997). Organizing genius: The secrets of creative collaboration. Reading, MA: Addison-Wesley. Beyerlein, M. (1995). Measuring

Secrets of the Soil: Promotion of the Nov. 7 Science at the Theater Event

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brodie, Eoin

2011-01-01

There are billions of microbes in a handful of soil, some of which could hold the key to our climate and energy future. Find out how at Secrets of the Soil, our next Science at the Theater Nov. 7 at the Berkeley Repertory Theatre. At the event, four Berkeley Lab scientists will reveal how our scientists travel the globe -- to deserts, rainforests, and the Arctic tundra -- to explore the secret world of soil microbes -- and what they mean to you. More info: http://www.lbl.gov/LBL-PID/fobl/

Secrets of the Soil: Promotion of the Nov. 7 Science at the Theater Event

ScienceCinema

Brodie, Eoin

2017-12-11

There are billions of microbes in a handful of soil, some of which could hold the key to our climate and energy future. Find out how at Secrets of the Soil, our next Science at the Theater Nov. 7 at the Berkeley Repertory Theatre. At the event, four Berkeley Lab scientists will reveal how our scientists travel the globe -- to deserts, rainforests, and the Arctic tundra -- to explore the secret world of soil microbes -- and what they mean to you. More info: http://www.lbl.gov/LBL-PID/fobl/

Smart Grid Privacy through Distributed Trust

NASA Astrophysics Data System (ADS)

Lipton, Benjamin

Though the smart electrical grid promises many advantages in efficiency and reliability, the risks to consumer privacy have impeded its deployment. Researchers have proposed protecting privacy by aggregating user data before it reaches the utility, using techniques of homomorphic encryption to prevent exposure of unaggregated values. However, such schemes generally require users to trust in the correct operation of a single aggregation server. We propose two alternative systems based on secret sharing techniques that distribute this trust among multiple service providers, protecting user privacy against a misbehaving server. We also provide an extensive evaluation of the systems considered, comparing their robustness to privacy compromise, error handling, computational performance, and data transmission costs. We conclude that while all the systems should be computationally feasible on smart meters, the two methods based on secret sharing require much less computation while also providing better protection against corrupted aggregators. Building systems using these techniques could help defend the privacy of electricity customers, as well as customers of other utilities as they move to a more data-driven architecture.

A secure data outsourcing scheme based on Asmuth-Bloom secret sharing

NASA Astrophysics Data System (ADS)

Idris Muhammad, Yusuf; Kaiiali, Mustafa; Habbal, Adib; Wazan, A. S.; Sani Ilyasu, Auwal

2016-11-01

Data outsourcing is an emerging paradigm for data management in which a database is provided as a service by third-party service providers. One of the major benefits of offering database as a service is to provide organisations, which are unable to purchase expensive hardware and software to host their databases, with efficient data storage accessible online at a cheap rate. Despite that, several issues of data confidentiality, integrity, availability and efficient indexing of users' queries at the server side have to be addressed in the data outsourcing paradigm. Service providers have to guarantee that their clients' data are secured against internal (insider) and external attacks. This paper briefly analyses the existing indexing schemes in data outsourcing and highlights their advantages and disadvantages. Then, this paper proposes a secure data outsourcing scheme based on Asmuth-Bloom secret sharing which tries to address the issues in data outsourcing such as data confidentiality, availability and order preservation for efficient indexing.

A novel lost packets recovery scheme based on visual secret sharing

NASA Astrophysics Data System (ADS)

Lu, Kun; Shan, Hong; Li, Zhi; Niu, Zhao

2017-08-01

In this paper, a novel lost packets recovery scheme which encrypts the effective parts of an original packet into two shadow packets based on (2, 2)-threshold XOR-based visual Secret Sharing (VSS) is proposed. The two shadow packets used as watermarks would be embedded into two normal data packets with digital watermarking embedding technology and then sent from one sensor node to another. Each shadow packet would reveal no information of the original packet, which can improve the security of original packet delivery greatly. The two shadow packets which can be extracted from the received two normal data packets delivered from a sensor node can recover the original packet lossless based on XOR-based VSS. The Performance analysis present that the proposed scheme provides essential services as long as possible in the presence of selective forwarding attack. The proposed scheme would not increase the amount of additional traffic, namely, lower energy consumption, which is suitable for Wireless Sensor Network (WSN).

Spacetime Replication of Quantum Information Using (2 , 3) Quantum Secret Sharing and Teleportation

NASA Astrophysics Data System (ADS)

Wu, Yadong; Khalid, Abdullah; Davijani, Masoud; Sanders, Barry

The aim of this work is to construct a protocol to replicate quantum information in any valid configuration of causal diamonds and assess resources required to physically realize spacetime replication. We present a set of codes to replicate quantum information along with a scheme to realize these codes using continuous-variable quantum optics. We use our proposed experimental realizations to determine upper bounds on the quantum and classical resources required to simulate spacetime replication. For four causal diamonds, our implementation scheme is more efficient than the one proposed previously. Our codes are designed using a decomposition algorithm for complete directed graphs, (2 , 3) quantum secret sharing, quantum teleportation and entanglement swapping. These results show the simulation of spacetime replication of quantum information is feasible with existing experimental methods. Alberta Innovates, NSERC, China's 1000 Talent Plan and the Institute for Quantum Information and Matter, which is an NSF Physics Frontiers Center (NSF Grant PHY-1125565) with support of the Gordon and Betty Moore Foundation (GBMF-2644).

High performance optical encryption based on computational ghost imaging with QR code and compressive sensing technique

NASA Astrophysics Data System (ADS)

Zhao, Shengmei; Wang, Le; Liang, Wenqiang; Cheng, Weiwen; Gong, Longyan

2015-10-01

In this paper, we propose a high performance optical encryption (OE) scheme based on computational ghost imaging (GI) with QR code and compressive sensing (CS) technique, named QR-CGI-OE scheme. N random phase screens, generated by Alice, is a secret key and be shared with its authorized user, Bob. The information is first encoded by Alice with QR code, and the QR-coded image is then encrypted with the aid of computational ghost imaging optical system. Here, measurement results from the GI optical system's bucket detector are the encrypted information and be transmitted to Bob. With the key, Bob decrypts the encrypted information to obtain the QR-coded image with GI and CS techniques, and further recovers the information by QR decoding. The experimental and numerical simulated results show that the authorized users can recover completely the original image, whereas the eavesdroppers can not acquire any information about the image even the eavesdropping ratio (ER) is up to 60% at the given measurement times. For the proposed scheme, the number of bits sent from Alice to Bob are reduced considerably and the robustness is enhanced significantly. Meantime, the measurement times in GI system is reduced and the quality of the reconstructed QR-coded image is improved.

Joint Remote State Preparation of a Single-Atom Qubit State via a GHZ Entangled State

NASA Astrophysics Data System (ADS)

Xiao, Xiao-Qi; Yao, Fengwei; Lin, Xiaochen; Gong, Lihua

2018-04-01

We proposed a physical protocol for the joint remote preparation of a single-atom qubit state via a three-atom entangled GHZ-type state previously shared by the two senders and one receiver. Only rotation operations of single-atom, which can be achieved though the resonant interaction between the two-level atom and the classical field, are required in the scheme. It shows that the splitting way of the classical information of the secret qubit not only determines the success of reconstruction of the secret qubit, but also influences the operations of the senders.

Deconstructing The Bomb: Confessions of a Nuclear Archeologist

NASA Astrophysics Data System (ADS)

Coster-Mullen, John

2017-01-01

I am the author of the groundbreaking book Atom Bombs: The Top Secret Inside Story of Little Boy and Fat Man. I will be sharing some of my quarter century of research and methodology that has allowed me to be the first researcher ever to unravel with an unprecedented level of accuracy, the most closely-guarded secrets of the first two Atomic Bombs (``Little Boy'' and ``Fat Man'') created by the Manhattan Project that were used to end WWII. I refer to this methodology as ``Nuclear Archeology'' and will demonstrate that this was done using entirely ``Open Sources'' of information.

Molecular Cloning of Secreted Luciferases from Marine Planktonic Copepods.

PubMed

Takenaka, Yasuhiro; Ikeo, Kazuho; Shigeri, Yasushi

2016-01-01

Secreted luciferases isolated from copepod crustaceans are frequently used for nondisruptive reporter-gene assays, such as the continuous, automated and/or high-throughput monitoring of gene expression in living cells. All known copepod luciferases share highly conserved amino acid residues in two similar, repeated domains in the sequence. The similarity in the domains are ideal nature for designing PCR primers to amplify cDNA fragments of unidentified copepod luciferases from bioluminescent copepod crustaceans. Here, we introduce how to establish a cDNA encoding novel copepod luciferases from a copepod specimen by PCR with degenerated primers.

Simple 2.5 GHz time-bin quantum key distribution

NASA Astrophysics Data System (ADS)

Boaron, Alberto; Korzh, Boris; Houlmann, Raphael; Boso, Gianluca; Rusca, Davide; Gray, Stuart; Li, Ming-Jun; Nolan, Daniel; Martin, Anthony; Zbinden, Hugo

2018-04-01

We present a 2.5 GHz quantum key distribution setup with the emphasis on a simple experimental realization. It features a three-state time-bin protocol based on a pulsed diode laser and a single intensity modulator. Implementing an efficient one-decoy scheme and finite-key analysis, we achieve record breaking secret key rates of 1.5 kbps over 200 km of standard optical fibers.

Dual-Level Security based Cyclic18 Steganographic Method and its Application for Secure Transmission of Keyframes during Wireless Capsule Endoscopy.

PubMed

Muhammad, Khan; Sajjad, Muhammad; Baik, Sung Wook

2016-05-01

In this paper, the problem of secure transmission of sensitive contents over the public network Internet is addressed by proposing a novel data hiding method in encrypted images with dual-level security. The secret information is divided into three blocks using a specific pattern, followed by an encryption mechanism based on the three-level encryption algorithm (TLEA). The input image is scrambled using a secret key, and the encrypted sub-message blocks are then embedded in the scrambled image by cyclic18 least significant bit (LSB) substitution method, utilizing LSBs and intermediate LSB planes. Furthermore, the cover image and its planes are rotated at different angles using a secret key prior to embedding, deceiving the attacker during data extraction. The usage of message blocks division, TLEA, image scrambling, and the cyclic18 LSB method results in an advanced security system, maintaining the visual transparency of resultant images and increasing the security of embedded data. In addition, employing various secret keys for image scrambling, data encryption, and data hiding using the cyclic18 LSB method makes the data recovery comparatively more challenging for attackers. Experimental results not only validate the effectiveness of the proposed framework in terms of visual quality and security compared to other state-of-the-art methods, but also suggest its feasibility for secure transmission of diagnostically important keyframes to healthcare centers and gastroenterologists during wireless capsule endoscopy.

A Novel Image Encryption Algorithm Based on DNA Subsequence Operation

PubMed Central

Zhang, Qiang; Xue, Xianglian; Wei, Xiaopeng

2012-01-01

We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc.) combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack. PMID:23093912

Novel Authentication of Monitoring Data Through the use of Secret and Public Cryptographic Keys

DOE Office of Scientific and Technical Information (OSTI.GOV)

Benz, Jacob M.; Tolk, Keith; Tanner, Jennifer E.

The Office of Nuclear Verification (ONV) is supporting the development of a piece of equipment to provide data authentication and protection for a suite of monitoring sensors as part of a larger effort to create an arms control technology toolkit. This device, currently called the Red Box, leverages the strengths of both secret and public cryptographic keys to authenticate, digitally sign, and pass along monitoring data to allow for host review, and redaction if necessary, without the loss of confidence in the authenticity of the data by the monitoring party. The design of the Red Box will allow for themore » addition and removal of monitoring equipment and can also verify that the data was collected by authentic monitoring equipment prior to signing the data and sending it to the host and for review. The host will then forward the data to the monitor for review and inspection. This paper will highlight the progress to date of the Red Box development, and will explain the novel method of leveraging both symmetric and asymmetric (secret and public key) cryptography to authenticate data within a warhead monitoring regime.« less

Important role of heparan sulfate in postnatal islet growth and insulin secretion

DOE Office of Scientific and Technical Information (OSTI.GOV)

Takahashi, Iwao; Noguchi, Naoya; Nata, Koji

2009-05-22

Heparan sulfate (HS) binds with several signaling molecules and regulates ligand-receptor interactions, playing an essential role in embryonic development. Here we showed that HS was intensively expressed in pancreatic islet {beta}-cells after 1 week of age in mice. The enzymatic removal of HS in isolated islets resulted in attenuated glucose-induced insulin secretion with a concomitant reduction in gene expression of several key components in the insulin secretion machinery. We further depleted islet HS by inactivating the exostosin tumor-like 3 gene specifically in {beta}-cells. These mice exhibited abnormal islet morphology with reduced {beta}-cell proliferation after 1 week of age and glucosemore » intolerance due to defective insulin secretion. These results demonstrate that islet HS is involved in the regulation of postnatal islet maturation and required to ensure normal insulin secretion.« less

Influencing and Exploiting Behavioral Norms in Cyberspace to Promote Ethical and Moral Conduct of Cyberwarfare

DTIC Science & Technology

2010-06-01

child pornography, copyright infringement, or aiding and abetting in any infraction.32 26...research, but now that it is being used to share everything from porn to state secrets the trust is no longer warranted. 68 Other authors have

Key concepts relevant to quality of complex and shared decision-making in health care: a literature review.

PubMed

Dy, Sydney M; Purnell, Tanjala S

2012-02-01

High-quality provider-patient decision-making is key to quality care for complex conditions. We performed an analysis of key elements relevant to quality and complex, shared medical decision-making. Based on a search of electronic databases, including Medline and the Cochrane Library, as well as relevant articles' reference lists, reviews of tools, and annotated bibliographies, we developed a list of key concepts and applied them to a decision-making example. Key concepts identified included provider competence, trustworthiness, and cultural competence; communication with patients and families; information quality; patient/surrogate competence; and roles and involvement. We applied this concept list to a case example, shared decision-making for live donor kidney transplantation, and identified the likely most important concepts as provider and cultural competence, information quality, and communication with patients and families. This concept list may be useful for conceptualizing the quality of complex shared decision-making and in guiding research in this area. Copyright © 2011 Elsevier Ltd. All rights reserved.

Counterfactual quantum key distribution with high efficiency

NASA Astrophysics Data System (ADS)

Sun, Ying; Wen, Qiao-Yan

2010-11-01

In a counterfactual quantum key distribution scheme, a secret key can be generated merely by transmitting the split vacuum pulses of single particles. We improve the efficiency of the first quantum key distribution scheme based on the counterfactual phenomenon. This scheme not only achieves the same security level as the original one but also has higher efficiency. We also analyze how to achieve the optimal efficiency under various conditions.

Counterfactual quantum key distribution with high efficiency

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sun Ying; Beijing Electronic Science and Technology Institute, Beijing 100070; Wen Qiaoyan

2010-11-15

In a counterfactual quantum key distribution scheme, a secret key can be generated merely by transmitting the split vacuum pulses of single particles. We improve the efficiency of the first quantum key distribution scheme based on the counterfactual phenomenon. This scheme not only achieves the same security level as the original one but also has higher efficiency. We also analyze how to achieve the optimal efficiency under various conditions.

Role of calcium signaling in epithelial bicarbonate secretion.

PubMed

Jung, Jinsei; Lee, Min Goo

2014-06-01

Transepithelial bicarbonate secretion plays a key role in the maintenance of fluid and protein secretion from epithelial cells and the protection of the epithelial cell surface from various pathogens. Epithelial bicarbonate secretion is mainly under the control of cAMP and calcium signaling. While the physiological roles and molecular mechanisms of cAMP-induced bicarbonate secretion are relatively well defined, those induced by calcium signaling remain poorly understood in most epithelia. The present review summarizes the current status of knowledge on the role of calcium signaling in epithelial bicarbonate secretion. Specifically, this review introduces how cytosolic calcium signaling can increase bicarbonate secretion by regulating membrane transport proteins and how it synergizes with cAMP-induced mechanisms in epithelial cells. In addition, tissue-specific variations in the pancreas, salivary glands, intestines, bile ducts, and airways are discussed. We hope that the present report will stimulate further research into this important topic. These studies will provide the basis for future medicines for a wide spectrum of epithelial disorders including cystic fibrosis, Sjögren's syndrome, and chronic pancreatitis. Copyright © 2014 Elsevier Ltd. All rights reserved.

Multi-party quantum private comparison based on the entanglement swapping of d-level cat states and d-level Bell states

NASA Astrophysics Data System (ADS)

Zhao-Xu, Ji; Tian-Yu, Ye

2017-07-01

In this paper, a novel multi-party quantum private comparison protocol with a semi-honest third party (TP) is proposed based on the entanglement swapping of d-level cat states and d-level Bell states. Here, TP is allowed to misbehave on his own, but will not conspire with any party. In our protocol, n parties employ unitary operations to encode their private secrets and can compare the equality of their private secrets within one time execution of the protocol. Our protocol can withstand both the outside attacks and the participant attacks on the condition that none of the QKD methods is adopted to generate keys for security. One party cannot obtain other parties' secrets except for the case that their secrets are identical. The semi-honest TP cannot learn any information about these parties' secrets except the end comparison result on whether all private secrets from n parties are equal.

Associations Between Secret-Keeping and Quality of Life in Older Adults.

PubMed

Maas, Joyce; Wismeijer, Andreas A J; Van Assen, Marcel A L M

2018-01-01

This study examined the effects of secrecy on quality of life in a sample consisting of older adults (>50 years; N = 301). Three key components of secrecy were examined with the Tilburg Secrecy Scale-25 (TSS25; possession of a secret, self-concealment, and cognitive preoccupation). The TSS25 distinguishes between the tendency to conceal personal information (self-concealment) and the tendency to worry or ruminate about the secret (cognitive preoccupation), thereby enabling investigation of the effects of secrecy on quality of life in detail. Confirming previous findings in younger samples, we found a positive effect of possession of a secret on quality of life, after controlling for both TSS25's self-concealment and cognitive preoccupation. This suggests that keeping secrets may have a positive association with quality of life in older adults as well, as long as they do not have the tendency to self-conceal and are not cognitively preoccupied with their secret.

An image hiding method based on cascaded iterative Fourier transform and public-key encryption algorithm

NASA Astrophysics Data System (ADS)

Zhang, B.; Sang, Jun; Alam, Mohammad S.

2013-03-01

An image hiding method based on cascaded iterative Fourier transform and public-key encryption algorithm was proposed. Firstly, the original secret image was encrypted into two phase-only masks M1 and M2 via cascaded iterative Fourier transform (CIFT) algorithm. Then, the public-key encryption algorithm RSA was adopted to encrypt M2 into M2' . Finally, a host image was enlarged by extending one pixel into 2×2 pixels and each element in M1 and M2' was multiplied with a superimposition coefficient and added to or subtracted from two different elements in the 2×2 pixels of the enlarged host image. To recover the secret image from the stego-image, the two masks were extracted from the stego-image without the original host image. By applying public-key encryption algorithm, the key distribution was facilitated, and also compared with the image hiding method based on optical interference, the proposed method may reach higher robustness by employing the characteristics of the CIFT algorithm. Computer simulations show that this method has good robustness against image processing.

Different Worlds: Same Secret.

ERIC Educational Resources Information Center

Springfield City Library, MA.

The "Brightwood New Authors Project" brought together a group of ten adults from many different ethnic and educational backgrounds to share in the experience of writing and publishing a book. The prose and poetry that resulted from weekly writing workshops featured guest humanities scholars and teachers. Titles include "I Remember When I Met...";…

A Shared Secret

ERIC Educational Resources Information Center

Lyngstad, Idar

2014-01-01

This article is based on an interview with a Norwegian physical education (PE) teacher on the social contact she had with pupils when teaching them PE. The article examines a two-dimensional aspect of a teaching situation relating to swimming instruction in PE, especially focusing on pupils' positive experiences of learning to swim and the…

Private States, Quantum Data Hiding, and the Swapping of Perfect Secrecy.

PubMed

Christandl, Matthias; Ferrara, Roberto

2017-12-01

An important contribution to the understanding of quantum key distribution has been the discovery of entangled states from which secret bits, but no maximally entangled states, can be extracted [Horodecki et al., Phys. Rev. Lett. 94, 200501 (2005)PRLTAO0031-900710.1103/PhysRevLett.94.200501]. The construction of those states was based on an intuition that the quantum mechanical phenomena of data hiding and privacy might be related. In this Letter we firmly connect these two phenomena and highlight three aspects of this result. First, we simplify the definition of the secret key rate. Second, we give a formula for the one-way distillable entanglement of certain private states. Third, we consider the problem of extending the distance of quantum key distribution with help of intermediate stations, a setting called the quantum key repeater. We show that for protocols that first distill private states, it is essentially optimal to use the standard quantum repeater protocol based on entanglement distillation and entanglement swapping.

Methods and apparatuses for self-generating fault-tolerant keys in spread-spectrum systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Moradi, Hussein; Farhang, Behrouz; Subramanian, Vijayarangam

Self-generating fault-tolerant keys for use in spread-spectrum systems are disclosed. At a communication device, beacon signals are received from another communication device and impulse responses are determined from the beacon signals. The impulse responses are circularly shifted to place a largest sample at a predefined position. The impulse responses are converted to a set of frequency responses in a frequency domain. The frequency responses are shuffled with a predetermined shuffle scheme to develop a set of shuffled frequency responses. A set of phase differences is determined as a difference between an angle of the frequency response and an angle ofmore » the shuffled frequency response at each element of the corresponding sets. Each phase difference is quantized to develop a set of secret-key quantized phases and a set of spreading codes is developed wherein each spreading code includes a corresponding phase of the set of secret-key quantized phases.« less

Private States, Quantum Data Hiding, and the Swapping of Perfect Secrecy

NASA Astrophysics Data System (ADS)

Christandl, Matthias; Ferrara, Roberto

2017-12-01

An important contribution to the understanding of quantum key distribution has been the discovery of entangled states from which secret bits, but no maximally entangled states, can be extracted [Horodecki et al., Phys. Rev. Lett. 94, 200501 (2005), 10.1103/PhysRevLett.94.200501]. The construction of those states was based on an intuition that the quantum mechanical phenomena of data hiding and privacy might be related. In this Letter we firmly connect these two phenomena and highlight three aspects of this result. First, we simplify the definition of the secret key rate. Second, we give a formula for the one-way distillable entanglement of certain private states. Third, we consider the problem of extending the distance of quantum key distribution with help of intermediate stations, a setting called the quantum key repeater. We show that for protocols that first distill private states, it is essentially optimal to use the standard quantum repeater protocol based on entanglement distillation and entanglement swapping.

Cloned Erwinia chrysanthemi out genes enable Escherichia coli to selectively secrete a diverse family of heterologous proteins to its milieu.

PubMed

He, S Y; Lindeberg, M; Chatterjee, A K; Collmer, A

1991-02-01

The out genes of the enterobacterial plant pathogen Erwinia chrysanthemi are responsible for the efficient extracellular secretion of multiple plant cell wall-degrading enzymes, including four isozymes of pectate lyase, exo-poly-alpha-D-galacturonosidase, pectin methylesterase, and cellulase. Out- mutants of Er. chrysanthemi are unable to export any of these proteins beyond the periplasm and are severely reduced in virulence. We have cloned out genes from Er. chrysanthemi in the stable, low-copy-number cosmid pCPP19 by complementing several transposon-induced mutations. The cloned out genes were clustered in a 12-kilobase chromosomal DNA region, complemented all existing out mutations in Er. chrysanthemi EC16, and enabled Escherichia coli strains to efficiently secrete the extracellular pectic enzymes produced from cloned Er. chrysanthemi genes, while retaining the periplasmic marker protein beta-lactamase. DNA sequencing of a 2.4-kilobase EcoRI fragment within the out cluster revealed four genes arranged colinearly and sharing substantial similarity with the Klebsiella pneumoniae genes pulH, pulI, pulJ, and pulK, which are necessary for pullulanase secretion. However, K. pneumoniae cells harboring the cloned Er. chrysanthemi pelE gene were unable to secrete the Erwinia pectate lyase. Furthermore, the Er. chrysanthemi Out system was unable to secrete an extracellular pectate lyase encoded by a gene from a closely related plant pathogen. Erwinia carotovora ssp. carotovora. The results suggest that these enterobacteria secrete polysaccharidases by a conserved mechanism whose protein-recognition capacities have diverged.

Genome-Wide Analysis of Corynespora cassiicola Leaf Fall Disease Putative Effectors

PubMed Central

Lopez, David; Ribeiro, Sébastien; Label, Philippe; Fumanal, Boris; Venisse, Jean-Stéphane; Kohler, Annegret; de Oliveira, Ricardo R.; Labutti, Kurt; Lipzen, Anna; Lail, Kathleen; Bauer, Diane; Ohm, Robin A.; Barry, Kerrie W.; Spatafora, Joseph; Grigoriev, Igor V.; Martin, Francis M.; Pujade-Renaud, Valérie

2018-01-01

Corynespora cassiicola is an Ascomycetes fungus with a broad host range and diverse life styles. Mostly known as a necrotrophic plant pathogen, it has also been associated with rare cases of human infection. In the rubber tree, this fungus causes the Corynespora leaf fall (CLF) disease, which increasingly affects natural rubber production in Asia and Africa. It has also been found as an endophyte in South American rubber plantations where no CLF outbreak has yet occurred. The C. cassiicola species is genetically highly diverse, but no clear relationship has been evidenced between phylogenetic lineage and pathogenicity. Cassiicolin, a small glycosylated secreted protein effector, is thought to be involved in the necrotrophic interaction with the rubber tree but some virulent C. cassiicola isolates do not have a cassiicolin gene. This study set out to identify other putative effectors involved in CLF. The genome of a highly virulent C. cassiicola isolate from the rubber tree (CCP) was sequenced and assembled. In silico prediction revealed 2870 putative effectors, comprising CAZymes, lipases, peptidases, secreted proteins and enzymes associated with secondary metabolism. Comparison with the genomes of 44 other fungal species, focusing on effector content, revealed a striking proximity with phylogenetically unrelated species (Colletotrichum acutatum, Colletotrichum gloesporioides, Fusarium oxysporum, nectria hematococca, and Botrosphaeria dothidea) sharing life style plasticity and broad host range. Candidate effectors involved in the compatible interaction with the rubber tree were identified by transcriptomic analysis. Differentially expressed genes included 92 putative effectors, among which cassiicolin and two other secreted singleton proteins. Finally, the genomes of 35 C. cassiicola isolates representing the genetic diversity of the species were sequenced and assembled, and putative effectors identified. At the intraspecific level, effector-based classification was found to be highly consistent with the phylogenomic trees. Identification of lineage-specific effectors is a key step toward understanding C. cassiicola virulence and host specialization mechanisms. PMID:29551995

Genome-Wide Analysis of Corynespora cassiicola Leaf Fall Disease Putative Effectors.

PubMed

Lopez, David; Ribeiro, Sébastien; Label, Philippe; Fumanal, Boris; Venisse, Jean-Stéphane; Kohler, Annegret; de Oliveira, Ricardo R; Labutti, Kurt; Lipzen, Anna; Lail, Kathleen; Bauer, Diane; Ohm, Robin A; Barry, Kerrie W; Spatafora, Joseph; Grigoriev, Igor V; Martin, Francis M; Pujade-Renaud, Valérie

2018-01-01

Corynespora cassiicola is an Ascomycetes fungus with a broad host range and diverse life styles. Mostly known as a necrotrophic plant pathogen, it has also been associated with rare cases of human infection. In the rubber tree, this fungus causes the Corynespora leaf fall (CLF) disease, which increasingly affects natural rubber production in Asia and Africa. It has also been found as an endophyte in South American rubber plantations where no CLF outbreak has yet occurred. The C. cassiicola species is genetically highly diverse, but no clear relationship has been evidenced between phylogenetic lineage and pathogenicity. Cassiicolin, a small glycosylated secreted protein effector, is thought to be involved in the necrotrophic interaction with the rubber tree but some virulent C. cassiicola isolates do not have a cassiicolin gene. This study set out to identify other putative effectors involved in CLF. The genome of a highly virulent C. cassiicola isolate from the rubber tree (CCP) was sequenced and assembled. In silico prediction revealed 2870 putative effectors, comprising CAZymes, lipases, peptidases, secreted proteins and enzymes associated with secondary metabolism. Comparison with the genomes of 44 other fungal species, focusing on effector content, revealed a striking proximity with phylogenetically unrelated species ( Colletotrichum acutatum, Colletotrichum gloesporioides, Fusarium oxysporum, nectria hematococca , and Botrosphaeria dothidea ) sharing life style plasticity and broad host range. Candidate effectors involved in the compatible interaction with the rubber tree were identified by transcriptomic analysis. Differentially expressed genes included 92 putative effectors, among which cassiicolin and two other secreted singleton proteins. Finally, the genomes of 35 C. cassiicola isolates representing the genetic diversity of the species were sequenced and assembled, and putative effectors identified. At the intraspecific level, effector-based classification was found to be highly consistent with the phylogenomic trees. Identification of lineage-specific effectors is a key step toward understanding C. cassiicola virulence and host specialization mechanisms.

Kashmir--The Key to Peace in Afghanistan

DTIC Science & Technology

2013-03-01

Missile Crisis the U.S. had to learn similar lessons in the early years of it gaining nuclear weapons. Victoria Schofield and Praveen Swami reinforce...12 Praveen Swami, India, Pakistan and the Secret Jihad (London: Routledge, 2007), 204. 13 Peter Lavoy, Asymmetric Warefare in South Asia: the...Swami, Praveen . India, Pakistan and the Secret Jihad. London: Routledge, 2007. Talbot, Ian. Pakistan: A Modern History. New Delhi: Oxford University

Secure key storage and distribution

DOEpatents

Agrawal, Punit

2015-06-02

This disclosure describes a distributed, fault-tolerant security system that enables the secure storage and distribution of private keys. In one implementation, the security system includes a plurality of computing resources that independently store private keys provided by publishers and encrypted using a single security system public key. To protect against malicious activity, the security system private key necessary to decrypt the publication private keys is not stored at any of the computing resources. Rather portions, or shares of the security system private key are stored at each of the computing resources within the security system and multiple security systems must communicate and share partial decryptions in order to decrypt the stored private key.

A family of tissue-specific resistin-like molecules

PubMed Central

Steppan, Claire M.; Brown, Elizabeth J.; Wright, Christopher M.; Bhat, Savitha; Banerjee, Ronadip R.; Dai, Charlotte Y.; Enders, Gregory H.; Silberg, Debra G.; Wen, Xiaoming; Wu, Gary D.; Lazar, Mitchell A.

2001-01-01

We have identified a family of resistin-like molecules (RELMs) in rodents and humans. Resistin is a hormone produced by fat cells. RELMα is a secreted protein that has a restricted tissue distribution with highest levels in adipose tissue. Another family member, RELMβ, is a secreted protein expressed only in the gastrointestinal tract, particularly the colon, in both mouse and human. RELMβ gene expression is highest in proliferative epithelial cells and is markedly increased in tumors, suggesting a role in intestinal proliferation. Resistin and the RELMs share a cysteine composition and other signature features. Thus, the RELMs together with resistin comprise a class of tissue-specific signaling molecules. PMID:11209052

A family of tissue-specific resistin-like molecules.

PubMed

Steppan, C M; Brown, E J; Wright, C M; Bhat, S; Banerjee, R R; Dai, C Y; Enders, G H; Silberg, D G; Wen, X; Wu, G D; Lazar, M A

2001-01-16

We have identified a family of resistin-like molecules (RELMs) in rodents and humans. Resistin is a hormone produced by fat cells. RELMalpha is a secreted protein that has a restricted tissue distribution with highest levels in adipose tissue. Another family member, RELMbeta, is a secreted protein expressed only in the gastrointestinal tract, particularly the colon, in both mouse and human. RELMbeta gene expression is highest in proliferative epithelial cells and is markedly increased in tumors, suggesting a role in intestinal proliferation. Resistin and the RELMs share a cysteine composition and other signature features. Thus, the RELMs together with resistin comprise a class of tissue-specific signaling molecules.

Metabolomic analysis of pancreatic β-cell insulin release in response to glucose.

PubMed

Huang, Mei; Joseph, Jamie W

2012-01-01

Defining the key metabolic pathways that are important for fuel-regulated insulin secretion is critical to providing a complete picture of how nutrients regulate insulin secretion. We have performed a detailed metabolomics study of the clonal β-cell line 832/13 using a gas chromatography-mass spectrometer (GC-MS) to investigate potential coupling factors that link metabolic pathways to insulin secretion. Mid-polar and polar metabolites, extracted from the 832/13 β-cells, were derivatized and then run on a GC/MS to identify and quantify metabolite concentrations. Three hundred fifty-five out of 527 chromatographic peaks could be identified as metabolites by our metabolomic platform. These identified metabolites allowed us to perform a systematic analysis of key pathways involved in glucose-stimulated insulin secretion (GSIS). Of these metabolites, 41 were consistently identified as biomarker for GSIS by orthogonal partial least-squares (OPLS). Most of the identified metabolites are from common metabolic pathways including glycolytic, sorbitol-aldose reductase pathway, pentose phosphate pathway, and the TCA cycle suggesting these pathways play an important role in GSIS. Lipids and related products were also shown to contribute to the clustering of high glucose sample groups. Amino acids lysine, tyrosine, alanine and serine were upregulated by glucose whereas aspartic acid was downregulated by glucose suggesting these amino acids might play a key role in GSIS. In summary, a coordinated signaling cascade elicited by glucose metabolism in pancreatic β-cells is revealed by our metabolomics platform providing a new conceptual framework for future research and/or drug discovery.

Image size invariant visual cryptography for general access structures subject to display quality constraints.

PubMed

Lee, Kai-Hui; Chiu, Pei-Ling

2013-10-01

Conventional visual cryptography (VC) suffers from a pixel-expansion problem, or an uncontrollable display quality problem for recovered images, and lacks a general approach to construct visual secret sharing schemes for general access structures. We propose a general and systematic approach to address these issues without sophisticated codebook design. This approach can be used for binary secret images in non-computer-aided decryption environments. To avoid pixel expansion, we design a set of column vectors to encrypt secret pixels rather than using the conventional VC-based approach. We begin by formulating a mathematic model for the VC construction problem to find the column vectors for the optimal VC construction, after which we develop a simulated-annealing-based algorithm to solve the problem. The experimental results show that the display quality of the recovered image is superior to that of previous papers.

Secretion of cytokines in breast cancer cells: the molecular mechanism of procathepsin D proliferative effects.

PubMed

Fusek, Martin; Vetvickova, Jana; Vetvicka, Vaclav

2007-03-01

Procathepsin D (pCD) is a major secreted protein in estrogen receptor-positive (ER+) breast cancer cell lines. Several independent studies have documented pronounced mitogenic effect of secreted pCD on cancer tissue-derived cell lines, including those from breast, lung, and prostate cancer. It has also been shown that the proliferative effect of pCD involves both autocrine and paracrine modes of action. Recent studies have suggested that pCD could act as a key paracrine communicator between cancer and stromal cells. We have shown earlier that the proliferative activity of pCD depends on the activation peptide sequence of pCD. The present study casts light on the mechanism by which pCD influences the proliferation of cancer cells expressing the ER. Results described in the current paper clearly show that pCD initiates secretion of cytokines interleukin-4 (IL-4), IL-8, IL-10, IL-13, macrophage inflammatory protein-1beta and (MIP-1beta) from such tumor cells. Secreted cytokines take part in the proliferation of the cancer cells, as proven by selective inhibition using antibodies. In addition, expression of cytokine receptors on tested cell lines corresponded to the effects of individual cytokines. An analogous pattern was also observed for fibroblasts, which, under physiologic conditions, are the cells in closest contact with the tumor tissue and play a role in tumor growth and invasion. Our observations were further supported by coculture experiments that are in agreement. Although very similar in response to addition of pCD, the invasive ER- cells do not secrete cytokines. Together with previous in vivo results, these data point to pCD as one of key molecules for therapeutic attack in breast cancer.

Proof-of-principle test of coherent-state continuous variable quantum key distribution through turbulent atmosphere (Conference Presentation)

NASA Astrophysics Data System (ADS)

Derkach, Ivan D.; Peuntinger, Christian; Ruppert, László; Heim, Bettina; Gunthner, Kevin; Usenko, Vladyslav C.; Elser, Dominique; Marquardt, Christoph; Filip, Radim; Leuchs, Gerd

2016-10-01

Continuous-variable quantum key distribution is a practical application of quantum information theory that is aimed at generation of secret cryptographic key between two remote trusted parties and that uses multi-photon quantum states as carriers of key bits. Remote parties share the secret key via a quantum channel, that presumably is under control of of an eavesdropper, and which properties must be taken into account in the security analysis. Well-studied fiber-optical quantum channels commonly possess stable transmittance and low noise levels, while free-space channels represent a simpler, less demanding and more flexible alternative, but suffer from atmospheric effects such as turbulence that in particular causes a non-uniform transmittance distribution referred to as fading. Nonetheless free-space channels, providing an unobstructed line-of-sight, are more apt for short, mid-range and potentially long-range (using satellites) communication and will play an important role in the future development and implementation of QKD networks. It was previously theoretically shown that coherent-state CV QKD should be in principle possible to implement over a free-space fading channel, but strong transmittance fluctuations result in the significant modulation-dependent channel excess noise. In this regime the post-selection of highly transmitting sub-channels may be needed, which can even restore the security of the protocol in the strongly turbulent channels. We now report the first proof-of-principle experimental test of coherent state CV QKD protocol using different levels Gaussian modulation over a mid-range (1.6-kilometer long) free-space atmospheric quantum channel. The transmittance of the link was characterized using intensity measurements for the reference but channel estimation using the modulated coherent states was also studied. We consider security against Gaussian collective attacks, that were shown to be optimal against CV QKD protocols . We assumed a general entangling cloner collective attack (modeled using data obtained from the state measurement results on both trusted sides of the protocol), that allows to purify the noise added in the quantum channel . Our security analysis of coherent-state protocol also took into account the effect of imperfect channel estimation, limited post-processing efficiency and finite data ensemble size on the performance of the protocol. In this regime we observe the positive key rate even without the need of applying post-selection. We show the positive improvement of the key rate with increase of the modulation variance, still remaining low enough to tolerate the transmittance fluctuations. The obtained results show that coherent-state CV QKD protocol that uses real free-space atmospheric channel can withstand negative influence of transmittance fluctuations, limited post-processing efficiency, imperfect channel estimation and other finite-size effects, and be successfully implemented. Our result paves the way to the full-scale implementation of the CV QKD in real free-space channels at mid-range distances.

Vesicle Docking Is a Key Target of Local PI(4,5)P2 Metabolism in the Secretory Pathway of INS-1 Cells.

PubMed

Ji, Chen; Fan, Fan; Lou, Xuelin

2017-08-08

Phosphatidylinositol 4,5-bisphosphate (PI(4,5)P 2 ) signaling is transient and spatially confined in live cells. How this pattern of signaling regulates transmitter release and hormone secretion has not been addressed. We devised an optogenetic approach to control PI(4,5)P 2 levels in time and space in insulin-secreting cells. Combining this approach with total internal reflection fluorescence microscopy, we examined individual vesicle-trafficking steps. Unlike long-term PI(4,5)P 2 perturbations, rapid and cell-wide PI(4,5)P 2 reduction in the plasma membrane (PM) strongly inhibits secretion and intracellular Ca 2+ concentration ([Ca 2+ ] i ) responses, but not sytaxin1a clustering. Interestingly, local PI(4,5)P 2 reduction selectively at vesicle docking sites causes remarkable vesicle undocking from the PM without affecting [Ca 2+ ] i . These results highlight a key role of local PI(4,5)P 2 in vesicle tethering and docking, coordinated with its role in priming and fusion. Thus, different spatiotemporal PI(4,5)P 2 signaling regulates distinct steps of vesicle trafficking, and vesicle docking may be a key target of local PI(4,5)P 2 signaling in vivo. Copyright © 2017 The Author(s). Published by Elsevier Inc. All rights reserved.

Chemosystematics in the Opiliones (Arachnida): a comment on the evolutionary history of alkylphenols and benzoquinones in the scent gland secretions of Laniatores

PubMed Central

Raspotnig, Günther; Bodner, Michaela; Schäffer, Sylvia; Koblmüller, Stephan; Schönhofer, Axel; Karaman, Ivo

2015-01-01

Large prosomal scent glands constitute a major synapomorphic character of the arachnid order Opiliones. These glands produce a variety of chemicals very specific to opilionid taxa of different taxonomic levels, and thus represent a model system to investigate the evolutionary traits in exocrine secretion chemistry across a phylogenetically old group of animals. The chemically best-studied opilionid group is certainly Laniatores, and currently available chemical data allow first hypotheses linking the phylogeny of this group to the evolution of major chemical classes of secretion chemistry. Such hypotheses are essential to decide upon a best-fitting explanation of the distribution of scent-gland secretion compounds across extant laniatorean taxa, and hence represent a key toward a well-founded opilionid chemosystematics. PMID:26074662

Chemosystematics in the Opiliones (Arachnida): a comment on the evolutionary history of alkylphenols and benzoquinones in the scent gland secretions of Laniatores.

PubMed

Raspotnig, Günther; Bodner, Michaela; Schäffer, Sylvia; Koblmüller, Stephan; Schönhofer, Axel; Karaman, Ivo

2015-04-01

Large prosomal scent glands constitute a major synapomorphic character of the arachnid order Opiliones. These glands produce a variety of chemicals very specific to opilionid taxa of different taxonomic levels, and thus represent a model system to investigate the evolutionary traits in exocrine secretion chemistry across a phylogenetically old group of animals. The chemically best-studied opilionid group is certainly Laniatores, and currently available chemical data allow first hypotheses linking the phylogeny of this group to the evolution of major chemical classes of secretion chemistry. Such hypotheses are essential to decide upon a best-fitting explanation of the distribution of scent-gland secretion compounds across extant laniatorean taxa, and hence represent a key toward a well-founded opilionid chemosystematics.

Building and Sharing Knowledge Key Practice: What Do You Know, What Don't You Know, What Did You Learn? Research Report. ETS RR-15-24

ERIC Educational Resources Information Center

O'Reilly, Tenaha; Deane, Paul; Sabatini, John

2015-01-01

In this paper we provide the rationale and foundation for the building and sharing knowledge key practice for the "CBAL"™ English language arts competency model. Building and sharing knowledge is a foundational literacy activity that enables students to learn and communicate what they read in texts. It is a strategic process that…

Authentication in Reprogramming of Sensor Networks for Mote Class Adversaries

DTIC Science & Technology

2006-01-01

based approach. In this paper, we propose a symmetric key-based protocol for authenticating the reprogramming process. Our protocol is based on the ... secret instantiation algorithm, which requires only O(log n) keys to be maintained at each sensor. We integrate this algorithm with the existing

Quantum key distillation from Gaussian states by Gaussian operations.

PubMed

Navascués, M; Bae, J; Cirac, J I; Lewestein, M; Sanpera, A; Acín, A

2005-01-14

We study the secrecy properties of Gaussian states under Gaussian operations. Although such operations are useless for quantum distillation, we prove that it is possible to distill a secret key secure against any attack from sufficiently entangled Gaussian states with nonpositive partial transposition. Moreover, all such states allow for key distillation, when Eve is assumed to perform finite-size coherent attacks before the reconciliation process.

Our Roots Run Deep

ERIC Educational Resources Information Center

Steinkamp, Erin

2016-01-01

Valley Park Middle School (VPMS) in Valley Park, MO, has the unique designation of being a not-so-secret gem in St. Louis County. The middle school shares its campus with the elementary and high school, creating opportunities to collaborate and work together to build a school district that not only shines academically, but also focuses on…

Boys' Friendships during Adolescence: Intimacy, Desire, and Loss

ERIC Educational Resources Information Center

Way, Niobe

2013-01-01

Longitudinal, mixed method research on friendships, conducted over the past two decades with Black, Latino, Asian, and European American boys, reveals three themes: (1) the importance for boys of being able to share their secrets with their close friends; (2) the importance of close friendships for boys' mental health; and (3) the loss of but…

Launching a Wireless Laptop Program

ERIC Educational Resources Information Center

Grignano, Domenic

2007-01-01

In this article, the author, as a technology director for East Rock Magnet School in New Haven, Connecticut, a federal government test site for laptop learning, shares his secrets to a successful implementation of a wireless laptop program: (1) Build a wireless foundation; (2) Do not choose the cheapest model just because of budget; (3) A sturdy…

Essential Questions

ERIC Educational Resources Information Center

Wilhelm, Jeffrey D.

2012-01-01

The secret to teaching may be as simple as asking students good questions--and then giving them the opportunity to find the answers. The author shares how he uses essential questions that set the class off on an inquiry. Rather than consuming information that he distributes and then repeating it on a test, students carry out their own…

Let Me Share a Secret with You! Teaching with Computers.

ERIC Educational Resources Information Center

de Vasconcelos, Maria

The author describes her experiences teaching a computer-enhanced Modern Poetry course. The author argues that using computers enhances the concept of the classroom as learning community. It was the author's experience that students' postings on the discussion board created an atmosphere that encouraged student involvement, as opposed to the…

13 Tips for Virtual World Teaching

ERIC Educational Resources Information Center

Villano, Matt

2008-01-01

Multi-user virtual environments (MUVEs) are gaining momentum as the latest and greatest learning tool in the world of education technology. How does one get started with them? How do they work? This article shares 13 secrets from immersive education experts and educators on how to have success in implementing these new tools and technologies on…

CloudSat Preps for Launch at Vandenberg Air Force Base, CA

NASA Technical Reports Server (NTRS)

2005-01-01

The CloudSat spacecraft sits encapsulated within its Boeing Delta launch vehicle dual payload attach fitting at Vandenberg Air Force Base, Calif. CloudSat will share its ride to orbit late next month with NASA's CALIPSO spacecraft. The two spacecraft are designed to reveal the secrets of clouds and aerosols.

Deadly Lessons: School Shooters Tell Why. Sun-Times Exclusive Report.

ERIC Educational Resources Information Center

Chicago Sun-Times, IL.

This document represents a compilation of newspaper articles analyzing information shared by the Secret Service concerning 37 school shootings. The findings are presented to educate parents and teachers concerning what has been learned about violent students. It was determined that there is no profile of a typical youth who kills. The shooter is…

Mathematicians in Schools: Uncovering Maths' Beautiful Secrets

ERIC Educational Resources Information Center

Welch, Bronwyn

2016-01-01

Mathematics professionals are working with teachers revealing the reality and beauty that happens in the world of math and to show that this is essentially a "human endeavour," embedded in much of what people do and the ways in which they think. In this article, the author shares vignettes of primary classes working with mathematicians…

Changes at the National Geographic Society

ERIC Educational Resources Information Center

Schwille, Kathleen

2016-01-01

For more than 125 years, National Geographic has explored the planet, unlocking its secrets and sharing them with the world. For almost thirty of those years, National Geographic has been committed to K-12 educators and geographic education through its Network of Alliances. As National Geographic begins a new chapter, they remain committed to the…

Secreted autoantibody repertoires in Sjögren's syndrome and systemic lupus erythematosus: A proteomic approach.

PubMed

Al Kindi, Mahmood A; Colella, Alex D; Chataway, Tim K; Jackson, Michael W; Wang, Jing J; Gordon, Tom P

2016-04-01

The structures of epitopes bound by autoantibodies against RNA-protein complexes have been well-defined over several decades, but little is known of the clonality, immunoglobulin (Ig) variable (V) gene usage and mutational status of the autoantibodies themselves at the level of the secreted (serum) proteome. A novel proteomic workflow is presented based on affinity purification of specific Igs from serum, high-resolution two-dimensional gel electrophoresis, and de novo and database-driven sequencing of V-region proteins by mass spectrometry. Analysis of anti-Ro52/Ro60/La proteomes in primary Sjögren's syndrome (SS) and anti-Sm and anti-ribosomal P proteomes in systemic lupus erythematosus (SLE) has revealed that these antibody responses are dominated by restricted sets of public (shared) clonotypes, consistent with common pathways of production across unrelated individuals. The discovery of shared sets of specific V-region peptides can be exploited for diagnostic biomarkers in targeted mass spectrometry platforms and for tracking and removal of pathogenic clones. Copyright © 2016 Elsevier B.V. All rights reserved.

Structure of the Yersinia pestis type III secretion chaperone SycH in complex with a stable fragment of YscM2

DOE Office of Scientific and Technical Information (OSTI.GOV)

Phan, Jason; Tropea, Joseph E.; Waugh, David S.

2010-11-16

Pathogenic Yersinia species use a type III secretion system to inject cytotoxic effector proteins directly into the cytosol of mammalian cells, where they neutralize the innate immune response by interfering with the signal-transduction pathways that control phagocytosis and inflammation. To be exported efficiently, some effectors must transiently associate with cognate cytoplasmic secretion chaperones. SycH is the chaperone for YopH, a potent eukaryotic-like protein tyrosine phosphatase that is essential for virulence. SycH also binds two negative regulators of type III secretion, YscM1 and YscM2, both of which share significant sequence homology with the chaperone-binding domain of YopH. Here, the structure ofmore » a complex between SycH and a stable fragment of YscM2 that was designed on the basis of limited proteolysis experiments is presented. The overall fold of SycH is very similar to the structures of other homodimeric secretion chaperones that have been determined to date. YscM2 wraps around SycH in an extended fashion, with some secondary but no tertiary structure, assuming a conformation distinct from the globular fold that it is predicted to adopt in the absence of SycH.« less

Patient-controlled sharing of medical imaging data across unaffiliated healthcare organizations

PubMed Central

Ahn, David K; Unde, Bhagyashree; Gage, H Donald; Carr, J Jeffrey

2013-01-01

Background Current image sharing is carried out by manual transportation of CDs by patients or organization-coordinated sharing networks. The former places a significant burden on patients and providers. The latter faces challenges to patient privacy. Objective To allow healthcare providers efficient access to medical imaging data acquired at other unaffiliated healthcare facilities while ensuring strong protection of patient privacy and minimizing burden on patients, providers, and the information technology infrastructure. Methods An image sharing framework is described that involves patients as an integral part of, and with full control of, the image sharing process. Central to this framework is the Patient Controlled Access-key REgistry (PCARE) which manages the access keys issued by image source facilities. When digitally signed by patients, the access keys are used by any requesting facility to retrieve the associated imaging data from the source facility. A centralized patient portal, called a PCARE patient control portal, allows patients to manage all the access keys in PCARE. Results A prototype of the PCARE framework has been developed by extending open-source technology. The results for feasibility, performance, and user assessments are encouraging and demonstrate the benefits of patient-controlled image sharing. Discussion The PCARE framework is effective in many important clinical cases of image sharing and can be used to integrate organization-coordinated sharing networks. The same framework can also be used to realize a longitudinal virtual electronic health record. Conclusion The PCARE framework allows prior imaging data to be shared among unaffiliated healthcare facilities while protecting patient privacy with minimal burden on patients, providers, and infrastructure. A prototype has been implemented to demonstrate the feasibility and benefits of this approach. PMID:22886546

Cystic fibrosis airway secretions exhibit mucin hyperconcentration and increased osmotic pressure

PubMed Central

Henderson, Ashley G.; Ehre, Camille; Button, Brian; Abdullah, Lubna H.; Cai, Li-Heng; Leigh, Margaret W.; DeMaria, Genevieve C.; Matsui, Hiro; Donaldson, Scott H.; Davis, C. William; Sheehan, John K.; Boucher, Richard C.; Kesimer, Mehmet

2014-01-01

The pathogenesis of mucoinfective lung disease in cystic fibrosis (CF) patients likely involves poor mucus clearance. A recent model of mucus clearance predicts that mucus flow depends on the relative mucin concentration of the mucus layer compared with that of the periciliary layer; however, mucin concentrations have been difficult to measure in CF secretions. Here, we have shown that the concentration of mucin in CF sputum is low when measured by immunologically based techniques, and mass spectrometric analyses of CF mucins revealed mucin cleavage at antibody recognition sites. Using physical size exclusion chromatography/differential refractometry (SEC/dRI) techniques, we determined that mucin concentrations in CF secretions were higher than those in normal secretions. Measurements of partial osmotic pressures revealed that the partial osmotic pressure of CF sputum and the retained mucus in excised CF lungs were substantially greater than the partial osmotic pressure of normal secretions. Our data reveal that mucin concentration cannot be accurately measured immunologically in proteolytically active CF secretions; mucins are hyperconcentrated in CF secretions; and CF secretion osmotic pressures predict mucus layer–dependent osmotic compression of the periciliary liquid layer in CF lungs. Consequently, mucin hypersecretion likely produces mucus stasis, which contributes to key infectious and inflammatory components of CF lung disease. PMID:24892808

An adaptation method to improve secret key rates of time-frequency QKD in atmospheric turbulence channels

NASA Astrophysics Data System (ADS)

Sun, Xiaole; Djordjevic, Ivan B.; Neifeld, Mark A.

2016-03-01

Free-space optical (FSO) channels can be characterized by random power fluctuations due to atmospheric turbulence, which is known as scintillation. Weak coherent source based FSO quantum key distribution (QKD) systems suffer from the scintillation effect because during the deep channel fading the expected detection rate drops, which then gives an eavesdropper opportunity to get additional information about protocol by performing photon number splitting (PNS) attack and blocking single-photon pulses without changing QBER. To overcome this problem, in this paper, we study a large-alphabet QKD protocol, which is achieved by using pulse-position modulation (PPM)-like approach that utilizes the time-frequency uncertainty relation of the weak coherent photon state, called here TF-PPM-QKD protocol. We first complete finite size analysis for TF-PPM-QKD protocol to give practical bounds against non-negligible statistical fluctuation due to finite resources in practical implementations. The impact of scintillation under strong atmospheric turbulence regime is studied then. To overcome the secure key rate performance degradation of TF-PPM-QKD caused by scintillation, we propose an adaptation method for compensating the scintillation impact. By changing source intensity according to the channel state information (CSI), obtained by classical channel, the adaptation method improves the performance of QKD system with respect to the secret key rate. The CSI of a time-varying channel can be predicted using stochastic models, such as autoregressive (AR) models. Based on the channel state predictions, we change the source intensity to the optimal value to achieve a higher secret key rate. We demonstrate that the improvement of the adaptation method is dependent on the prediction accuracy.

Cloned Erwinia chrysanthemi out genes enable Escherichia coli to selectively secrete a diverse family of heterologous proteins to its milieu.

PubMed Central

He, S Y; Lindeberg, M; Chatterjee, A K; Collmer, A

1991-01-01

The out genes of the enterobacterial plant pathogen Erwinia chrysanthemi are responsible for the efficient extracellular secretion of multiple plant cell wall-degrading enzymes, including four isozymes of pectate lyase, exo-poly-alpha-D-galacturonosidase, pectin methylesterase, and cellulase. Out- mutants of Er. chrysanthemi are unable to export any of these proteins beyond the periplasm and are severely reduced in virulence. We have cloned out genes from Er. chrysanthemi in the stable, low-copy-number cosmid pCPP19 by complementing several transposon-induced mutations. The cloned out genes were clustered in a 12-kilobase chromosomal DNA region, complemented all existing out mutations in Er. chrysanthemi EC16, and enabled Escherichia coli strains to efficiently secrete the extracellular pectic enzymes produced from cloned Er. chrysanthemi genes, while retaining the periplasmic marker protein beta-lactamase. DNA sequencing of a 2.4-kilobase EcoRI fragment within the out cluster revealed four genes arranged colinearly and sharing substantial similarity with the Klebsiella pneumoniae genes pulH, pulI, pulJ, and pulK, which are necessary for pullulanase secretion. However, K. pneumoniae cells harboring the cloned Er. chrysanthemi pelE gene were unable to secrete the Erwinia pectate lyase. Furthermore, the Er. chrysanthemi Out system was unable to secrete an extracellular pectate lyase encoded by a gene from a closely related plant pathogen. Erwinia carotovora ssp. carotovora. The results suggest that these enterobacteria secrete polysaccharidases by a conserved mechanism whose protein-recognition capacities have diverged. Images PMID:1992458

Uncoupling of Secretion From Growth in Some Hormone Secretory Tissues

PubMed Central

2014-01-01

Context: Most syndromes with benign primary excess of a hormone show positive coupling of hormone secretion to size or proliferation in the affected hormone secretory tissue. Syndromes that lack this coupling seem rare and have not been examined for unifying features among each other. Evidence Acquisition: Selected clinical and basic features were analyzed from original reports and reviews. We examined indices of excess secretion of a hormone and indices of size of secretory tissue within the following three syndromes, each suggestive of uncoupling between these two indices: familial hypocalciuric hypercalcemia, congenital diazoxide-resistant hyperinsulinism, and congenital primary hyperaldosteronism type III (with G151E mutation of the KCNJ5 gene). Evidence Synthesis: Some unifying features among the three syndromes were different from features present among common tumors secreting the same hormone. The unifying and distinguishing features included: 1) expression of hormone excess as early as the first days of life; 2) normal size of tissue that oversecretes a hormone; 3) diffuse histologic expression in the hormonal tissue; 4) resistance to treatment by subtotal ablation of the hormone-secreting tissue; 5) causation by a germline mutation; 6) low potential of the same mutation to cause a tumor by somatic mutation; and 7) expression of the mutated molecule in a pathway between sensing of a serum metabolite and secretion of hormone regulating that metabolite. Conclusion: Some shared clinical and basic features of uncoupling of secretion from size in a hormonal tissue characterize three uncommon states of hormone excess. These features differ importantly from features of common hormonal neoplasm of that tissue. PMID:25004249

Secretomes of Mycoplasma hyopneumoniae and Mycoplasma flocculare reveal differences associated to pathogenesis.

PubMed

Paes, Jéssica A; Lorenzatto, Karina R; de Moraes, Sofia N; Moura, Hercules; Barr, John R; Ferreira, Henrique B

2017-02-10

Mycoplasma hyopneumoniae and Mycoplasma flocculare cohabit the porcine respiratory tract. However, M. hyopneumoniae causes the porcine enzootic pneumonia, while M. flocculare is a commensal bacterium. Comparative analyses demonstrated high similarity between these species, which includes the sharing of all predicted virulence factors. Nevertheless, studies related to soluble secretomes of mycoplasmas were little known, although they are important for bacterial-host interactions. The aim of this study was to perform a comparative analysis between the soluble secreted proteins repertoires of the pathogenic Mycoplasma hyopneumoniae and its closely related commensal Mycoplasma flocculare. For that, bacteria were cultured in medium with reduced serum concentration and secreted proteins were identified by a LC-MS/MS proteomics approach. Altogether, 62 and 26 proteins were identified as secreted by M. hyopneumoniae and M. flocculare, respectively, being just seven proteins shared between these bacteria. In M. hyopneumoniae secretome, 15 proteins described as virulence factors were found; while four putative virulence factors were identified in M. flocculare secretome. For the first time, clear differences related to virulence were found between these species, helping to elucidate the pathogenic nature of M. hyopneumoniae to swine hosts. For the first time, the secretomes of two porcine respiratory mycoplasmas, namely the pathogenic M. hyopneumoniae and the commensal M. flocculare were compared. The presented results revealed previously unknown differences between these two genetically related species, some of which are associated to the M. hyopneumoniae ability to cause porcine enzootic pneumonia. Copyright © 2016 Elsevier B.V. All rights reserved.

Quantum hacking on a practical continuous-variable quantum cryptosystem by inserting an external light

NASA Astrophysics Data System (ADS)

Qin, Hao; Kumar, Rupesh; Alleaume, Romain

2015-10-01

We report here a new side channel attack on a practical continuous-variable (CV) quantum key distribution (QKD) system. Inspired by blinding attack in discrete-variable QKD, we formalize an attack strategy by inserting an external light into a CV QKD system implemented Gaussian-modulated coherent state protocol and show that our attack can compromise its practical security. In this attack, we concern imperfections of a balanced homodyne detector used in CV QKD. According to our analysis, if one inserts an external light into Bob's signal port, due to the imperfect subtraction from the homodyne detector, the leakage of the external light contributes a displacement on the homodyne signal which causes detector electronics saturation. In consequence, Bob's quadrature measurement is not linear with the quadrature sent by Alice. By considering such vulnerability, a potential Eve can launch a full intercept-resend attack meanwhile she inserts an external light into Bob's signal port. By selecting proper properties of the external light, Eve actively controls the induced displacement value from the inserted light which results saturation of homodyne detection. In consequence, Eve can bias the excess noise due to the intercept-resend attack and the external light, such that Alice and Bob believe their excess noise estimation is below the null key threshold and they can still share a secret key. Our attack shows that the detector loopholes also exist in CV QKD, and it seems influence all the CV QKD systems using homodyne detection, since all the practical detectors have finite detection range.

Predicting the impact of diet and enzymopathies on human small intestinal epithelial cells

PubMed Central

Sahoo, Swagatika; Thiele, Ines

2013-01-01

Small intestinal epithelial cells (sIECs) have a significant share in whole body metabolism as they perform enzymatic digestion and absorption of nutrients. Furthermore, the diet plays a key role in a number of complex diseases including obesity and diabetes. The impact of diet and altered genetic backgrounds on human metabolism may be studied by using computational modeling. A metabolic reconstruction of human sIECs was manually assembled using the literature. The resulting sIEC model was subjected to two different diets to obtain condition-specific metabolic models. Fifty defined metabolic tasks evaluated the functionalities of these models, along with the respective secretion profiles, which distinguished between impacts of different dietary regimes. Under the average American diet, the sIEC model resulted in higher secretion flux for metabolites implicated in metabolic syndrome. In addition, enzymopathies were analyzed in the context of the sIEC metabolism. Computed results were compared with reported gastrointestinal (GI) pathologies and biochemical defects as well as with biomarker patterns used in their diagnosis. Based on our simulations, we propose that (i) sIEC metabolism is perturbed by numerous enzymopathies, which can be used to study cellular adaptive mechanisms specific for such disorders, and in the identification of novel co-morbidities, (ii) porphyrias are associated with both heme synthesis and degradation and (iii) disturbed intestinal gamma-aminobutyric acid synthesis may be linked to neurological manifestations of various enzymopathies. Taken together, the sIEC model represents a comprehensive, biochemically accurate platform for studying the function of sIEC and their role in whole body metabolism. PMID:23492669

Systematic, multiparametric analysis of Mycobacterium tuberculosis intracellular infection offers insight into coordinated virulence.

PubMed

Barczak, Amy K; Avraham, Roi; Singh, Shantanu; Luo, Samantha S; Zhang, Wei Ran; Bray, Mark-Anthony; Hinman, Amelia E; Thompson, Matthew; Nietupski, Raymond M; Golas, Aaron; Montgomery, Paul; Fitzgerald, Michael; Smith, Roger S; White, Dylan W; Tischler, Anna D; Carpenter, Anne E; Hung, Deborah T

2017-05-01

A key to the pathogenic success of Mycobacterium tuberculosis (Mtb), the causative agent of tuberculosis, is the capacity to survive within host macrophages. Although several factors required for this survival have been identified, a comprehensive knowledge of such factors and how they work together to manipulate the host environment to benefit bacterial survival are not well understood. To systematically identify Mtb factors required for intracellular growth, we screened an arrayed, non-redundant Mtb transposon mutant library by high-content imaging to characterize the mutant-macrophage interaction. Based on a combination of imaging features, we identified mutants impaired for intracellular survival. We then characterized the phenotype of infection with each mutant by profiling the induced macrophage cytokine response. Taking a systems-level approach to understanding the biology of identified mutants, we performed a multiparametric analysis combining pathogen and host phenotypes to predict functional relationships between mutants based on clustering. Strikingly, mutants defective in two well-known virulence factors, the ESX-1 protein secretion system and the virulence lipid phthiocerol dimycocerosate (PDIM), clustered together. Building upon the shared phenotype of loss of the macrophage type I interferon (IFN) response to infection, we found that PDIM production and export are required for coordinated secretion of ESX-1-substrates, for phagosomal permeabilization, and for downstream induction of the type I IFN response. Multiparametric clustering also identified two novel genes that are required for PDIM production and induction of the type I IFN response. Thus, multiparametric analysis combining host and pathogen infection phenotypes can be used to identify novel functional relationships between genes that play a role in infection.

Proteinaceous determinants of surface colonization in bacteria: bacterial adhesion and biofilm formation from a protein secretion perspective

PubMed Central

Chagnot, Caroline; Zorgani, Mohamed A.; Astruc, Thierry; Desvaux, Mickaël

2013-01-01

Bacterial colonization of biotic or abiotic surfaces results from two quite distinct physiological processes, namely bacterial adhesion and biofilm formation. Broadly speaking, a biofilm is defined as the sessile development of microbial cells. Biofilm formation arises following bacterial adhesion but not all single bacterial cells adhering reversibly or irreversibly engage inexorably into a sessile mode of growth. Among molecular determinants promoting bacterial colonization, surface proteins are the most functionally diverse active components. To be present on the bacterial cell surface, though, a protein must be secreted in the first place. Considering the close association of secreted proteins with their cognate secretion systems, the secretome (which refers both to the secretion systems and their protein substrates) is a key concept to apprehend the protein secretion and related physiological functions. The protein secretion systems are here considered in light of the differences in the cell-envelope architecture between diderm-LPS (archetypal Gram-negative), monoderm (archetypal Gram-positive) and diderm-mycolate (archetypal acid-fast) bacteria. Besides, their cognate secreted proteins engaged in the bacterial colonization process are regarded from single protein to supramolecular protein structure as well as the non-classical protein secretion. This state-of-the-art on the complement of the secretome (the secretion systems and their cognate effectors) involved in the surface colonization process in diderm-LPS and monoderm bacteria paves the way for future research directions in the field. PMID:24133488

Symmetric quantum fully homomorphic encryption with perfect security

NASA Astrophysics Data System (ADS)

Liang, Min

2013-12-01

Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information processing, and present the definitions of quantum homomorphic encryption (QHE) and quantum fully homomorphic encryption (QFHE). Then, based on quantum one-time pad (QOTP), we construct a symmetric QFHE scheme, where the evaluate algorithm depends on the secret key. This scheme permits any unitary transformation on any -qubit state that has been encrypted. Compared with classical homomorphic encryption, the QFHE scheme has perfect security. Finally, we also construct a QOTP-based symmetric QHE scheme, where the evaluate algorithm is independent of the secret key.

Quantum cryptography with an ideal local relay

NASA Astrophysics Data System (ADS)

Spedalieri, Gaetana; Ottaviani, Carlo; Braunstein, Samuel L.; Gehring, Tobias; Jacobsen, Christian S.; Andersen, Ulrik L.; Pirandola, Stefano

2015-10-01

We consider two remote parties connected to a relay by two quantum channels. To generate a secret key, they transmit coherent states to the relay, where the states are subject to a continuous-variable (CV) Bell detection. We study the ideal case where Alice's channel is lossless, i.e., the relay is locally in her lab and the Bell detection is perfomed with unit efficiency. This configuration allows us to explore the optimal performances achievable by CV measurement-device-independent quantum key distribution. This corresponds to the limit of a trusted local relay, where the detection loss can be re-scaled. Our theoretical analysis is confirmed by an experimental simulation where 10-4 secret bits per use can potentially be distributed at 170km assuming ideal reconciliation.

What's the point of the type III secretion system needle?

PubMed Central

Blocker, Ariel J.; Deane, Janet E.; Veenendaal, Andreas K. J.; Roversi, Pietro; Hodgkinson, Julie L.; Johnson, Steven; Lea, Susan M.

2008-01-01

Recent work by several groups has significantly expanded our knowledge of the structure, regulation of assembly, and function of components of the extracellular portion of the type III secretion system (T3SS) of Gram-negative bacteria. This perspective presents a structure-informed analysis of functional data and discusses three nonmutually exclusive models of how a key aspect of T3SS biology, the sensing of host cells, may be performed. PMID:18458349

DBSecSys: a database of Burkholderia mallei secretion systems.

PubMed

Memišević, Vesna; Kumar, Kamal; Cheng, Li; Zavaljevski, Nela; DeShazer, David; Wallqvist, Anders; Reifman, Jaques

2014-07-16

Bacterial pathogenicity represents a major public health concern worldwide. Secretion systems are a key component of bacterial pathogenicity, as they provide the means for bacterial proteins to penetrate host-cell membranes and insert themselves directly into the host cells' cytosol. Burkholderia mallei is a Gram-negative bacterium that uses multiple secretion systems during its host infection life cycle. To date, the identities of secretion system proteins for B. mallei are not well known, and their pathogenic mechanisms of action and host factors are largely uncharacterized. We present the Database of Burkholderia malleiSecretion Systems (DBSecSys), a compilation of manually curated and computationally predicted bacterial secretion system proteins and their host factors. Currently, DBSecSys contains comprehensive experimentally and computationally derived information about B. mallei strain ATCC 23344. The database includes 143 B. mallei proteins associated with five secretion systems, their 1,635 human and murine interacting targets, and the corresponding 2,400 host-B. mallei interactions. The database also includes information about 10 pathogenic mechanisms of action for B. mallei secretion system proteins inferred from the available literature. Additionally, DBSecSys provides details about 42 virulence attenuation experiments for 27 B. mallei secretion system proteins. Users interact with DBSecSys through a Web interface that allows for data browsing, querying, visualizing, and downloading. DBSecSys provides a comprehensive, systematically organized resource of experimental and computational data associated with B. mallei secretion systems. It provides the unique ability to study secretion systems not only through characterization of their corresponding pathogen proteins, but also through characterization of their host-interacting partners.The database is available at https://applications.bhsai.org/dbsecsys.

Pneumolysin activates the NLRP3 inflammasome and promotes proinflammatory cytokines independently of TLR4.

PubMed

McNeela, Edel A; Burke, Aine; Neill, Daniel R; Baxter, Cathy; Fernandes, Vitor E; Ferreira, Daniela; Smeaton, Sarah; El-Rachkidy, Rana; McLoughlin, Rachel M; Mori, Andres; Moran, Barry; Fitzgerald, Katherine A; Tschopp, Jurg; Pétrilli, Virginie; Andrew, Peter W; Kadioglu, Aras; Lavelle, Ed C

2010-11-11

Pneumolysin (PLY) is a key Streptococcus pneumoniae virulence factor and potential candidate for inclusion in pneumococcal subunit vaccines. Dendritic cells (DC) play a key role in the initiation and instruction of adaptive immunity, but the effects of PLY on DC have not been widely investigated. Endotoxin-free PLY enhanced costimulatory molecule expression on DC but did not induce cytokine secretion. These effects have functional significance as adoptive transfer of DC exposed to PLY and antigen resulted in stronger antigen-specific T cell proliferation than transfer of DC exposed to antigen alone. PLY synergized with TLR agonists to enhance secretion of the proinflammatory cytokines IL-12, IL-23, IL-6, IL-1β, IL-1α and TNF-α by DC and enhanced cytokines including IL-17A and IFN-γ by splenocytes. PLY-induced DC maturation and cytokine secretion by DC and splenocytes was TLR4-independent. Both IL-17A and IFN-γ are required for protective immunity to pneumococcal infection and intranasal infection of mice with PLY-deficient pneumococci induced significantly less IFN-γ and IL-17A in the lungs compared to infection with wild-type bacteria. IL-1β plays a key role in promoting IL-17A and was previously shown to mediate protection against pneumococcal infection. The enhancement of IL-1β secretion by whole live S. pneumoniae and by PLY in DC required NLRP3, identifying PLY as a novel NLRP3 inflammasome activator. Furthermore, NLRP3 was required for protective immunity against respiratory infection with S. pneumoniae. These results add significantly to our understanding of the interactions between PLY and the immune system.

The Secret to Finland's Success: Educating Teachers. Research Brief

ERIC Educational Resources Information Center

Sahlberg, Pasi

2010-01-01

In the last decade, Finland has emerged as the leading OECD country in educational achievement. In examining the sources of Finland's dramatic rise to the top, research shows one key element that has impacted Finland's success above all others: excellent teachers. This policy brief details the key elements of Finland's successful system, examining…

Communication channels secured from eavesdropping via transmission of photonic Bell states

NASA Astrophysics Data System (ADS)

Shimizu, Kaoru; Imoto, Nobuyuki

1999-07-01

This paper proposes a quantum communication scheme for sending a definite binary sequence while confirming the security of the transmission. The scheme is very suitable for sending a ciphertext in a secret-key cryptosystem so that we can detect any eavesdropper who attempts to decipher the key. Thus we can continue to use a secret key unless we detect eavesdropping and the security of a key that is used repeatedly can be enhanced to the level of one-time-pad cryptography. In our scheme, a pair of entangled photon twins is employed as a bit carrier which is encoded in a two-term superposition of four Bell states. Different bases are employed for encoding the binary sequence of a ciphertext and a random test bit. The photon twins are measured with a Bell state analyzer and any bit can be decoded from the resultant Bell state when the receiver is later notified of the coding basis through a classical channel. By opening the positions and the values of test bits, ciphertext can be read and eavesdropping is simultaneously detected.

Privacy-Assured Aggregation Protocol for Smart Metering: A Proactive Fault-Tolerant Approach [Proactive Fault-Tolerant Aggregation Protocol for Privacy-Assured Smart Metering

DOE PAGES

Won, Jongho; Ma, Chris Y. T.; Yau, David K. Y.; ...

2016-06-01

Smart meters are integral to demand response in emerging smart grids, by reporting the electricity consumption of users to serve application needs. But reporting real-time usage information for individual households raises privacy concerns. Existing techniques to guarantee differential privacy (DP) of smart meter users either are not fault tolerant or achieve (possibly partial) fault tolerance at high communication overheads. In this paper, we propose a fault-tolerant protocol for smart metering that can handle general communication failures while ensuring DP with significantly improved efficiency and lower errors compared with the state of the art. Our protocol handles fail-stop faults proactively bymore » using a novel design of future ciphertexts, and distributes trust among the smart meters by sharing secret keys among them. We prove the DP properties of our protocol and analyze its advantages in fault tolerance, accuracy, and communication efficiency relative to competing techniques. We illustrate our analysis by simulations driven by real-world traces of electricity consumption.« less

Einstein-Podolsky-Rosen-steering swapping between two Gaussian multipartite entangled states

NASA Astrophysics Data System (ADS)

Wang, Meihong; Qin, Zhongzhong; Wang, Yu; Su, Xiaolong

2017-08-01

Multipartite Einstein-Podolsky-Rosen (EPR) steering is a useful quantum resource for quantum communication in quantum networks. It has potential applications in secure quantum communication, such as one-sided device-independent quantum key distribution and quantum secret sharing. By distributing optical modes of a multipartite entangled state to space-separated quantum nodes, a local quantum network can be established. Based on the existing multipartite EPR steering in a local quantum network, secure quantum communication protocol can be accomplished. In this manuscript, we present swapping schemes for EPR steering between two space-separated Gaussian multipartite entangled states, which can be used to connect two space-separated quantum networks. Two swapping schemes, including the swapping between a tripartite Greenberger-Horne-Zeilinger (GHZ) entangled state and an EPR entangled state and that between two tripartite GHZ entangled states, are analyzed. Various types of EPR steering are presented after the swapping of two space-separated independent multipartite entanglement states without direct interaction, which can be used to implement quantum communication between two quantum networks. The presented schemes provide technical reference for more complicated quantum networks with EPR steering.

Privacy-Assured Aggregation Protocol for Smart Metering: A Proactive Fault-Tolerant Approach [Proactive Fault-Tolerant Aggregation Protocol for Privacy-Assured Smart Metering

DOE Office of Scientific and Technical Information (OSTI.GOV)

Won, Jongho; Ma, Chris Y. T.; Yau, David K. Y.

Smart meters are integral to demand response in emerging smart grids, by reporting the electricity consumption of users to serve application needs. But reporting real-time usage information for individual households raises privacy concerns. Existing techniques to guarantee differential privacy (DP) of smart meter users either are not fault tolerant or achieve (possibly partial) fault tolerance at high communication overheads. In this paper, we propose a fault-tolerant protocol for smart metering that can handle general communication failures while ensuring DP with significantly improved efficiency and lower errors compared with the state of the art. Our protocol handles fail-stop faults proactively bymore » using a novel design of future ciphertexts, and distributes trust among the smart meters by sharing secret keys among them. We prove the DP properties of our protocol and analyze its advantages in fault tolerance, accuracy, and communication efficiency relative to competing techniques. We illustrate our analysis by simulations driven by real-world traces of electricity consumption.« less

Alliance between tobacco and alcohol industries to shape public policy

PubMed Central

Jiang, Nan

2013-01-01

Aims The tobacco and alcohol industries share common policy goals when facing regulation, opposing policies such as tax increases and advertising restrictions. The collaboration between these two industries in the tobacco policy arena is unknown. This study explored if tobacco and alcohol companies built alliances to influence tobacco legislation, and if so, how those alliances worked. Methods Analysis of previously secret tobacco industry documents. Findings In the early 1980s, tobacco companies started efforts to build coalitions with alcohol and other industries to oppose cigarette excise taxes, clean indoor air policies, and tobacco advertising and promotion constraints. Alcohol companies were often identified as a key partner and source of financial support for the coalitions. These coalitions had variable success interfering with tobacco control policymaking. Conclusions The combined resources of tobacco and alcohol companies may have affected tobacco control legislation. These alliances helped to create the perception that there is a broader base of opposition to tobacco control. Advocates should be aware of the covert alliances between tobacco, alcohol, and other industries and expose them to correct this misperception. PMID:23587076

Quantum Authencryption with Two-Photon Entangled States for Off-Line Communicants

NASA Astrophysics Data System (ADS)

Ye, Tian-Yu

2016-02-01

In this paper, a quantum authencryption protocol is proposed by using the two-photon entangled states as the quantum resource. Two communicants Alice and Bob share two private keys in advance, which determine the generation of two-photon entangled states. The sender Alice sends the two-photon entangled state sequence encoded with her classical bits to the receiver Bob in the manner of one-step quantum transmission. Upon receiving the encoded quantum state sequence, Bob decodes out Alice's classical bits with the two-photon joint measurements and authenticates the integrity of Alice's secret with the help of one-way hash function. The proposed protocol only uses the one-step quantum transmission and needs neither a public discussion nor a trusted third party. As a result, the proposed protocol can be adapted to the case where the receiver is off-line, such as the quantum E-mail systems. Moreover, the proposed protocol provides the message authentication to one bit level with the help of one-way hash function and has an information-theoretical efficiency equal to 100 %.

Reduced insulin secretion and glucose intolerance are involved in the fasting susceptibility of common vampire bats.

PubMed

Freitas, Mariella B; Queiroz, Joicy F; Dias Gomes, Carolinne I; Collares-Buzato, Carla B; Barbosa, Helena C; Boschero, Antonio C; Gonçalves, Carlos A; Pinheiro, Eliana C

2013-03-01

Susceptibility during fasting has been reported for the common vampire bat (Desmodus rotundus), to the point of untimely deaths after only 2-3 nights of fasting. To investigate the underlying physiology of this critical metabolic condition, we analyzed serum insulin levels, pancreatic islets morphometry and immunocytochemistry (ICC), static insulin secretion in pancreas fragments, and insulin signaling mechanism in male vampire bats. A glucose tolerance test (ipGTT) was also performed. Serum insulin was found to be lower in fed vampires compared to other mammals, and was significantly reduced after 24h fasting. Morphometrical analyses revealed small irregular pancreatic islets with reduced percentage of β-cell mass compared to other bats. Static insulin secretion analysis showed that glucose-stimulated insulin secretion was impaired, as insulin levels did not reach significance under high glucose concentrations, whereas the response to the amino acid leucin was preserved. Results from ipGTT showed a failure on glucose clearance, indicating glucose intolerance due to diminished pancreatic insulin secretion and/or decreased β-cell response to glucose. In conclusion, data presented here indicate lower insulinemia and impaired insulin secretion in D. rotundus, which is consistent with the limited ability to store body energy reserves, previously reported in these animals. Whether these metabolic and hormonal features are associated with their blood diet remains to be determined. The peculiar food sharing through blood regurgitation, reported to this species, might be an adaptive mechanism overcoming this metabolic susceptibility. Copyright © 2012 Elsevier Inc. All rights reserved.

Bit-Oriented Quantum Public-Key Cryptosystem Based on Bell States

NASA Astrophysics Data System (ADS)

Wu, WanQing; Cai, QingYu; Zhang, HuanGuo; Liang, XiaoYan

2018-02-01

Quantum public key encryption system provides information confidentiality using quantum mechanics. This paper presents a quantum public key cryptosystem (Q P K C) based on the Bell states. By H o l e v o's theorem, the presented scheme provides the security of the secret key using one-wayness during the QPKC. While the QPKC scheme is information theoretic security under chosen plaintext attack (C P A). Finally some important features of presented QPKC scheme can be compared with other QPKC scheme.

An Empirical Analysis of the Cascade Secret Key Reconciliation Protocol for Quantum Key Distribution

DTIC Science & Technology

2011-09-01

performance with the parity checks within each pass increasing and as a result, the processing time is expected to increase as well. A conclusion is drawn... timely manner has driven efforts to develop new key distribution methods. The most promising method is Quantum Key Distribution (QKD) and is...thank the QKD Project Team for all of the insight and support they provided in such a short time period. Thanks are especially in order for my

Bit-Oriented Quantum Public-Key Cryptosystem Based on Bell States

NASA Astrophysics Data System (ADS)

Wu, WanQing; Cai, QingYu; Zhang, HuanGuo; Liang, XiaoYan

2018-06-01

Quantum public key encryption system provides information confidentiality using quantum mechanics. This paper presents a quantum public key cryptosystem ( Q P K C) based on the Bell states. By H o l e v o' s theorem, the presented scheme provides the security of the secret key using one-wayness during the QPKC. While the QPKC scheme is information theoretic security under chosen plaintext attack ( C P A). Finally some important features of presented QPKC scheme can be compared with other QPKC scheme.

Impact of regulated secretion on anti-parasitic CD8 T cell responses

PubMed Central

Grover, Harshita Satija; Chu, H. Hamlet; Kelly, Felice D.; Yang, Soo Jung; Reese, Michael L.; Blanchard, Nicolas; Gonzalez, Federico; Chan, Shiao Wei; Boothroyd, John C.; Shastri, Nilabh; Robey, Ellen A.

2014-01-01

Summary CD8 T cells play a key role in defense against the intracellular parasite Toxoplasma but why certain CD8 responses are more potent than others is not well understood. Here, we describe a parasite antigen ROP5 that elicits a modest CD8 T cell response in genetically susceptible mice. ROP5 is secreted via parasite organelles termed rhoptries that are injected directly into host cells during invasion, whereas the protective, dense granule antigen, GRA6, is constitutively secreted into the parasitophorous vacuole. Transgenic parasites in which the ROP5 antigenic epitope was targeted for secretion through dense granules led to enhanced CD8 T cell responses, whereas targeting the GRA6 epitope to rhoptries led to reduced CD8 responses. CD8 T cell responses to the dense granule-targeted ROP5 epitope resulted in reduced parasite load in the brain. These data suggest that the mode of secretion impacts the efficacy of parasite-specific CD8 T cell responses. PMID:24857659

Novel actions of IGFBP-3 on intracellular signaling pathways of insulin-secreting cells

PubMed Central

Chen, Xiaoyan; Ferry, Robert J.

2011-01-01

Understanding mechanisms underlying apoptotic destruction of insulin-secreting cells is critical to validate therapeutic targets for type 1 diabetes mellitus. We recently reported insulin-like growth factor binding protein-3 (IGFBP-3) as a novel mediator of apoptosis in insulin-secreting cells. In light of emerging IGF-independent roles for IGFBP-3, we investigated the mechanisms underlying actions of the novel, recombinant human mutant G56G80G81-IGFBP-3, which lacks intrinsic IGF binding affinity. Using the rat insulinoma RINm5F cell line, we report the first studies in insulin-secreting cells that IGFBP-3 selectively suppresses multiple, key intracellular phosphorelays. By immunoblot, we demonstrate that G56G80G81-IGFBP-3 suppresses phosphorylation of c-raf-MEK-ERK pathway and p38 kinase in time-dependent and dose-dependent manners. SAPK/JNK signaling was unaffected. These data delineate several novel intracellular sites of action for IGFBP-3 in insulin-secreting cells. PMID:16275148

P38 pathway as a key downstream signal of connective tissue growth factor to regulate metastatic potential in non-small-cell lung cancer.

PubMed

Kato, Shinichiro; Yokoyama, Satoru; Hayakawa, Yoshihiro; Li, Luhui; Iwakami, Yusuke; Sakurai, Hiroaki; Saiki, Ikuo

2016-10-01

Although the secretory matricellular protein connective tissue growth factor (CTGF) has been reported to be related to lung cancer metastasis, the precise mechanism by which CTGF regulates lung cancer metastasis has not been elucidated. In the present study, we show the molecular link between CTGF secretion and the p38 pathway in the invasive and metastatic potential of non-small-cell lung cancer (NSCLC). Among three different human NSCLC cell lines (PC-14, A549, and PC-9), their in vitro invasiveness was inversely correlated with the level of CTGF secretion. By supplementing or reducing CTGF secretion in NSCLC culture, dysregulation of the invasive and metastatic potential of NSCLC cell lines was largely compensated. By focusing on the protein kinases that are known to be regulated by CTGF, we found that the p38 pathway is a key downstream signal of CTGF to regulate the metastatic potential of NSCLC. Importantly, a negative correlation between CTGF and phosphorylation status of p38 was identified in The Cancer Genome Atlas lung adenocarcinoma dataset. In the context of the clinical importance of our findings, we showed that p38 inhibitor, SB203580, reduced the metastatic potential of NSCLC secreting low levels of CTGF. Collectively, our present findings indicate that the CTGF/p38 axis is a novel therapeutic target of NSCLC metastasis, particularly NSCLC secreting low levels of CTGF. © 2016 The Authors. Cancer Science published by John Wiley & Sons Australia, Ltd on behalf of Japanese Cancer Association.

Follistatin-like protein 1 enhances NLRP3 inflammasome-mediated IL-1β secretion from monocytes and macrophages

PubMed Central

Chaly, Yury; Fu, Yu; Marinov, Anthony; Hostager, Bruce; Yan, Wei; Campfield, Brian; Kellum, John A.; Bushnell, Daniel; Wang, Yudong; Vockley, Jerry; Hirsch, Raphael

2014-01-01

Summary Follistatin-like protein 1 (FSTL-1) is overexpressed in a number of inflammatory conditions characterized by elevated IL-1β. Here we found that FSTL-1 serum concentration was increased three-fold in patients with bacterial sepsis and four-fold following administration of endotoxin (LPS) to mice. To test the contribution of FSTL-1 to IL-1β secretion, wild-type and FSTL-1-deficient mice were injected with LPS. While LPS induced IL-1β in the sera of wild-type mice, it was low or undetectable in FSTL-1-deficient mice. Monocytes/macrophages, a key source of IL-1β, do not normally express FSTL-1. However, FSTL-1 was found in tissue macrophages after injection of LPS into mouse footpads, demonstrating that macrophages are capable of taking up FSTL-1 at sites of inflammation. In vitro, intracellular FSTL-1 localized to the mitochondria. FSTL-1 activated the mitochondrial electron transport chain, increased the production of ATP (a key activator of the NLRP3 inflammasome) and IL-1β secretion. FSTL-1 also enhanced transcription of the NLRP3 and pro-caspase-1 genes, two components of the NLRP3 inflammasome. Adenovirus-mediated overexpression of FSTL-1 in mouse paws led to activation of the inflammasome complex and local secretion of IL-1β and IL-1β-related proinflammatory cytokines. These results suggest that FSTL-1 may act on the NLRP3 inflammasome to promote IL-1β secretion from monocytes/macrophages. PMID:24470197

Secure NFV Orchestration Over an SDN-Controlled Optical Network With Time-Shared Quantum Key Distribution Resources

NASA Astrophysics Data System (ADS)

Aguado, Alejandro; Hugues-Salas, Emilio; Haigh, Paul Anthony; Marhuenda, Jaume; Price, Alasdair B.; Sibson, Philip; Kennard, Jake E.; Erven, Chris; Rarity, John G.; Thompson, Mark Gerard; Lord, Andrew; Nejabati, Reza; Simeonidou, Dimitra

2017-04-01

We demonstrate, for the first time, a secure optical network architecture that combines NFV orchestration and SDN control with quantum key distribution (QKD) technology. A novel time-shared QKD network design is presented as a cost-effective solution for practical networks.

Antibody engineering reveals the important role of J segments in the production efficiency of llama single-domain antibodies in Saccharomyces cerevisiae.

PubMed

Gorlani, A; Hulsik, D Lutje; Adams, H; Vriend, G; Hermans, P; Verrips, T

2012-01-01

Variable domains of llama heavy-chain antibodies (VHH) are becoming a potent tool for a wide range of biotechnological and medical applications. Because of structural features typical of their single-domain nature, they are relatively easy to produce in lower eukaryotes, but it is not uncommon that some molecules have poor secretion efficiency. We therefore set out to study the production yield of VHH. We computationally identified five key residues that are crucial for folding and secretion, and we validated their importance with systematic site-directed mutations. The observation that all key residues were localised in the V segment, in proximity of the J segment of VHH, led us to study the importance of J segment in secretion efficiency. Intriguingly, we found that the use of specific J segments in VHH could strongly influence the production yield. Sequence analysis and expression experiments strongly suggested that interactions with chaperones, especially with the J segment, are a crucial aspect of the production yield of VHH.

Awakening Brilliance in the Writer's Workshop: Using Notebooks, Mentor Texts, and the Writing Process

ERIC Educational Resources Information Center

Morris, Lisa

2012-01-01

Master teacher Lisa Morris invites you to share her secrets of success with writer's workshops. After years of experimenting with the workshop model, she has developed the most effective ways to apply it in the classroom, yielding higher test scores and increased student engagement. Through practical, step-by-step instruction, Morris demonstrates…

Notes from the Delivery Room

ERIC Educational Resources Information Center

Wasburn-Moses, Leah

2009-01-01

In this article, the author offers some success secrets of the stars for fitting into one's research again after the baby. The author has some experience to share, having had her first child as a high school teacher, her second as an ABD (all-but-dissertation) graduate student, and now her third as an assistant professor at a research-intensive…

The Rosenberg Trial: Uncovering the Layers of History

ERIC Educational Resources Information Center

Ragsdale, Bruce A.

2013-01-01

The trial of Julius and Ethel Rosenberg on charges of conspiring to spy for the Soviet Union remains one of the defining moments of the Cold War era. The dramatic allegations of stolen atomic secrets and networks of Communist spies riveted the public's attention. The determination of government prosecutors reflected a widely shared belief that the…

Co-evolution of chitinases from maize and other cereals with secreted proteases from Pleosporineae fungi

USDA-ARS?s Scientific Manuscript database

Plant class IV chitinases are composed of a carboxy-terminal chitinase domain that is attached, through a linker sequence, to a small amino-terminal domain that can be thought of as a structured peptide. While both the peptide-like domain and the chitinase domain share sequence homology throughout m...

Secrets of the Soil (LBNL Science at the Theater)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brodie, Eoin; Northen, Trent; Jansson, Janet

2011-11-07

Four Berkeley Lab scientists unveil the "Secrets of the Soil"at this Nov. 7, 2011 Science at the Theater event. Eoin Brodie, Janet Jansson, Margaret Torn and Trent Northen talk about their research and how soil could hold the key to our climate and energy future.The discussion was moderated by John Harte, who holds a joint professorship in the Energy and Resources Group and the Ecosystem Sciences Division of UC Berkeley's College of Natural Resources

Sat1 is dispensable for active oxalate secretion in mouse duodenum

PubMed Central

Ko, Narae; Knauf, Felix; Jiang, Zhirong; Markovich, Daniel

2012-01-01

Mice deficient for the apical membrane oxalate transporter SLC26A6 develop hyperoxalemia, hyperoxaluria, and calcium oxalate stones due to a defect in intestinal oxalate secretion. However, the nature of the basolateral membrane oxalate transport process that operates in series with SLC26A6 to mediate active oxalate secretion in the intestine remains unknown. Sulfate anion transporter-1 (Sat1 or SLC26A1) is a basolateral membrane anion exchanger that mediates intestinal oxalate transport. Moreover, Sat1-deficient mice also have a phenotype of hyperoxalemia, hyperoxaluria, and calcium oxalate stones. We, therefore, tested the role of Sat1 in mouse duodenum, a tissue with Sat1 expression and SLC26A6-dependent oxalate secretion. Although the active secretory flux of oxalate across mouse duodenum was strongly inhibited (>90%) by addition of the disulfonic stilbene DIDS to the basolateral solution, secretion was unaffected by changes in medium concentrations of sulfate and bicarbonate, key substrates for Sat1-mediated anion exchange. Inhibition of intracellular bicarbonate production by acetazolamide and complete removal of bicarbonate from the buffer also produced no change in oxalate secretion. Finally, active oxalate secretion was not reduced in Sat1-null mice. We conclude that a DIDS-sensitive basolateral transporter is involved in mediating oxalate secretion across mouse duodenum, but Sat1 itself is dispensable for this process. PMID:22517357

CCL11 elicits secretion of RNases from mouse eosinophils and their cell-free granules

PubMed Central

Shamri, Revital; Melo, Rossana C. N.; Young, Kristen M.; Bivas-Benita, Maytal; Xenakis, Jason J.; Spencer, Lisa A.; Weller, Peter F.

2012-01-01

Rapid secretion of eosinophil-associated RNases (EARs), such as the human eosinophilic cationic protein (ECP), from intracellular granules is central to the role of eosinophils in allergic diseases and host immunity. Our knowledge regarding allergic inflammation has advanced based on mouse experimental models. However, unlike human eosinophils, capacities of mouse eosinophils to secrete granule proteins have been controversial. To study mechanisms of mouse eosinophil secretion and EAR release, we combined an RNase assay of mouse EARs with ultrastructural studies. In vitro, mouse eosinophils stimulated with the chemokine eotaxin-1 (CCL11) secreted enzymatically active EARs (EC50 5 nM) by piecemeal degranulation. In vivo, in a mouse model of allergic airway inflammation, increased airway eosinophil infiltration (24-fold) correlated with secretion of active RNases (3-fold). Moreover, we found that eosinophilic inflammation in mice can involve eosinophil cytolysis and release of cell-free granules. Cell-free mouse eosinophil granules expressed functional CCR3 receptors and secreted their granule proteins, including EAR and eosinophil peroxidase in response to CCL11. Collectively, these data demonstrate chemokine-dependent secretion of EARs from both intact mouse eosinophils and their cell-free granules, findings pertinent to understanding the pathogenesis of eosinophil-associated diseases, in which EARs are key factors.—Shamri, R., Melo, R. C. N., Young, K. M., B.-B, M., Xenakis, J. J., Spencer, L. A., Weller, P. F. CCL11 elicits secretion of RNases from mouse eosinophils and their cell-free granules. PMID:22294786

Genetic Architecture Promotes the Evolution and Maintenance of Cooperation

PubMed Central

Frénoy, Antoine; Taddei, François; Misevic, Dusan

2013-01-01

When cooperation has a direct cost and an indirect benefit, a selfish behavior is more likely to be selected for than an altruistic one. Kin and group selection do provide evolutionary explanations for the stability of cooperation in nature, but we still lack the full understanding of the genomic mechanisms that can prevent cheater invasion. In our study we used Aevol, an agent-based, in silico genomic platform to evolve populations of digital organisms that compete, reproduce, and cooperate by secreting a public good for tens of thousands of generations. We found that cooperating individuals may share a phenotype, defined as the amount of public good produced, but have very different abilities to resist cheater invasion. To understand the underlying genetic differences between cooperator types, we performed bio-inspired genomics analyses of our digital organisms by recording and comparing the locations of metabolic and secretion genes, as well as the relevant promoters and terminators. Association between metabolic and secretion genes (promoter sharing, overlap via frame shift or sense-antisense encoding) was characteristic for populations with robust cooperation and was more likely to evolve when secretion was costly. In mutational analysis experiments, we demonstrated the potential evolutionary consequences of the genetic association by performing a large number of mutations and measuring their phenotypic and fitness effects. The non-cooperating mutants arising from the individuals with genetic association were more likely to have metabolic deleterious mutations that eventually lead to selection eliminating such mutants from the population due to the accompanying fitness decrease. Effectively, cooperation evolved to be protected and robust to mutations through entangled genetic architecture. Our results confirm the importance of second-order selection on evolutionary outcomes, uncover an important genetic mechanism for the evolution and maintenance of cooperation, and suggest promising methods for preventing gene loss in synthetically engineered organisms. PMID:24278000

Suppression of allo-human leucocyte antigen (HLA) antibodies secreted by B memory cells in vitro: intravenous immunoglobulin (IVIg) versus a monoclonal anti-HLA-E IgG that mimics HLA-I reactivities of IVIg.

PubMed

Zhu, D; Ravindranath, M H; Terasaki, P I; Miyazaki, T; Pham, T; Jucaud, V

2014-08-01

B memory cells remain in circulation and secrete alloantibodies without antigen exposure > 20 years after alloimmunization postpartum or by transplantation. These long-lived B cells are resistant to cytostatic drugs. Therapeutically, intravenous immunoglobulin (IVIg) is administered to reduce allo-human leucocyte antigen (HLA) antibodies pre- and post-transplantation, but the mechanism of reduction remains unclear. Recently, we reported that IVIg reacts with several HLA-I alleles and the HLA reactivity of IVIg is lost after its HLA-E reactivity is adsorbed out. Therefore, we have generated an anti-HLA-E monoclonal antibody that mimics the HLA-reactivity of IVIg to investigate whether this antibody suppresses IgG secretion, as does IVIg. B cells were purified from the blood of a woman in whose blood the B memory cells remained without antigen exposure > 20 years after postpartum alloimmunization. The B cells were stimulated with cytokines using a well-defined culture system. The anti-HLA-E monoclonal antibody (mAb) significantly suppressed the allo-HLA class-II IgG produced by the B cells, and that this suppression was far superior to that by IVIg. These findings were confirmed with HLA-I antibody secreted by the immortalized B cell line, developed from the blood of another alloimmunized woman. The binding affinity of the anti-HLA-E mAb for peptide sequences shared (i.e. shared epitopes) between HLA-E and other β2-microglobulin-free HLA heavy chains (open conformers) on the cell surface of B cells may act as a ligand and signal suppression of IgG production of activated B memory cells. We propose that anti-HLA-E monoclonal antibody may also be useful to suppress allo-HLA IgG production in vivo. © 2014 British Society for Immunology.

Quantum cryptography without switching.

PubMed

Weedbrook, Christian; Lance, Andrew M; Bowen, Warwick P; Symul, Thomas; Ralph, Timothy C; Lam, Ping Koy

2004-10-22

We propose a new coherent state quantum key distribution protocol that eliminates the need to randomly switch between measurement bases. This protocol provides significantly higher secret key rates with increased bandwidths than previous schemes that only make single quadrature measurements. It also offers the further advantage of simplicity compared to all previous protocols which, to date, have relied on switching.

Security analysis and improvements of two-factor mutual authentication with key agreement in wireless sensor networks.

PubMed

Kim, Jiye; Lee, Donghoon; Jeon, Woongryul; Lee, Youngsook; Won, Dongho

2014-04-09

User authentication and key management are two important security issues in WSNs (Wireless Sensor Networks). In WSNs, for some applications, the user needs to obtain real-time data directly from sensors and several user authentication schemes have been recently proposed for this case. We found that a two-factor mutual authentication scheme with key agreement in WSNs is vulnerable to gateway node bypassing attacks and user impersonation attacks using secret data stored in sensor nodes or an attacker's own smart card. In this paper, we propose an improved scheme to overcome these security weaknesses by storing secret data in unique ciphertext form in each node. In addition, our proposed scheme should provide not only security, but also efficiency since sensors in a WSN operate with resource constraints such as limited power, computation, and storage space. Therefore, we also analyze the performance of the proposed scheme by comparing its computation and communication costs with those of other schemes.

Experimental Demonstration of Counterfactual Quantum Communication

NASA Astrophysics Data System (ADS)

Liu, Yang; Ju, Lei; Liang, Xiao-Lei; Tang, Shi-Biao; Tu, Guo-Liang Shen; Zhou, Lei; Peng, Cheng-Zhi; Chen, Kai; Chen, Teng-Yun; Chen, Zeng-Bing; Pan, Jian-Wei

2012-07-01

Quantum effects, besides offering substantial superiority in many tasks over classical methods, are also expected to provide interesting ways to establish secret keys between remote parties. A striking scheme called “counterfactual quantum cryptography” proposed by Noh [Phys. Rev. Lett. 103, 230501 (2009).PRLTAO0031-900710.1103/PhysRevLett.103.230501] allows one to maintain secure key distributions, in which particles carrying secret information are seemingly not being transmitted through quantum channels. We have experimentally demonstrated, for the first time, a faithful implementation for such a scheme with an on-table realization operating at telecom wavelengths. To verify its feasibility for extension over a long distance, we have furthermore reported an illustration on a 1 km fiber. In both cases, high visibilities of more than 98% are achieved through active stabilization of interferometers. Our demonstration is crucial as a direct verification of such a remarkable application, and this procedure can become a key communication module for revealing fundamental physics through counterfactuals.

Security Analysis and Improvements of Two-Factor Mutual Authentication with Key Agreement in Wireless Sensor Networks

PubMed Central

Kim, Jiye; Lee, Donghoon; Jeon, Woongryul; Lee, Youngsook; Won, Dongho

2014-01-01

User authentication and key management are two important security issues in WSNs (Wireless Sensor Networks). In WSNs, for some applications, the user needs to obtain real-time data directly from sensors and several user authentication schemes have been recently proposed for this case. We found that a two-factor mutual authentication scheme with key agreement in WSNs is vulnerable to gateway node bypassing attacks and user impersonation attacks using secret data stored in sensor nodes or an attacker's own smart card. In this paper, we propose an improved scheme to overcome these security weaknesses by storing secret data in unique ciphertext form in each node. In addition, our proposed scheme should provide not only security, but also efficiency since sensors in a WSN operate with resource constraints such as limited power, computation, and storage space. Therefore, we also analyze the performance of the proposed scheme by comparing its computation and communication costs with those of other schemes. PMID:24721764

A Cryptographic SoC for Robust Protection of Secret Keys in IPTV DRM Systems

NASA Astrophysics Data System (ADS)

Lee, Sanghan; Yang, Hae-Yong; Yeom, Yongjin; Park, Jongsik

The security level of an internet protocol television (IPTV) digital right management (DRM) system ultimately relies on protection of secret keys. Well known devices for the key protection include smartcards and battery backup SRAMs (BB-SRAMs); however, these devices could be vulnerable to various physical attacks. In this paper, we propose a secure and cost-effective design of a cryptographic system on chip (SoC) that integrates the BB-SRAM with a cell-based design technique. The proposed SoC provides robust safeguard against the physical attacks, and satisfies high-speed and low-price requirements of IPTV set-top boxes. Our implementation results show that the maximum encryption rate of the SoC is 633Mb/s. In order to verify the data retention capabilities, we made a prototype chip using 0.18µm standard cell technology. The experimental results show that the integrated BB-SRAM can reliably retain data with a 1.4µA leakage current.

Numerical simulation of the optimal two-mode attacks for two-way continuous-variable quantum cryptography in reverse reconciliation

NASA Astrophysics Data System (ADS)

Zhang, Yichen; Li, Zhengyu; Zhao, Yijia; Yu, Song; Guo, Hong

2017-02-01

We analyze the security of the two-way continuous-variable quantum key distribution protocol in reverse reconciliation against general two-mode attacks, which represent all accessible attacks at fixed channel parameters. Rather than against one specific attack model, the expression of secret key rates of the two-way protocol are derived against all accessible attack models. It is found that there is an optimal two-mode attack to minimize the performance of the protocol in terms of both secret key rates and maximal transmission distances. We identify the optimal two-mode attack, give the specific attack model of the optimal two-mode attack and show the performance of the two-way protocol against the optimal two-mode attack. Even under the optimal two-mode attack, the performances of two-way protocol are still better than the corresponding one-way protocol, which shows the advantage of making double use of the quantum channel and the potential of long-distance secure communication using a two-way protocol.

The Sanford Science Education Center: Addressing Key Design Challenges in Sharing Complex Science with Diverse Audiences

ERIC Educational Resources Information Center

Inverness Research, 2016

2016-01-01

In facilities throughout the United States and abroad, communities of scientists share infrastructure, instrumentation, and equipment to conduct scientific research. In these large facilities--laboratories, accelerators, telescope arrays, and research vessels--scientists are researching key questions that have the potential to make a significant…

Improving Family and Community Engagement through Sharing Data. Briefing Paper

ERIC Educational Resources Information Center

Arellano, Brenda; Baldwin, Marion; LaTurner, Jason; Mabus, Jesse; Times, Chris; Wade, Sally M.

2012-01-01

It is clear that families and communities play key roles in student achievement and school improvement efforts. Across the nation, states are leading initiatives to improve communication and engagement with these stakeholders through effective data sharing. Key points highlighted in this brief include: (1) Maintaining close ties with family and…

Secrets and disclosure in donor conception.

PubMed

Frith, Lucy; Blyth, Eric; Crawshaw, Marilyn; van den Akker, Olga

2018-01-01

This article considers the disclosure, sharing and exchange of information on being donor conceived within families, drawing on data from a study undertaken with donor-conceived adults registered with UK Donor Link (a voluntary DNA-linking register). This paper considers the narratives of how respondents found out they were donor-conceived and what events triggered disclosure of this information. This paper then goes on to examine the role secrecy played in their family life and uses the concept of 'display' to explore how secrecy affected their relationships with their immediate and extended family. Secrets are notoriously 'leaky' and we found complex patterns of knowing and uncertainty about whom in the family knew that the person was donor-conceived. We argue that what is kept secret and from whom provides insights into the multifaceted web of social relationships that can be created by donor-conception, and how knowledge can be managed and controlled in attempts to display and maintain family narratives of biogenetic connection. © 2017 Foundation for the Sociology of Health & Illness.

Profiling Synaptic Proteins Identifies Regulators of Insulin Secretion and Lifespan

PubMed Central

Kaplan, Joshua M.

2008-01-01

Cells are organized into distinct compartments to perform specific tasks with spatial precision. In neurons, presynaptic specializations are biochemically complex subcellular structures dedicated to neurotransmitter secretion. Activity-dependent changes in the abundance of presynaptic proteins are thought to endow synapses with different functional states; however, relatively little is known about the rules that govern changes in the composition of presynaptic terminals. We describe a genetic strategy to systematically analyze protein localization at Caenorhabditis elegans presynaptic specializations. Nine presynaptic proteins were GFP-tagged, allowing visualization of multiple presynaptic structures. Changes in the distribution and abundance of these proteins were quantified in 25 mutants that alter different aspects of neurotransmission. Global analysis of these data identified novel relationships between particular presynaptic components and provides a new method to compare gene functions by identifying shared protein localization phenotypes. Using this strategy, we identified several genes that regulate secretion of insulin-like growth factors (IGFs) and influence lifespan in a manner dependent on insulin/IGF signaling. PMID:19043554

Using a Personal Device to Strengthen Password Authentication from an Untrusted Computer

NASA Astrophysics Data System (ADS)

Mannan, Mohammad; van Oorschot, P. C.

Keylogging and phishing attacks can extract user identity and sensitive account information for unauthorized access to users' financial accounts. Most existing or proposed solutions are vulnerable to session hijacking attacks. We propose a simple approach to counter these attacks, which cryptographically separates a user's long-term secret input from (typically untrusted) client PCs; a client PC performs most computations but has access only to temporary secrets. The user's long-term secret (typically short and low-entropy) is input through an independent personal trusted device such as a cellphone. The personal device provides a user's long-term secrets to a client PC only after encrypting the secrets using a pre-installed, "correct" public key of a remote service (the intended recipient of the secrets). The proposed protocol (MP-Auth) realizes such an approach, and is intended to safeguard passwords from keyloggers, other malware (including rootkits), phishing attacks and pharming, as well as to provide transaction security to foil session hijacking. We report on a prototype implementation of MP-Auth, and provide a comparison of web authentication techniques that use an additional factor of authentication (e.g. a cellphone, PDA or hardware token).