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.

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.

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.

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

Tag Content Access Control with Identity-based Key Exchange

NASA Astrophysics Data System (ADS)

Yan, Liang; Rong, Chunming

2010-09-01

Radio Frequency Identification (RFID) technology that used to identify objects and users has been applied to many applications such retail and supply chain recently. How to prevent tag content from unauthorized readout is a core problem of RFID privacy issues. Hash-lock access control protocol can make tag to release its content only to reader who knows the secret key shared between them. However, in order to get this shared secret key required by this protocol, reader needs to communicate with a back end database. In this paper, we propose to use identity-based secret key exchange approach to generate the secret key required for hash-lock access control protocol. With this approach, not only back end database connection is not needed anymore, but also tag cloning problem can be eliminated at the same time.

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.

Secret Key Generation via a Modified Quantum Secret Sharing Protocol

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

Smith IV, Amos M; Evans, Philip G; Lawrie, Benjamin J

We present and experimentally show a novel protocol for distributing secret information between two and only two parties in a N-party single-qubit Quantum Secret Sharing (QSS) system. We demonstrate this new algorithm with N = 3 active parties over 6km of telecom. ber. Our experimental device is based on the Clavis2 Quantum Key Distribution (QKD) system built by ID Quantique but is generalizable to any implementation. We show that any two out of the N parties can build secret keys based on partial information from each other and with collaboration from the remaining N > 2 parties. This algorithm allowsmore » for the creation of two-party secret keys were standard QSS does not and signicantly reduces the number of resources needed to implement QKD on a highly connected network such as the electrical grid.« less

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

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.

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.

Multiparty Quantum Secret Sharing of Key Using Practical Faint Laser Pulses

NASA Astrophysics Data System (ADS)

Zhang, Zhan-Jun; Man, Zhong-Xiao

2005-07-01

Based on a bidirectional quantum key distribution protocol [Phys. Rev. A 70 (2004) 012311], we propose a (m-1,m-1)-threshold scheme of m (m >= 3)-party quantum secret sharing of key by using practical faint laser pulses. In our scheme, if all the m-1 sharers collaborate, they can obtain the joint secret key from the message sender. Our scheme is more feasible according to the present-day technology.

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.

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.

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.

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.

Two-Party secret key distribution via a modified quantum secret sharing protocol

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

Grice, Warren P.; Evans, Philip G.; Lawrie, Benjamin

We present and demonstrate a method of distributing secret information based on N-party single-qubit Quantum Secret Sharing (QSS) in a modied plug-and-play two-party Quantum Key Distribution (QKD) system with N 2 intermediate nodes and compare it to both standard QSS and QKD. Our setup is based on the Clavis2 QKD system built by ID Quantique but is generalizable to any implementation. We show that any two out of N parties can build a secret key based on partial information from each other and with collaboration from the remaining N 2 parties. This method signicantly reduces the number of resources (singlemore » photon detectors, lasers and dark ber connections) needed to implement QKD on the grid.« less

Two-Party secret key distribution via a modified quantum secret sharing protocol

DOE PAGES

Grice, Warren P.; Evans, Philip G.; Lawrie, Benjamin; ...

2015-01-01

We present and demonstrate a method of distributing secret information based on N-party single-qubit Quantum Secret Sharing (QSS) in a modied plug-and-play two-party Quantum Key Distribution (QKD) system with N 2 intermediate nodes and compare it to both standard QSS and QKD. Our setup is based on the Clavis2 QKD system built by ID Quantique but is generalizable to any implementation. We show that any two out of N parties can build a secret key based on partial information from each other and with collaboration from the remaining N 2 parties. This method signicantly reduces the number of resources (singlemore » photon detectors, lasers and dark ber connections) needed to implement QKD on the grid.« less

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.

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.

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.

Application of homomorphism to secure image sharing

NASA Astrophysics Data System (ADS)

Islam, Naveed; Puech, William; Hayat, Khizar; Brouzet, Robert

2011-09-01

In this paper, we present a new approach for sharing images between l players by exploiting the additive and multiplicative homomorphic properties of two well-known public key cryptosystems, i.e. RSA and Paillier. Contrary to the traditional schemes, the proposed approach employs secret sharing in a way that limits the influence of the dealer over the protocol and allows each player to participate with the help of his key-image. With the proposed approach, during the encryption step, each player encrypts his own key-image using the dealer's public key. The dealer encrypts the secret-to-be-shared image with the same public key and then, the l encrypted key-images plus the encrypted to-be shared image are multiplied homomorphically to get another encrypted image. After this step, the dealer can safely get a scrambled image which corresponds to the addition or multiplication of the l + 1 original images ( l key-images plus the secret image) because of the additive homomorphic property of the Paillier algorithm or multiplicative homomorphic property of the RSA algorithm. When the l players want to extract the secret image, they do not need to use keys and the dealer has no role. Indeed, with our approach, to extract the secret image, the l players need only to subtract their own key-image with no specific order from the scrambled image. Thus, the proposed approach provides an opportunity to use operators like multiplication on encrypted images for the development of a secure privacy preserving protocol in the image domain. We show that it is still possible to extract a visible version of the secret image with only l-1 key-images (when one key-image is missing) or when the l key-images used for the extraction are different from the l original key-images due to a lossy compression for example. Experimental results and security analysis verify and prove that the proposed approach is secure from cryptographic viewpoint.

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.

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.

Insecurity of position-based quantum-cryptography protocols against entanglement attacks

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

Lau, Hoi-Kwan; Lo, Hoi-Kwong

2011-01-15

Recently, position-based quantum cryptography has been claimed to be unconditionally secure. On the contrary, here we show that the existing proposals for position-based quantum cryptography are, in fact, insecure if entanglement is shared among two adversaries. Specifically, we demonstrate how the adversaries can incorporate ideas of quantum teleportation and quantum secret sharing to compromise the security with certainty. The common flaw to all current protocols is that the Pauli operators always map a codeword to a codeword (up to an irrelevant overall phase). We propose a modified scheme lacking this property in which the same cheating strategy used to underminemore » the previous protocols can succeed with a rate of at most 85%. We prove the modified protocol is secure when the shared quantum resource between the adversaries is a two- or three-level system.« less

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

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

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.

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.

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.

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.

Robust multiparty quantum secret key sharing over two collective-noise channels

NASA Astrophysics Data System (ADS)

Zhang, Zhan-jun

2006-02-01

Based on a polarization-based quantum key distribution protocol over a collective-noise channel [Phys. Rev. Lett. 92 (2004) 017901], a robust (n,n)-threshold scheme of multiparty quantum secret sharing of key over two collective-noise channels (i.e., the collective dephasing channel and the collective rotating channel) is proposed. In this scheme the sharer entirety can establish a joint key with the message sender only if all the sharers collaborate together. Since Bell singlets are enough for use and only single-photon polarization needs to be identified, this scheme is feasible according to the present-day technique.

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-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

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.

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.

Threshold Things That Think: Authorisation for Resharing

NASA Astrophysics Data System (ADS)

Peeters, Roel; Kohlweiss, Markulf; Preneel, Bart

As we are evolving towards ubiquitous computing, users carry an increasing number of mobile devices with sensitive information. The security of this information can be protected using threshold cryptography, in which secret computations are shared between multiple devices. Threshold cryptography can be made more robust by resharing protocols, which allow recovery from partial compromises. This paper introduces user-friendly and secure protocols for the authorisation of resharing protocols. We present both automatic and manual protocols, utilising a group manual authentication protocol to add a new device. We analyse the security of these protocols: our analysis considers permanent and temporary compromises, denial of service attacks and manual authentications errors of the user.

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.

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.

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.

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.

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.

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

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.

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.

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.

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.

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.

Nonclassicality thresholds for multiqubit states: Numerical analysis

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

Gruca, Jacek; Zukowski, Marek; Laskowski, Wieslaw

2010-07-15

States that strongly violate Bell's inequalities are required in many quantum-informational protocols as, for example, in cryptography, secret sharing, and the reduction of communication complexity. We investigate families of such states with a numerical method which allows us to reveal nonclassicality even without direct knowledge of Bell's inequalities for the given problem. An extensive set of numerical results is presented and discussed.

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.

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

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

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.

Efficient multiparty quantum-secret-sharing schemes

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

Xiao Li; Deng Fuguo; Key Laboratory for Quantum Information and Measurements, MOE, Beijing 100084

In this work, we generalize the quantum-secret-sharing scheme of Hillery, Buzek, and Berthiaume [Phys. Rev. A 59, 1829 (1999)] into arbitrary multiparties. Explicit expressions for the shared secret bit is given. It is shown that in the Hillery-Buzek-Berthiaume quantum-secret-sharing scheme the secret information is shared in the parity of binary strings formed by the measured outcomes of the participants. In addition, we have increased the efficiency of the quantum-secret-sharing scheme by generalizing two techniques from quantum key distribution. The favored-measuring-basis quantum-secret-sharing scheme is developed from the Lo-Chau-Ardehali technique [H. K. Lo, H. F. Chau, and M. Ardehali, e-print quant-ph/0011056] wheremore » all the participants choose their measuring-basis asymmetrically, and the measuring-basis-encrypted quantum-secret-sharing scheme is developed from the Hwang-Koh-Han technique [W. Y. Hwang, I. G. Koh, and Y. D. Han, Phys. Lett. A 244, 489 (1998)] where all participants choose their measuring basis according to a control key. Both schemes are asymptotically 100% in efficiency, hence nearly all the Greenberger-Horne-Zeilinger states in a quantum-secret-sharing process are used to generate shared secret information.« less

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.

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.

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.

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.

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.

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

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

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.

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.

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.

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

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).

Anti-Noise Bidirectional Quantum Steganography Protocol with Large Payload

NASA Astrophysics Data System (ADS)

Qu, Zhiguo; Chen, Siyi; Ji, Sai; Ma, Songya; Wang, Xiaojun

2018-06-01

An anti-noise bidirectional quantum steganography protocol with large payload protocol is proposed in this paper. In the new protocol, Alice and Bob enable to transmit classical information bits to each other while teleporting secret quantum states covertly. The new protocol introduces the bidirectional quantum remote state preparation into the bidirectional quantum secure communication, not only to expand secret information from classical bits to quantum state, but also extract the phase and amplitude values of secret quantum state for greatly enlarging the capacity of secret information. The new protocol can also achieve better imperceptibility, since the eavesdropper can hardly detect the hidden channel or even obtain effective secret quantum states. Comparing with the previous quantum steganography achievements, due to its unique bidirectional quantum steganography, the new protocol can obtain higher transmission efficiency and better availability. Furthermore, the new algorithm can effectively resist quantum noises through theoretical analysis. Finally, the performance analysis proves the conclusion that the new protocol not only has good imperceptibility, high security, but also large payload.

Anti-Noise Bidirectional Quantum Steganography Protocol with Large Payload

NASA Astrophysics Data System (ADS)

Qu, Zhiguo; Chen, Siyi; Ji, Sai; Ma, Songya; Wang, Xiaojun

2018-03-01

An anti-noise bidirectional quantum steganography protocol with large payload protocol is proposed in this paper. In the new protocol, Alice and Bob enable to transmit classical information bits to each other while teleporting secret quantum states covertly. The new protocol introduces the bidirectional quantum remote state preparation into the bidirectional quantum secure communication, not only to expand secret information from classical bits to quantum state, but also extract the phase and amplitude values of secret quantum state for greatly enlarging the capacity of secret information. The new protocol can also achieve better imperceptibility, since the eavesdropper can hardly detect the hidden channel or even obtain effective secret quantum states. Comparing with the previous quantum steganography achievements, due to its unique bidirectional quantum steganography, the new protocol can obtain higher transmission efficiency and better availability. Furthermore, the new algorithm can effectively resist quantum noises through theoretical analysis. Finally, the performance analysis proves the conclusion that the new protocol not only has good imperceptibility, high security, but also large payload.

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…

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.

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

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.

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.

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.

A Secure RFID Tag Authentication Protocol with Privacy Preserving in Telecare Medicine Information System.

PubMed

Li, Chun-Ta; Weng, Chi-Yao; Lee, Cheng-Chi

2015-08-01

Radio Frequency Identification (RFID) based solutions are widely used for providing many healthcare applications include patient monitoring, object traceability, drug administration system and telecare medicine information system (TMIS) etc. In order to reduce malpractices and ensure patient privacy, in 2015, Srivastava et al. proposed a hash based RFID tag authentication protocol in TMIS. Their protocol uses lightweight hash operation and synchronized secret value shared between back-end server and tag, which is more secure and efficient than other related RFID authentication protocols. Unfortunately, in this paper, we demonstrate that Srivastava et al.'s tag authentication protocol has a serious security problem in that an adversary may use the stolen/lost reader to connect to the medical back-end server that store information associated with tagged objects and this privacy damage causing the adversary could reveal medical data obtained from stolen/lost readers in a malicious way. Therefore, we propose a secure and efficient RFID tag authentication protocol to overcome security flaws and improve the system efficiency. Compared with Srivastava et al.'s protocol, the proposed protocol not only inherits the advantages of Srivastava et al.'s authentication protocol for TMIS but also provides better security with high system efficiency.

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.

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.

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.

Quantum secret information equal exchange protocol based on dense coding

NASA Astrophysics Data System (ADS)

Jiang, Ying-Hua; Zhang, Shi-Bin; Dai, Jin-Qiao; Shi, Zhi-Ping

2018-04-01

In this paper, we design a novel quantum secret information equal exchange protocol, which implements the equal exchange of secret information between the two parties with the help of semi-trusted third party (TP). In the protocol, EPR pairs prepared by the TP are, respectively, distributed to both the communication parties. Then, the two parties perform Pauli operation on each particle and return the new particles to TP, respectively. TP measures each new pair with Bell basis and announces the measurement results. Both parties deduce the secret information of each other according to the result of announcement by TP. Finally, the security analysis shows that this protocol solves the problem about equal exchange of secret information between two parties and verifies the security of semi-trusted TPs. It proves that the protocol can effectively resist glitch attacks, intercept retransmission attacks and entanglement attack.

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.

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

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

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

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.

Quantum private comparison protocol based on the entanglement swapping between χ ^+ state and W-Class state

NASA Astrophysics Data System (ADS)

Xu, Ling; Zhao, Zhiwen

2017-12-01

Quantum private comparison (QPC) protocol, including Alice, Bob and the third party Charlie, aims at comparing Alice and Bob's secret inputs correctly without leaking them. Firstly, χ ^+ state and W-Class state are used to conduct the entanglement swapping in this protocol. Either the basis {|φ ^± > ,|ψ ^± >} or the basis {|χ ^± > ,|ω ^± > } is chosen by Alice and Bob based on the predetermined value to measure the particle pairs. And three bits of secret inputs can be compared in this protocol in every comparison time, while most of previous QPC protocols can only compare one or two bits. The qubit efficiency of this protocol is 60% more than others, which are 50% at most. Secondly, if the eavesdropper intends to obtain the secret inputs, it is important and primary to get the measurement results of particle pairs. In this protocol, even if the eavesdropper gets the accurate particle pairs, he cannot get the right measurement results without the right basis. Finally, this protocol is analyzed to be able to defend the secret inputs against various kinds of attack.

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.

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.

Impersonation attack on a quantum secure direct communication and authentication protocol with improvement

NASA Astrophysics Data System (ADS)

Amerimehr, Ali; Hadain Dehkordi, Massoud

2018-03-01

We analyze the security of a quantum secure direct communication and authentication protocol based on single photons. We first give an impersonation attack on the protocol. The cryptanalysis shows that there is a gap in the authentication procedure of the protocol so that an opponent can reveal the secret information by an undetectable attempt. We then propose an improvement for the protocol and show it closes the gap by applying a mutual authentication procedure. In the improved protocol single photons are transmitted once in a session, so it is easy to implement as the primary protocol. Furthermore, we use a novel technique for secret order rearrangement of photons by which not only quantum storage is eliminated also a secret key can be reused securely. So the new protocol is applicable in practical approaches like embedded system devices.

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

The Quantum Steganography Protocol via Quantum Noisy Channels

NASA Astrophysics Data System (ADS)

Wei, Zhan-Hong; Chen, Xiu-Bo; Niu, Xin-Xin; Yang, Yi-Xian

2015-08-01

As a promising branch of quantum information hiding, Quantum steganography aims to transmit secret messages covertly in public quantum channels. But due to environment noise and decoherence, quantum states easily decay and change. Therefore, it is very meaningful to make a quantum information hiding protocol apply to quantum noisy channels. In this paper, we make the further research on a quantum steganography protocol for quantum noisy channels. The paper proved that the protocol can apply to transmit secret message covertly in quantum noisy channels, and explicity showed quantum steganography protocol. In the protocol, without publishing the cover data, legal receivers can extract the secret message with a certain probability, which make the protocol have a good secrecy. Moreover, our protocol owns the independent security, and can be used in general quantum communications. The communication, which happen in our protocol, do not need entangled states, so our protocol can be used without the limitation of entanglement resource. More importantly, the protocol apply to quantum noisy channels, and can be used widely in the future quantum communication.

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

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.

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.

Controlled Bidirectional Quantum Secure Direct Communication

PubMed Central

Chou, Yao-Hsin; Lin, Yu-Ting; Zeng, Guo-Jyun; Lin, Fang-Jhu; Chen, Chi-Yuan

2014-01-01

We propose a novel protocol for controlled bidirectional quantum secure communication based on a nonlocal swap gate scheme. Our proposed protocol would be applied to a system in which a controller (supervisor/Charlie) controls the bidirectional communication with quantum information or secret messages between legitimate users (Alice and Bob). In this system, the legitimate users must obtain permission from the controller in order to exchange their respective quantum information or secret messages simultaneously; the controller is unable to obtain any quantum information or secret messages from the decoding process. Moreover, the presence of the controller also avoids the problem of one legitimate user receiving the quantum information or secret message before the other, and then refusing to help the other user decode the quantum information or secret message. Our proposed protocol is aimed at protecting against external and participant attacks on such a system, and the cost of transmitting quantum bits using our protocol is less than that achieved in other studies. Based on the nonlocal swap gate scheme, the legitimate users exchange their quantum information or secret messages without transmission in a public channel, thus protecting against eavesdroppers stealing the secret messages. PMID:25006596

Threshold secret sharing scheme based on phase-shifting interferometry.

PubMed

Deng, Xiaopeng; Shi, Zhengang; Wen, Wei

2016-11-01

We propose a new method for secret image sharing with the (3,N) threshold scheme based on phase-shifting interferometry. The secret image, which is multiplied with an encryption key in advance, is first encrypted by using Fourier transformation. Then, the encoded image is shared into N shadow images based on the recording principle of phase-shifting interferometry. Based on the reconstruction principle of phase-shifting interferometry, any three or more shadow images can retrieve the secret image, while any two or fewer shadow images cannot obtain any information of the secret image. Thus, a (3,N) threshold secret sharing scheme can be implemented. Compared with our previously reported method, the algorithm of this paper is suited for not only a binary image but also a gray-scale image. Moreover, the proposed algorithm can obtain a larger threshold value t. Simulation results are presented to demonstrate the feasibility of the proposed method.

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.

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 %.

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.

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

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).

Quantum protocols within Spekkens' toy model

NASA Astrophysics Data System (ADS)

Disilvestro, Leonardo; Markham, Damian

2017-05-01

Quantum mechanics is known to provide significant improvements in information processing tasks when compared to classical models. These advantages range from computational speedups to security improvements. A key question is where these advantages come from. The toy model developed by Spekkens [R. W. Spekkens, Phys. Rev. A 75, 032110 (2007), 10.1103/PhysRevA.75.032110] mimics many of the features of quantum mechanics, such as entanglement and no cloning, regarded as being important in this regard, despite being a local hidden variable theory. In this work, we study several protocols within Spekkens' toy model where we see it can also mimic the advantages and limitations shown in the quantum case. We first provide explicit proofs for the impossibility of toy bit commitment and the existence of a toy error correction protocol and consequent k -threshold secret sharing. Then, defining a toy computational model based on the quantum one-way computer, we prove the existence of blind and verified protocols. Importantly, these two last quantum protocols are known to achieve a better-than-classical security. Our results suggest that such quantum improvements need not arise from any Bell-type nonlocality or contextuality, but rather as a consequence of steering correlations.

Variable-bias coin tossing

NASA Astrophysics Data System (ADS)

Colbeck, Roger; Kent, Adrian

2006-03-01

Alice is a charismatic quantum cryptographer who believes her parties are unmissable; Bob is a (relatively) glamorous string theorist who believes he is an indispensable guest. To prevent possibly traumatic collisions of self-perception and reality, their social code requires that decisions about invitation or acceptance be made via a cryptographically secure variable-bias coin toss (VBCT). This generates a shared random bit by the toss of a coin whose bias is secretly chosen, within a stipulated range, by one of the parties; the other party learns only the random bit. Thus one party can secretly influence the outcome, while both can save face by blaming any negative decisions on bad luck. We describe here some cryptographic VBCT protocols whose security is guaranteed by quantum theory and the impossibility of superluminal signaling, setting our results in the context of a general discussion of secure two-party computation. We also briefly discuss other cryptographic applications of VBCT.

Secret Bit Transmission Using a Random Deal of Cards

DTIC Science & Technology

1990-05-01

conversation between sender and receiver is public and is heard by all. A correct protocol always succeeds in transmitting the secret bit, and the other player...s), who receive the remaining cards and are assumed to have unlimited computing power, gain no information whatsoever about the value of the secret bit...In other words, their probability of correctly guessing the secret is bit exactly the same after listening to a run of the protocol as it was

Distributed Noise Generation for Density Estimation Based Clustering without Trusted Third Party

NASA Astrophysics Data System (ADS)

Su, Chunhua; Bao, Feng; Zhou, Jianying; Takagi, Tsuyoshi; Sakurai, Kouichi

The rapid growth of the Internet provides people with tremendous opportunities for data collection, knowledge discovery and cooperative computation. However, it also brings the problem of sensitive information leakage. Both individuals and enterprises may suffer from the massive data collection and the information retrieval by distrusted parties. In this paper, we propose a privacy-preserving protocol for the distributed kernel density estimation-based clustering. Our scheme applies random data perturbation (RDP) technique and the verifiable secret sharing to solve the security problem of distributed kernel density estimation in [4] which assumed a mediate party to help in the computation.

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

Applying secret sharing for HIS backup exchange.

PubMed

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

2013-01-01

To secure business continuity is indispensable for hospitals to fulfill its social responsibility under disasters. Although to back up the data of the hospital information system (HIS) at multiple remote sites is a key strategy of business continuity plan (BCP), the requirements to treat privacy sensitive data jack up the cost for the backup. The secret sharing is a method to split an original secret message up so that each individual piece is meaningless, but putting sufficient number of pieces together to reveal the original message. The secret sharing method eases us to exchange HIS backups between multiple hospitals. This paper evaluated the feasibility of the commercial secret sharing solution for HIS backup through several simulations. The result shows that the commercial solution is feasible to realize reasonable HIS backup exchange platform when template of contract between participating hospitals is ready.

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.

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.

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.

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."

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.

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.

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.

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

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.

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.

Controlled quantum secure communication protocol with single photons in both polarization and spatial-mode degrees of freedom

NASA Astrophysics Data System (ADS)

Wang, Lili; Ma, Wenping

2016-02-01

In this paper, we propose a new controlled quantum secure direct communication (CQSDC) protocol with single photons in both polarization and spatial-mode degrees of freedom. Based on the defined local collective unitary operations, the sender’s secret messages can be transmitted directly to the receiver through encoding secret messages on the particles. Only with the help of the third side, the receiver can reconstruct the secret messages. Each single photon in two degrees of freedom can carry two bits of information, so the cost of our protocol is less than others using entangled qubits. Moreover, the security of our QSDC network protocol is discussed comprehensively. It is shown that our new CQSDC protocol cannot only defend the outsider eavesdroppers’ several sorts of attacks but also the inside attacks. Besides, our protocol is feasible since the preparation and the measurement of single photon quantum states in both the polarization and the spatial-mode degrees of freedom are available with current quantum techniques.

Quantum Teleportation of an Arbitrary N-qubit State via GHZ-like States

NASA Astrophysics Data System (ADS)

Zhang, Bo; Liu, Xing-tong; Wang, Jian; Tang, Chao-jing

2016-03-01

Recently Zhu (Int. J. Theor. Phys. 53, 4095, 2014) had shown that using GHZ-like states as quantum channel, it is possible to teleport an arbitrary unknown two-qubit state. We investigate this channel for the teleportation of an arbitrary N-qubit state. The strict proof through mathematical induction is presented and the rule for the receiver to reconstruct the desired state is explicitly derived in the most general case. We also discuss that if a system of quantum secret sharing of classical message is established, our protocol can be transformed to a N-qubit perfect controlled teleportation scheme from the controller's point of view.

Masking Quantum Information is Impossible

NASA Astrophysics Data System (ADS)

Modi, Kavan; Pati, Arun Kumar; SenDe, Aditi; Sen, Ujjwal

2018-06-01

Classical information encoded in composite quantum states can be completely hidden from the reduced subsystems and may be found only in the correlations. Can the same be true for quantum information? If quantum information is hidden from subsystems and spread over quantum correlation, we call it masking of quantum information. We show that while this may still be true for some restricted sets of nonorthogonal quantum states, it is not possible for arbitrary quantum states. This result suggests that quantum qubit commitment—a stronger version of the quantum bit commitment—is not possible in general. Our findings may have potential applications in secret sharing and future quantum communication protocols.

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.

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.

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.

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.

A new quantum sealed-bid auction protocol with secret order in post-confirmation

NASA Astrophysics Data System (ADS)

Wang, Jing-Tao; Chen, Xiu-Bo; Xu, Gang; Meng, Xiang-Hua; Yang, Yi-Xian

2015-10-01

A new security protocol for quantum sealed-bid auction is proposed to resist the collusion attack from some malicious bidders. The most significant feature of this protocol is that bidders prepare their particles with secret order in post-confirmation for encoding bids. In addition, a new theorem and its proof are given based on the theory of combinatorial mathematics, which can be used as evaluation criteria for the collusion attack. It is shown that the new protocol is immune to the collusion attack and meets the demand for a secure auction. Compared with those previous protocols, the security, efficiency and availability of the proposed protocol are largely improved.

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.

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.

(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.

The Classification of E-Authentication Protocols for Targeted Applicability

DTIC Science & Technology

2009-12-01

that the secret is only known to the Claimant and either the Verifier or Relying Party (V/RP), and serves as a form of identifier to the... secret against unauthorized observation. The protection of the secret is critical to prevent potential impersonation attacks. The secret is usually...confident that the Claimant is who he claims, if he is able to prove possession of this secret. 1. Symmetric vs. Asymmetric Secret The secret used by

Multiparty Quantum Direct Secret Sharing of Classical Information with Bell States and Bell Measurements

NASA Astrophysics Data System (ADS)

Song, Yun; Li, Yongming; Wang, Wenhua

2018-02-01

This paper proposed a new and efficient multiparty quantum direct secret sharing (QDSS) by using swapping quantum entanglement of Bell states. In the proposed scheme, the quantum correlation between the possible measurement results of the members (except dealer) and the original local unitary operation encoded by the dealer was presented. All agents only need to perform Bell measurements to share dealer's secret by recovering dealer's operation without performing any unitary operation. Our scheme has several advantages. The dealer is not required to retain any photons, and can further share a predetermined key instead of a random key to the agents. It has high capacity as two bits of secret messages can be transmitted by an EPR pair and the intrinsic efficiency approaches 100%, because no classical bit needs to be transmitted except those for detection. Without inserting any checking sets for detecting the eavesdropping, the scheme can resist not only the existing attacks, but also the cheating attack from the dishonest agent.

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

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.

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

PubMed Central

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

2016-01-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). PMID:27363566

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).

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.

A Comprehensive Comparison of Multiparty Secure Additions with Differential Privacy

PubMed Central

Goryczka, Slawomir; Xiong, Li

2016-01-01

This paper considers the problem of secure data aggregation (mainly summation) in a distributed setting, while ensuring differential privacy of the result. We study secure multiparty addition protocols using well known security schemes: Shamir’s secret sharing, perturbation-based, and various encryptions. We supplement our study with our new enhanced encryption scheme EFT, which is efficient and fault tolerant. Differential privacy of the final result is achieved by either distributed Laplace or Geometric mechanism (respectively DLPA or DGPA), while approximated differential privacy is achieved by diluted mechanisms. Distributed random noise is generated collectively by all participants, which draw random variables from one of several distributions: Gamma, Gauss, Geometric, or their diluted versions. We introduce a new distributed privacy mechanism with noise drawn from the Laplace distribution, which achieves smaller redundant noise with efficiency. We compare complexity and security characteristics of the protocols with different differential privacy mechanisms and security schemes. More importantly, we implemented all protocols and present an experimental comparison on their performance and scalability in a real distributed environment. Based on the evaluations, we identify our security scheme and Laplace DLPA as the most efficient for secure distributed data aggregation with privacy. PMID:28919841

A Comprehensive Comparison of Multiparty Secure Additions with Differential Privacy.

PubMed

Goryczka, Slawomir; Xiong, Li

2017-01-01

This paper considers the problem of secure data aggregation (mainly summation) in a distributed setting, while ensuring differential privacy of the result. We study secure multiparty addition protocols using well known security schemes: Shamir's secret sharing, perturbation-based, and various encryptions. We supplement our study with our new enhanced encryption scheme EFT, which is efficient and fault tolerant. Differential privacy of the final result is achieved by either distributed Laplace or Geometric mechanism (respectively DLPA or DGPA), while approximated differential privacy is achieved by diluted mechanisms. Distributed random noise is generated collectively by all participants, which draw random variables from one of several distributions: Gamma, Gauss, Geometric, or their diluted versions. We introduce a new distributed privacy mechanism with noise drawn from the Laplace distribution, which achieves smaller redundant noise with efficiency. We compare complexity and security characteristics of the protocols with different differential privacy mechanisms and security schemes. More importantly, we implemented all protocols and present an experimental comparison on their performance and scalability in a real distributed environment. Based on the evaluations, we identify our security scheme and Laplace DLPA as the most efficient for secure distributed data aggregation with privacy.

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.

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.

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.

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

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.

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.

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

Controlled Secure Direct Communication with Seven-Qubit Entangled States

NASA Astrophysics Data System (ADS)

Wang, Shu-Kai; Zha, Xin-Wei; Wu, Hao

2018-01-01

In this paper, a new controlled secure direct communication protocol based on a maximally seven-qubit entangled state is proposed. the outcomes of measurement is performed by the sender and the controller, the receiver can obtain different secret messages in a deterministic way with unit successful probability.In this scheme,by using entanglement swapping, no qubits carrying secret messages are transmitted.Therefore, the protocol is completely secure.

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.

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].

Measurement of gastric meal and secretion volumes using magnetic resonance imaging

PubMed Central

Hoad, C.L.; Parker, H.; Hudders, N.; Costigan, C.; Cox, E.F.; Perkins, A.C.; Blackshaw, P.E.; Marciani, L.; Spiller, R.C.; Fox, M.R.; Gowland, P.A.

2015-01-01

MRI can assess multiple gastric functions without ionizing radiation. However, time consuming image acquisition and analysis of gastric volume data, plus confounding of gastric emptying measurements by gastric secretions mixed with the test meal have limited its use to research centres. This study presents an MRI acquisition protocol and analysis algorithm suitable for the clinical measurement of gastric volume and secretion volume. Reproducibility of gastric volume measurements was assessed using data from 10 healthy volunteers following a liquid test meal with rapid MRI acquisition within one breath-hold and semi-automated analysis. Dilution of the ingested meal with gastric secretion was estimated using a respiratory-triggered T1 mapping protocol. Accuracy of the secretion volume measurements was assessed using data from 24 healthy volunteers following a mixed (liquid/solid) test meal with MRI meal volumes compared to data acquired using gamma scintigraphy (GS) on the same subjects studied on a separate study day. The mean (SD) coefficient of variance between 3 observers for both total gastric contents (including meal, secretions and air) and just the gastric contents (meal and secretion only) was 3 (2) % at large gastric volumes (> 200 ml). Mean (SD) secretion volumes post meal ingestion were 64 (51) ml and 110 (40) ml at 15 and 75 minutes respectively. Comparison with GS meal volumes, showed that MRI meal only volume (after correction for secretion volume) were similar to GS, with a linear regression gradient (std err) of 1.06 (0.10) and intercept −11 (24) ml. In conclusion, (i) rapid acquisition removed the requirement to image during prolonged breath-hold (ii) semi-automatic analysis greatly reduced time required to derive measurements and (iii) correction for secretion volumes provides accurate assessment of gastric meal volumes and emptying. Together these features provide the scientific basis of a protocol which would be suitable in clinical practice. PMID:25592405

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.

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.

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

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

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.

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.

Deterministic Secure Quantum Communication and Authentication Protocol based on Extended GHZ-W State and Quantum One-time Pad

NASA Astrophysics Data System (ADS)

Li, Na; Li, Jian; Li, Lei-Lei; Wang, Zheng; Wang, Tao

2016-08-01

A deterministic secure quantum communication and authentication protocol based on extended GHZ-W state and quantum one-time pad is proposed. In the protocol, state | φ -> is used as the carrier. One photon of | φ -> state is sent to Alice, and Alice obtains a random key by measuring photons with bases determined by ID. The information of bases is secret to others except Alice and Bob. Extended GHZ-W states are used as decoy photons, the positions of which in information sequence are encoded with identity string ID of the legal user, and the eavesdropping detection rate reaches 81%. The eavesdropping detection based on extended GHZ-W state combines with authentication and the secret ID ensures the security of the protocol.

Purification of FLAG-tagged Secreted Proteins from Mammalian Cells

PubMed Central

Itakura, Eisuke; Chen, Changchun; de Bono, Mario

2017-01-01

This protocol describes a method for purifying glycosylated FLAG-tagged secreted proteins with disulfide bonds from mammalian cells. The purified products can be used for various applications, such as ligand binding assays. PMID:29075655

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.

Basal measures of insulin sensitivity and insulin secretion and simplified glucose tolerance tests in dogs.

PubMed

Verkest, K R; Fleeman, L M; Rand, J S; Morton, J M

2010-10-01

There is need for simple, inexpensive measures of glucose tolerance, insulin sensitivity, and insulin secretion in dogs. The aim of this study was to estimate the closeness of correlation between fasting and dynamic measures of insulin sensitivity and insulin secretion, the precision of fasting measures, and the agreement between results of standard and simplified glucose tolerance tests in dogs. A retrospective descriptive study using 6 naturally occurring obese and 6 lean dogs was conducted. Data from frequently sampled intravenous glucose tolerance tests (FSIGTTs) in 6 obese and 6 lean client-owned dogs were used to calculate HOMA, QUICKI, fasting glucose and insulin concentrations. Fasting measures of insulin sensitivity and secretion were compared with MINMOD analysis of FSIGTTs using Pearson correlation coefficients, and they were evaluated for precision by the discriminant ratio. Simplified sampling protocols were compared with standard FSIGTTs using Lin's concordance correlation coefficients, limits of agreement, and Pearson correlation coefficients. All fasting measures except fasting plasma glucose concentration were moderately correlated with MINMOD-estimated insulin sensitivity (|r| = 0.62-0.80; P < 0.03), and those that combined fasting insulin and glucose were moderately closely correlated with MINMOD-estimated insulin secretion (r = 0.60-0.79; P < 0.04). HOMA calculated using the nonlinear formulae had the closest estimated correlation (r = 0.77 and 0.74) and the best discrimination for insulin sensitivity and insulin secretion (discriminant ratio 4.4 and 3.4, respectively). Simplified sampling protocols with half as many samples collected over 3 h had close agreement with the full sampling protocol. Fasting measures and simplified intravenous glucose tolerance tests reflect insulin sensitivity and insulin secretion derived from frequently sampled glucose tolerance tests with MINMOD analysis in dogs. Copyright 2010 Elsevier Inc. All rights reserved.

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.

Double C-NOT attack and counterattack on `Three-step semi-quantum secure direct communication protocol'

NASA Astrophysics Data System (ADS)

Gu, Jun; Lin, Po-hua; Hwang, Tzonelih

2018-07-01

Recently, Zou and Qiu (Sci China Phys Mech Astron 57:1696-1702, 2014) proposed a three-step semi-quantum secure direct communication protocol allowing a classical participant who does not have a quantum register to securely send his/her secret message to a quantum participant. However, this study points out that an eavesdropper can use the double C-NOT attack to obtain the secret message. To solve this problem, a modification is proposed.

Secure distributed genome analysis for GWAS and sequence comparison computation.

PubMed

Zhang, Yihua; Blanton, Marina; Almashaqbeh, Ghada

2015-01-01

The rapid increase in the availability and volume of genomic data makes significant advances in biomedical research possible, but sharing of genomic data poses challenges due to the highly sensitive nature of such data. To address the challenges, a competition for secure distributed processing of genomic data was organized by the iDASH research center. In this work we propose techniques for securing computation with real-life genomic data for minor allele frequency and chi-squared statistics computation, as well as distance computation between two genomic sequences, as specified by the iDASH competition tasks. We put forward novel optimizations, including a generalization of a version of mergesort, which might be of independent interest. We provide implementation results of our techniques based on secret sharing that demonstrate practicality of the suggested protocols and also report on performance improvements due to our optimization techniques. This work describes our techniques, findings, and experimental results developed and obtained as part of iDASH 2015 research competition to secure real-life genomic computations and shows feasibility of securely computing with genomic data in practice.

Secure distributed genome analysis for GWAS and sequence comparison computation

PubMed Central

2015-01-01

Background The rapid increase in the availability and volume of genomic data makes significant advances in biomedical research possible, but sharing of genomic data poses challenges due to the highly sensitive nature of such data. To address the challenges, a competition for secure distributed processing of genomic data was organized by the iDASH research center. Methods In this work we propose techniques for securing computation with real-life genomic data for minor allele frequency and chi-squared statistics computation, as well as distance computation between two genomic sequences, as specified by the iDASH competition tasks. We put forward novel optimizations, including a generalization of a version of mergesort, which might be of independent interest. Results We provide implementation results of our techniques based on secret sharing that demonstrate practicality of the suggested protocols and also report on performance improvements due to our optimization techniques. Conclusions This work describes our techniques, findings, and experimental results developed and obtained as part of iDASH 2015 research competition to secure real-life genomic computations and shows feasibility of securely computing with genomic data in practice. PMID:26733307

Intercept-Resend-Measure Attack Towards Quantum Private Comparison Protocol Using Genuine Four-Particle Entangled States and its Improvement

NASA Astrophysics Data System (ADS)

Pan, Hong-Ming

2018-03-01

Recently, Jia et al. proposed the quantum private comparison protocol with the genuine four-particle entangled states (Jia et al., Int. J. Theor. Phys. 51(4), 1187-1194 (2012)). Jia et al. claimed that in this protocol, TP cannot obtain Alice and Bob's secrets and only knows their comparison result. However, in this paper, we demonstrate that if TP is a genuine semi-honest third party, he can totally obtain Alice and Bob's secrets by launching a particular intercept-resend-measure attack. After suggesting the intercept-resend-measure attack strategy from TP first, we put forward one corresponding improvement to prevent this attack.

Measurement of gastric meal and secretion volumes using magnetic resonance imaging

NASA Astrophysics Data System (ADS)

Hoad, C. L.; Parker, H.; Hudders, N.; Costigan, C.; Cox, E. F.; Perkins, A. C.; Blackshaw, P. E.; Marciani, L.; Spiller, R. C.; Fox, M. R.; Gowland, P. A.

2015-02-01

MRI can assess multiple gastric functions without ionizing radiation. However, time consuming image acquisition and analysis of gastric volume data, plus confounding of gastric emptying measurements by gastric secretions mixed with the test meal have limited its use to research centres. This study presents an MRI acquisition protocol and analysis algorithm suitable for the clinical measurement of gastric volume and secretion volume. Reproducibility of gastric volume measurements was assessed using data from 10 healthy volunteers following a liquid test meal with rapid MRI acquisition within one breath-hold and semi-automated analysis. Dilution of the ingested meal with gastric secretion was estimated using a respiratory-triggered T1 mapping protocol. Accuracy of the secretion volume measurements was assessed using data from 24 healthy volunteers following a mixed (liquid/solid) test meal with MRI meal volumes compared to data acquired using gamma scintigraphy (GS) on the same subjects studied on a separate study day. The mean ± SD coefficient of variance between 3 observers for both total gastric contents (including meal, secretions and air) and just the gastric contents (meal and secretion only) was 3  ±  2% at large gastric volumes (>200 ml). Mean ± SD secretion volumes post meal ingestion were 64  ±  51 ml and 110  ±  40 ml at 15 and 75 min, respectively. Comparison with GS meal volumes, showed that MRI meal only volume (after correction for secretion volume) were similar to GS, with a linear regression gradient ± std err of 1.06  ±  0.10 and intercept -11  ±  24 ml. In conclusion, (i) rapid volume acquisition and respiratory triggered T1 mapping removed the requirement to image during prolonged breath-holds (ii) semi-automatic analysis greatly reduced the time required to derive measurements and (iii) correction for secretion volumes provided accurate assessment of gastric meal volumes and emptying. Together these features provide the scientific basis of a protocol which would be suitable in clinical practice.

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.

The Native Plant Propagation Protocol Database: 16 years of sharing information

Treesearch

R. Kasten Dumroese; Thomas D. Landis

2016-01-01

The Native Plant Propagation Protocol Database was launched in 2001 to provide an online mechanism for sharing information about growing native plants. It relies on plant propagators to upload their protocols (detailed directions for growing particular native plants) so that others may benefit from their experience. Currently the database has nearly 3000 protocols and...

A Study of Shared-Memory Mutual Exclusion Protocols Using CADP

NASA Astrophysics Data System (ADS)

Mateescu, Radu; Serwe, Wendelin

Mutual exclusion protocols are an essential building block of concurrent systems: indeed, such a protocol is required whenever a shared resource has to be protected against concurrent non-atomic accesses. Hence, many variants of mutual exclusion protocols exist in the shared-memory setting, such as Peterson's or Dekker's well-known protocols. Although the functional correctness of these protocols has been studied extensively, relatively little attention has been paid to their non-functional aspects, such as their performance in the long run. In this paper, we report on experiments with the performance evaluation of mutual exclusion protocols using Interactive Markov Chains. Steady-state analysis provides an additional criterion for comparing protocols, which complements the verification of their functional properties. We also carefully re-examined the functional properties, whose accurate formulation as temporal logic formulas in the action-based setting turns out to be quite involved.

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.

ShareSync: A Solution for Deterministic Data Sharing over Ethernet

NASA Technical Reports Server (NTRS)

Dunn, Daniel J., II; Koons, William A.; Kennedy, Richard D.; Davis, Philip A.

2007-01-01

As part of upgrading the Contact Dynamics Simulation Laboratory (CDSL) at the NASA Marshall Space Flight Center (MSFC), a simple, cost effective method was needed to communicate data among the networked simulation machines and I/O controllers used to run the facility. To fill this need and similar applicable situations, a generic protocol was developed, called ShareSync. ShareSync is a lightweight, real-time, publish-subscribe Ethernet protocol for simple and deterministic data sharing across diverse machines and operating systems. ShareSync provides a simple Application Programming Interface (API) for simulation programmers to incorporate into their code. The protocol is compatible with virtually all Ethernet-capable machines, is flexible enough to support a variety of applications, is fast enough to provide soft real-time determinism, and is a low-cost resource for distributed simulation development, deployment, and maintenance. The first design cycle iteration of ShareSync has been completed, and the protocol has undergone several testing procedures including endurance and benchmarking tests and approaches the 2001ts data synchronization design goal for the CDSL.

Multi-Party Quantum Private Comparison Protocol Based on Entanglement Swapping of Bell Entangled States

NASA Astrophysics Data System (ADS)

Ye, Tian-Yu

2016-09-01

Recently, Liu et al. proposed a two-party quantum private comparison (QPC) protocol using entanglement swapping of Bell entangled state (Commun. Theor. Phys. 57 (2012) 583). Subsequently Liu et al. pointed out that in Liu et al.'s protocol, the TP can extract the two users' secret inputs without being detected by launching the Bell-basis measurement attack, and suggested the corresponding improvement to mend this loophole (Commun. Theor. Phys. 62 (2014) 210). In this paper, we first point out the information leakage problem toward TP existing in both of the above two protocols, and then suggest the corresponding improvement by using the one-way hash function to encrypt the two users' secret inputs. We further put forward the three-party QPC protocol also based on entanglement swapping of Bell entangled state, and then validate its output correctness and its security in detail. Finally, we generalize the three-party QPC protocol into the multi-party case, which can accomplish arbitrary pair's comparison of equality among K users within one execution. Supported by the National Natural Science Foundation of China under Grant No. 61402407

Cryptanalysis of the Quantum Private Comparison Protocol Based on the Entanglement Swapping Between Three-Particle W-Class State and Bell State

NASA Astrophysics Data System (ADS)

Gao, Xiang; Zhang, Shi-Bin; Chang, Yan; Yang, Fan; Zhang, Yan

2018-02-01

Recently, Li et al. (Int. J. Theor. Phys. 55, 1710-1718, 2016) proposed a Quantum Private Comparison (QPC) protocol based on the Entanglement Swapping Between Three-Particle W-Class State and Bell State. Two parties can check whether their secret information is equal or not with the help of the semi-honest third party (TP). However in this paper, we will point out this kind of semi-honest TP is unreasonable. If we relax the constraint of the semi-honest TP, by using the fake signal attack, TP can know the whole secret information illegally. At last, we give our improvement, which can make this protocol more secure.

Cryptanalysis of the Quantum Private Comparison Protocol Based on the Entanglement Swapping Between Three-Particle W-Class State and Bell State

NASA Astrophysics Data System (ADS)

Gao, Xiang; Zhang, Shi-Bin; Chang, Yan; Yang, Fan; Zhang, Yan

2018-06-01

Recently, Li et al. (Int. J. Theor. Phys. 55, 1710-1718, 2016) proposed a Quantum Private Comparison (QPC) protocol based on the Entanglement Swapping Between Three-Particle W-Class State and Bell State. Two parties can check whether their secret information is equal or not with the help of the semi-honest third party (TP). However in this paper, we will point out this kind of semi-honest TP is unreasonable. If we relax the constraint of the semi-honest TP, by using the fake signal attack, TP can know the whole secret information illegally. At last, we give our improvement, which can make this protocol more secure.

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

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.

Multimode entanglement in reconfigurable graph states using optical frequency combs

PubMed Central

Cai, Y.; Roslund, J.; Ferrini, G.; Arzani, F.; Xu, X.; Fabre, C.; Treps, N.

2017-01-01

Multimode entanglement is an essential resource for quantum information processing and quantum metrology. However, multimode entangled states are generally constructed by targeting a specific graph configuration. This yields to a fixed experimental setup that therefore exhibits reduced versatility and scalability. Here we demonstrate an optical on-demand, reconfigurable multimode entangled state, using an intrinsically multimode quantum resource and a homodyne detection apparatus. Without altering either the initial squeezing source or experimental architecture, we realize the construction of thirteen cluster states of various sizes and connectivities as well as the implementation of a secret sharing protocol. In particular, this system enables the interrogation of quantum correlations and fluctuations for any multimode Gaussian state. This initiates an avenue for implementing on-demand quantum information processing by only adapting the measurement process and not the experimental layout. PMID:28585530

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.

Efficient generation of monoclonal antibodies from single rhesus macaque antibody secreting cells.

PubMed

Meng, Weixu; Li, Leike; Xiong, Wei; Fan, Xuejun; Deng, Hui; Bett, Andrew J; Chen, Zhifeng; Tang, Aimin; Cox, Kara S; Joyce, Joseph G; Freed, Daniel C; Thoryk, Elizabeth; Fu, Tong-Ming; Casimiro, Danilo R; Zhang, Ningyan; A Vora, Kalpit; An, Zhiqiang

2015-01-01

Nonhuman primates (NHPs) are used as a preclinical model for vaccine development, and the antibody profiles to experimental vaccines in NHPs can provide critical information for both vaccine design and translation to clinical efficacy. However, an efficient protocol for generating monoclonal antibodies from single antibody secreting cells of NHPs is currently lacking. In this study we established a robust protocol for cloning immunoglobulin (IG) variable domain genes from single rhesus macaque (Macaca mulatta) antibody secreting cells. A sorting strategy was developed using a panel of molecular markers (CD3, CD19, CD20, surface IgG, intracellular IgG, CD27, Ki67 and CD38) to identify the kinetics of B cell response after vaccination. Specific primers for the rhesus macaque IG genes were designed and validated using cDNA isolated from macaque peripheral blood mononuclear cells. Cloning efficiency was averaged at 90% for variable heavy (VH) and light (VL) domains, and 78.5% of the clones (n = 335) were matched VH and VL pairs. Sequence analysis revealed that diverse IGHV subgroups (for VH) and IGKV and IGLV subgroups (for VL) were represented in the cloned antibodies. The protocol was tested in a study using an experimental dengue vaccine candidate. About 26.6% of the monoclonal antibodies cloned from the vaccinated rhesus macaques react with the dengue vaccine antigens. These results validate the protocol for cloning monoclonal antibodies in response to vaccination from single macaque antibody secreting cells, which have general applicability for determining monoclonal antibody profiles in response to other immunogens or vaccine studies of interest in NHPs.

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.

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.

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.

Secure multi-party quantum summation based on quantum Fourier transform

NASA Astrophysics Data System (ADS)

Yang, Hui-Yi; Ye, Tian-Yu

2018-06-01

In this paper, we propose a novel secure multi-party quantum summation protocol based on quantum Fourier transform, where the traveling particles are transmitted in a tree-type mode. The party who prepares the initial quantum states is assumed to be semi-honest, which means that she may misbehave on her own but will not conspire with anyone. The proposed protocol can resist both the outside attacks and the participant attacks. Especially, one party cannot obtain other parties' private integer strings; and it is secure for the colluding attack performed by at most n - 2 parties, where n is the number of parties. In addition, the proposed protocol calculates the addition of modulo d and implements the calculation of addition in a secret-by-secret way rather than a bit-by-bit way.

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

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.

Commercial levels of chymosin production by Aspergillus.

PubMed

Dunn-Coleman, N S; Bloebaum, P; Berka, R M; Bodie, E; Robinson, N; Armstrong, G; Ward, M; Przetak, M; Carter, G L; LaCost, R

1991-10-01

We have increased the production of bovine chymosin in Aspergillus niger var. awamori to more than one gram per liter of secreted authentic enzyme by combining a mutagenesis protocol with a novel robotic screening program. Analysis of the superior chymosin producing strains indicated that they have enhanced capabilities to secrete extracellular proteins.

Practical scheme to share a secret key through a quantum channel with a 27.6% bit error rate

NASA Astrophysics Data System (ADS)

Chau, H. F.

2002-12-01

A secret key shared through quantum key distribution between two cooperative players is secure against any eavesdropping attack allowed by the laws of physics. Yet, such a key can be established only when the quantum channel error rate due to eavesdropping or imperfect apparatus is low. Here, a practical quantum key distribution scheme by making use of an adaptive privacy amplification procedure with two-way classical communication is reported. Then, it is proven that the scheme generates a secret key whenever the bit error rate of the quantum channel is less than 0.5-0.1(5)≈27.6%, thereby making it the most error resistant scheme known to date.

Implementation and evaluation of an efficient secure computation system using ‘R’ for healthcare statistics

PubMed Central

Chida, Koji; Morohashi, Gembu; Fuji, Hitoshi; Magata, Fumihiko; Fujimura, Akiko; Hamada, Koki; Ikarashi, Dai; Yamamoto, Ryuichi

2014-01-01

Background and objective While the secondary use of medical data has gained attention, its adoption has been constrained due to protection of patient privacy. Making medical data secure by de-identification can be problematic, especially when the data concerns rare diseases. We require rigorous security management measures. Materials and methods Using secure computation, an approach from cryptography, our system can compute various statistics over encrypted medical records without decrypting them. An issue of secure computation is that the amount of processing time required is immense. We implemented a system that securely computes healthcare statistics from the statistical computing software ‘R’ by effectively combining secret-sharing-based secure computation with original computation. Results Testing confirmed that our system could correctly complete computation of average and unbiased variance of approximately 50 000 records of dummy insurance claim data in a little over a second. Computation including conditional expressions and/or comparison of values, for example, t test and median, could also be correctly completed in several tens of seconds to a few minutes. Discussion If medical records are simply encrypted, the risk of leaks exists because decryption is usually required during statistical analysis. Our system possesses high-level security because medical records remain in encrypted state even during statistical analysis. Also, our system can securely compute some basic statistics with conditional expressions using ‘R’ that works interactively while secure computation protocols generally require a significant amount of processing time. Conclusions We propose a secure statistical analysis system using ‘R’ for medical data that effectively integrates secret-sharing-based secure computation and original computation. PMID:24763677

Implementation and evaluation of an efficient secure computation system using 'R' for healthcare statistics.

PubMed

Chida, Koji; Morohashi, Gembu; Fuji, Hitoshi; Magata, Fumihiko; Fujimura, Akiko; Hamada, Koki; Ikarashi, Dai; Yamamoto, Ryuichi

2014-10-01

While the secondary use of medical data has gained attention, its adoption has been constrained due to protection of patient privacy. Making medical data secure by de-identification can be problematic, especially when the data concerns rare diseases. We require rigorous security management measures. Using secure computation, an approach from cryptography, our system can compute various statistics over encrypted medical records without decrypting them. An issue of secure computation is that the amount of processing time required is immense. We implemented a system that securely computes healthcare statistics from the statistical computing software 'R' by effectively combining secret-sharing-based secure computation with original computation. Testing confirmed that our system could correctly complete computation of average and unbiased variance of approximately 50,000 records of dummy insurance claim data in a little over a second. Computation including conditional expressions and/or comparison of values, for example, t test and median, could also be correctly completed in several tens of seconds to a few minutes. If medical records are simply encrypted, the risk of leaks exists because decryption is usually required during statistical analysis. Our system possesses high-level security because medical records remain in encrypted state even during statistical analysis. Also, our system can securely compute some basic statistics with conditional expressions using 'R' that works interactively while secure computation protocols generally require a significant amount of processing time. We propose a secure statistical analysis system using 'R' for medical data that effectively integrates secret-sharing-based secure computation and original computation. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://group.bmj.com/group/rights-licensing/permissions.

A note on the security of IS-RFID, an inpatient medication safety.

PubMed

Safkhani, Masoumeh; Bagheri, Nasour; Naderi, Majid

2014-01-01

In this paper we investigate the security level of a comprehensive RFID solution to enhance inpatient medication safety, named IS-RFID, which has been recently proposed by Peris-Lopez et al. We analyses the security of the protocol against the known attacks in the context. The main target of this paper is to determine whether the new protocol provides the confidentiality property, which is expected to be provided by such a protocol. It was found that IS-RFID has critical weaknesses. The presented security investigations show that a passive adversary can retrieve secret parameters of patient's tag in cost of O(2(16)) off-line PRNG evaluations. Given the tag's secret parameters, any security claims are ruined. In this paper we presented an efficient passive secret disclosure attack which retrieves the main secret parameters related to the patient which shows that IS-RFID may put the patient safety on risk. The proposed attacking technique is in light of two vulnerabilities of the protocol: (1) the short length of the used PRNG, which is urged by the target technology, EPC C1 Gen2 ; (2) the message-generating mechanism utilizing PRNG was not carefully scrutinized. While the later point can be fixed by careful designing of the transferred messages between the protocol's party, the earlier point, i.e., the short length of the available PRNG for EPC C1 Gen2 tags, is a limitation which is forced by the technology. In addition, over the last years, schemes based solely on using simple operations or short PRNG (such as IS-RFID) have been shown to offer very low or no security at all. Recent advances in lightweight ciphers, such as PRESENT or Grain , seem a much more appropriate solution rather than relying on short PRNGs. However, such solutions breaks the EPC C1 Gen2 compatibility. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.

The US Culture Collection Network responding to the requirements of the Nagoya Protocol on Access and Benefit Sharing

USDA-ARS?s Scientific Manuscript database

The US Culture Collection Network held a meeting to share information about how collections are responding to the requirements of the recently enacted Nagoya Protocol on Access to Genetic Resources and the Fair and Equitable Sharing of Benefits Arising from their Utilization to the Convention on Bio...

Secret shared multiple-image encryption based on row scanning compressive ghost imaging and phase retrieval in the Fresnel domain

NASA Astrophysics Data System (ADS)

Li, Xianye; Meng, Xiangfeng; Wang, Yurong; Yang, Xiulun; Yin, Yongkai; Peng, Xiang; He, Wenqi; Dong, Guoyan; Chen, Hongyi

2017-09-01

A multiple-image encryption method is proposed that is based on row scanning compressive ghost imaging, (t, n) threshold secret sharing, and phase retrieval in the Fresnel domain. In the encryption process, after wavelet transform and Arnold transform of the target image, the ciphertext matrix can be first detected using a bucket detector. Based on a (t, n) threshold secret sharing algorithm, the measurement key used in the row scanning compressive ghost imaging can be decomposed and shared into two pairs of sub-keys, which are then reconstructed using two phase-only mask (POM) keys with fixed pixel values, placed in the input plane and transform plane 2 of the phase retrieval scheme, respectively; and the other POM key in the transform plane 1 can be generated and updated by the iterative encoding of each plaintext image. In each iteration, the target image acts as the input amplitude constraint in the input plane. During decryption, each plaintext image possessing all the correct keys can be successfully decrypted by measurement key regeneration, compression algorithm reconstruction, inverse wavelet transformation, and Fresnel transformation. Theoretical analysis and numerical simulations both verify the feasibility of the proposed method.

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.

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

Aggregating quantum repeaters for the quantum internet

NASA Astrophysics Data System (ADS)

Azuma, Koji; Kato, Go

2017-09-01

The quantum internet holds promise for accomplishing quantum teleportation and unconditionally secure communication freely between arbitrary clients all over the globe, as well as the simulation of quantum many-body systems. For such a quantum internet protocol, a general fundamental upper bound on the obtainable entanglement or secret key has been derived [K. Azuma, A. Mizutani, and H.-K. Lo, Nat. Commun. 7, 13523 (2016), 10.1038/ncomms13523]. Here we consider its converse problem. In particular, we present a universal protocol constructible from any given quantum network, which is based on running quantum repeater schemes in parallel over the network. For arbitrary lossy optical channel networks, our protocol has no scaling gap with the upper bound, even based on existing quantum repeater schemes. In an asymptotic limit, our protocol works as an optimal entanglement or secret-key distribution over any quantum network composed of practical channels such as erasure channels, dephasing channels, bosonic quantum amplifier channels, and lossy optical channels.

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.

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.

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.

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 U.S. Culture Collection Network Responding to the Requirements of the Nagoya Protocol on Access and Benefit Sharing

Treesearch

Kevin McCluskey; Katharine B. Barker; Hazel A. Barton; Kyria Boundy-Mills; Daniel R. Brown; Jonathan A. Coddington; Kevin Cook; Philippe Desmeth; David Geiser; Jessie A. Glaeser; Stephanie Greene; Seogchan Kang; Michael W. Lomas; Ulrich Melcher; Scott E. Miller; David R. Nobles; Kristina J. Owens; Jerome H. Reichman; Manuela da Silva; John Wertz; Cale Whitworth; David Smith; Steven E. Lindow

2017-01-01

The U.S. Culture Collection Network held a meeting to share information about how culture collections are responding to the requirements of the recently enacted Nagoya Protocol on Access to Genetic Resources and the Fair and Equitable Sharing of Benefits Arising from their Utilization to the Convention on Biological Diversity (CBD). The meeting included representatives...

A Secure Authenticated Key Exchange Protocol for Credential Services

NASA Astrophysics Data System (ADS)

Shin, Seonghan; Kobara, Kazukuni; Imai, Hideki

In this paper, we propose a leakage-resilient and proactive authenticated key exchange (called LRP-AKE) protocol for credential services which provides not only a higher level of security against leakage of stored secrets but also secrecy of private key with respect to the involving server. And we show that the LRP-AKE protocol is provably secure in the random oracle model with the reduction to the computational Difie-Hellman problem. In addition, we discuss about some possible applications of the LRP-AKE protocol.

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.

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

The [Un]Spoken Challenges of Administrator Collaboration: An Exploration of One District Leadership Team's Use of Protocols to Promote Reflection and Shared Theories of Action

ERIC Educational Resources Information Center

Szczesiul, Stacy Agee

2014-01-01

This article explores the use of protocol-structured dialogue in promoting reflective practices and shared theories of action within a district leadership team. Protocols have been used to make individuals' theories of action visible and subject to evaluation. This is important for leaders trying to establish coherence across a system; in…

Self-referenced continuous-variable quantum key distribution protocol

DOE PAGES

Soh, Daniel Beom Soo; Sarovar, Mohan; Brif, Constantin; ...

2015-10-21

We introduce a new continuous-variable quantum key distribution (CV-QKD) protocol, self-referenced CV-QKD, that eliminates the need for transmission of a high-power local oscillator between the communicating parties. In this protocol, each signal pulse is accompanied by a reference pulse (or a pair of twin reference pulses), used to align Alice’s and Bob’s measurement bases. The method of phase estimation and compensation based on the reference pulse measurement can be viewed as a quantum analog of intradyne detection used in classical coherent communication, which extracts the phase information from the modulated signal. We present a proof-of-principle, fiber-based experimental demonstration of themore » protocol and quantify the expected secret key rates by expressing them in terms of experimental parameters. Our analysis of the secret key rate fully takes into account the inherent uncertainty associated with the quantum nature of the reference pulse(s) and quantifies the limit at which the theoretical key rate approaches that of the respective conventional protocol that requires local oscillator transmission. The self-referenced protocol greatly simplifies the hardware required for CV-QKD, especially for potential integrated photonics implementations of transmitters and receivers, with minimum sacrifice of performance. Furthermore, it provides a pathway towards scalable integrated CV-QKD transceivers, a vital step towards large-scale QKD networks.« less

Self-referenced continuous-variable quantum key distribution protocol

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

Soh, Daniel Beom Soo; Sarovar, Mohan; Brif, Constantin

We introduce a new continuous-variable quantum key distribution (CV-QKD) protocol, self-referenced CV-QKD, that eliminates the need for transmission of a high-power local oscillator between the communicating parties. In this protocol, each signal pulse is accompanied by a reference pulse (or a pair of twin reference pulses), used to align Alice’s and Bob’s measurement bases. The method of phase estimation and compensation based on the reference pulse measurement can be viewed as a quantum analog of intradyne detection used in classical coherent communication, which extracts the phase information from the modulated signal. We present a proof-of-principle, fiber-based experimental demonstration of themore » protocol and quantify the expected secret key rates by expressing them in terms of experimental parameters. Our analysis of the secret key rate fully takes into account the inherent uncertainty associated with the quantum nature of the reference pulse(s) and quantifies the limit at which the theoretical key rate approaches that of the respective conventional protocol that requires local oscillator transmission. The self-referenced protocol greatly simplifies the hardware required for CV-QKD, especially for potential integrated photonics implementations of transmitters and receivers, with minimum sacrifice of performance. Furthermore, it provides a pathway towards scalable integrated CV-QKD transceivers, a vital step towards large-scale QKD networks.« less

Self-Referenced Continuous-Variable Quantum Key Distribution Protocol

NASA Astrophysics Data System (ADS)

Soh, Daniel B. S.; Brif, Constantin; Coles, Patrick J.; Lütkenhaus, Norbert; Camacho, Ryan M.; Urayama, Junji; Sarovar, Mohan

2015-10-01

We introduce a new continuous-variable quantum key distribution (CV-QKD) protocol, self-referenced CV-QKD, that eliminates the need for transmission of a high-power local oscillator between the communicating parties. In this protocol, each signal pulse is accompanied by a reference pulse (or a pair of twin reference pulses), used to align Alice's and Bob's measurement bases. The method of phase estimation and compensation based on the reference pulse measurement can be viewed as a quantum analog of intradyne detection used in classical coherent communication, which extracts the phase information from the modulated signal. We present a proof-of-principle, fiber-based experimental demonstration of the protocol and quantify the expected secret key rates by expressing them in terms of experimental parameters. Our analysis of the secret key rate fully takes into account the inherent uncertainty associated with the quantum nature of the reference pulse(s) and quantifies the limit at which the theoretical key rate approaches that of the respective conventional protocol that requires local oscillator transmission. The self-referenced protocol greatly simplifies the hardware required for CV-QKD, especially for potential integrated photonics implementations of transmitters and receivers, with minimum sacrifice of performance. As such, it provides a pathway towards scalable integrated CV-QKD transceivers, a vital step towards large-scale QKD networks.

Privacy-preserving photo sharing based on a public key infrastructure

NASA Astrophysics Data System (ADS)

Yuan, Lin; McNally, David; Küpçü, Alptekin; Ebrahimi, Touradj

2015-09-01

A significant number of pictures are posted to social media sites or exchanged through instant messaging and cloud-based sharing services. Most social media services offer a range of access control mechanisms to protect users privacy. As it is not in the best interest of many such services if their users restrict access to their shared pictures, most services keep users' photos unprotected which makes them available to all insiders. This paper presents an architecture for a privacy-preserving photo sharing based on an image scrambling scheme and a public key infrastructure. A secure JPEG scrambling is applied to protect regional visual information in photos. Protected images are still compatible with JPEG coding and therefore can be viewed by any one on any device. However, only those who are granted secret keys will be able to descramble the photos and view their original versions. The proposed architecture applies an attribute-based encryption along with conventional public key cryptography, to achieve secure transmission of secret keys and a fine-grained control over who may view shared photos. In addition, we demonstrate the practical feasibility of the proposed photo sharing architecture with a prototype mobile application, ProShare, which is built based on iOS platform.

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.

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

Multiprocessor shared-memory information exchange

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

Santoline, L.L.; Bowers, M.D.; Crew, A.W.

1989-02-01

In distributed microprocessor-based instrumentation and control systems, the inter-and intra-subsystem communication requirements ultimately form the basis for the overall system architecture. This paper describes a software protocol which addresses the intra-subsystem communications problem. Specifically the protocol allows for multiple processors to exchange information via a shared-memory interface. The authors primary goal is to provide a reliable means for information to be exchanged between central application processor boards (masters) and dedicated function processor boards (slaves) in a single computer chassis. The resultant Multiprocessor Shared-Memory Information Exchange (MSMIE) protocol, a standard master-slave shared-memory interface suitable for use in nuclear safety systems, ismore » designed to pass unidirectional buffers of information between the processors while providing a minimum, deterministic cycle time for this data exchange.« less

General A Scheme to Share Information via Employing Discrete Algorithm to Quantum States

NASA Astrophysics Data System (ADS)

Kang, Guo-Dong; Fang, Mao-Fa

2011-02-01

We propose a protocol for information sharing between two legitimate parties (Bob and Alice) via public-key cryptography. In particular, we specialize the protocol by employing discrete algorithm under mod that maps integers to quantum states via photon rotations. Based on this algorithm, we find that the protocol is secure under various classes of attacks. Specially, owe to the algorithm, the security of the classical privacy contained in the quantum public-key and the corresponding ciphertext is guaranteed. And the protocol is robust against the impersonation attack and the active wiretapping attack by designing particular checking processing, thus the protocol is valid.

Multi-party quantum key agreement protocol secure against collusion attacks

NASA Astrophysics Data System (ADS)

Wang, Ping; Sun, Zhiwei; Sun, Xiaoqiang

2017-07-01

The fairness of a secure multi-party quantum key agreement (MQKA) protocol requires that all involved parties are entirely peer entities and can equally influence the outcome of the protocol to establish a shared key wherein no one can decide the shared key alone. However, it is found that parts of the existing MQKA protocols are sensitive to collusion attacks, i.e., some of the dishonest participants can collaborate to predetermine the final key without being detected. In this paper, a multi-party QKA protocol resisting collusion attacks is proposed. Different from previous QKA protocol resisting N-1 coconspirators or resisting 1 coconspirators, we investigate the general circle-type MQKA protocol which can be secure against t dishonest participants' cooperation. Here, t < N. We hope the results of the presented paper will be helpful for further research on fair MQKA protocols.

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.

Quantum-key-distribution protocol with pseudorandom bases

NASA Astrophysics Data System (ADS)

Trushechkin, A. S.; Tregubov, P. A.; Kiktenko, E. O.; Kurochkin, Y. V.; Fedorov, A. K.

2018-01-01

Quantum key distribution (QKD) offers a way for establishing information-theoretical secure communications. An important part of QKD technology is a high-quality random number generator for the quantum-state preparation and for post-processing procedures. In this work, we consider a class of prepare-and-measure QKD protocols, utilizing additional pseudorandomness in the preparation of quantum states. We study one of such protocols and analyze its security against the intercept-resend attack. We demonstrate that, for single-photon sources, the considered protocol gives better secret key rates than the BB84 and the asymmetric BB84 protocols. However, the protocol strongly requires single-photon sources.

Systemic Free Fatty Acid Disposal Into Very Low-Density Lipoprotein Triglycerides

PubMed Central

Koutsari, Christina; Mundi, Manpreet S.; Ali, Asem H.; Patterson, Bruce W.; Jensen, Michael D.

2013-01-01

We measured the incorporation of systemic free fatty acids (FFA) into circulating very low-density lipoprotein triglycerides (VLDL-TGs) under postabsorptive, postprandial, and walking conditions in humans. Fifty-five men and 85 premenopausal women with BMI 18–24 (lean) and 27–36 kg/m2 (overweight/obese) received an intravenous bolus injection of [1,1,2,3,3-2H5]glycerol (to measure VLDL-TG kinetics) and either [1-14C]palmitate or [9,10-3H]palmitate to determine the proportion of systemic FFA that is converted to VLDL-TG. Experiments started at 0630 h after a 12-h overnight fast. In the postabsorptive protocol, participants rested and remained fasted until 1330 h. In the postprandial protocol, volunteers ingested frequent portions of a fat-free smoothie. In the walking protocol, participants walked on a treadmill for 5.5 h at ∼3× resting energy expenditure. Approximately 7% of circulating FFA was converted into VLDL-TG. VLDL-TG secretion rates (SRs) were not statistically different among protocols. Visceral fat mass was the only independent predictor of VLDL-TG secretion, explaining 33–57% of the variance. The small proportion of systemic FFA that is converted to VLDL-TG can confound the expected relationship between plasma FFA concentration and VLDL-TG SRs. Regulation of VLDL-TG secretion is complex in that, despite a broad spectrum of physiological FFA concentrations, VLDL-TG SRs did not vary based on different acute substrate availability. PMID:23434937

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.

Finite-key analysis for the 1-decoy state QKD protocol

NASA Astrophysics Data System (ADS)

Rusca, Davide; Boaron, Alberto; Grünenfelder, Fadri; Martin, Anthony; Zbinden, Hugo

2018-04-01

It has been shown that in the asymptotic case of infinite-key length, the 2-decoy state Quantum Key Distribution (QKD) protocol outperforms the 1-decoy state protocol. Here, we present a finite-key analysis of the 1-decoy method. Interestingly, we find that for practical block sizes of up to 108 bits, the 1-decoy protocol achieves for almost all experimental settings higher secret key rates than the 2-decoy protocol. Since using only one decoy is also easier to implement, we conclude that it is the best choice for QKD, in most common practical scenarios.

Cryptanalysis and Improvements for the Quantum Private Comparison Protocol Using EPR Pairs

NASA Astrophysics Data System (ADS)

Wang, Cong; Xu, Gang; Yang, Yi-Xian

2013-07-01

In this paper, we carry out an in-depth analysis of the quantum private comparison (QPC) protocol with the semi-honest third party (TP). The security of QPC protocol using the EPR pairs is re-examined. Unfortunately, we find that TP can use the fake EPR pairs to steal all the secret information. Furthermore, we give two simple and feasible solutions to improve the original QPC protocol. It is shown that the improved protocol is secure, which can resist various kinds of attacks from both the outside eavesdroppers and the inside participants, even the semi-honest TP.

An Improved Quantum Information Hiding Protocol Based on Entanglement Swapping of χ-type Quantum States

NASA Astrophysics Data System (ADS)

Xu, Shu-Jiang; Chen, Xiu-Bo; Wang, Lian-Hai; Ding, Qing-Yan; Zhang, Shu-Hui

2016-06-01

In 2011, Qu et al. proposed a quantum information hiding protocol based on the entanglement swapping of χ-type quantum states. Because a χ-type state can be described by the 4-particle cat states which have good symmetry, the possible output results of the entanglement swapping between a given χ-type state and all of the 16 χ-type states are divided into 8 groups instead of 16 groups of different results when the global phase is not considered. So it is difficult to read out the secret messages since each result occurs twice in each line (column) of the secret messages encoding rule for the original protocol. In fact, a 3-bit instead of a 4-bit secret message can be encoded by performing two unitary transformations on 2 particles of a χ-type quantum state in the original protocol. To overcome this defect, we propose an improved quantum information hiding protocol based on the general term formulas of the entanglement swapping among χ-type states. Supported by the National Natural Science Foundation of China under Grant Nos. 61572297, 61303199, 61272514, and 61373131, the Shandong Provincial Natural Science Foundation of China under Grant Nos. ZR2013FM025, ZR2013FQ001, ZR2014FM003, and ZY2015YL018, the Shandong Provincial Outstanding Research Award Fund for Young Scientists of China under Grant Nos. BS2015DX006 and BS2014DX007, the National Development Foundation for Cryptological Research, China under Grant No. MMJJ201401012, the Priority Academic Program Development of Jiangsu Higher Education Institutions and Jiangsu Collaborative Innovation Center on Atmospheric Environment and Equipment Technology Funds, and the Shandong Academy of Sciences Youth Fund Project, China under Grant Nos. 2015QN003 and 2013QN007

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.

SSeCloud: Using secret sharing scheme to secure keys

NASA Astrophysics Data System (ADS)

Hu, Liang; Huang, Yang; Yang, Disheng; Zhang, Yuzhen; Liu, Hengchang

2017-08-01

With the use of cloud storage services, one of the concerns is how to protect sensitive data securely and privately. While users enjoy the convenience of data storage provided by semi-trusted cloud storage providers, they are confronted with all kinds of risks at the same time. In this paper, we present SSeCloud, a secure cloud storage system that improves security and usability by applying secret sharing scheme to secure keys. The system encrypts uploading files on the client side and splits encrypted keys into three shares. Each of them is respectively stored by users, cloud storage providers and the alternative third trusted party. Any two of the parties can reconstruct keys. Evaluation results of prototype system show that SSeCloud provides high security without too much performance penalty.

Practicality of quantum information processing

NASA Astrophysics Data System (ADS)

Lau, Hoi-Kwan

Quantum Information Processing (QIP) is expected to bring revolutionary enhancement to various technological areas. However, today's QIP applications are far from being practical. The problem involves both hardware issues, i.e., quantum devices are imperfect, and software issues, i.e., the functionality of some QIP applications is not fully understood. Aiming to improve the practicality of QIP, in my PhD research I have studied various topics in quantum cryptography and ion trap quantum computation. In quantum cryptography, I first studied the security of position-based quantum cryptography (PBQC). I discovered a wrong assumption in the previous literature that the cheaters are not allowed to share entangled resources. I proposed entanglement attacks that could cheat all known PBQC protocols. I also studied the practicality of continuous-variable (CV) quantum secret sharing (QSS). While the security of CV QSS was considered by the literature only in the limit of infinite squeezing, I found that finitely squeezed CV resources could also provide finite secret sharing rate. Our work relaxes the stringent resources requirement of implementing QSS. In ion trap quantum computation, I studied the phase error of quantum information induced by dc Stark effect during ion transportation. I found an optimized ion trajectory for which the phase error is the minimum. I also defined a threshold speed, above which ion transportation would induce significant error. In addition, I proposed a new application for ion trap systems as universal bosonic simulators (UBS). I introduced two architectures, and discussed their respective strength and weakness. I illustrated the implementations of bosonic state initialization, transformation, and measurement by applying radiation fields or by varying the trap potential. When comparing with conducting optical experiments, the ion trap UBS is advantageous in higher state initialization efficiency and higher measurement accuracy. Finally, I proposed a new method to re-cool ion qubits during quantum computation. The idea is to transfer the motional excitation of a qubit to another ion that is prepared in the motional ground state. I showed that my method could be ten times faster than current laser cooling techniques, and thus could improve the speed of ion trap quantum computation.

Corps Operations

DTIC Science & Technology

2010-11-26

accomplishes these actions by developing, recommending, and briefing the scheme of fires, including both lethal fires and nonlethal actions (electronic...Install and operate the corps information technology help desk. Provide voice, video teleconference, e-mail—Non-Secure Internet Protocol Router...Network (NIPRNET), SECRET Internet Protocol Router Network (SIPRNET), and other communication networks—assistance, and other help desk functions

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.

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.

Development of Gonadotropin-Releasing Hormone-Secreting Neurons from Human Pluripotent Stem Cells.

PubMed

Lund, Carina; Pulli, Kristiina; Yellapragada, Venkatram; Giacobini, Paolo; Lundin, Karolina; Vuoristo, Sanna; Tuuri, Timo; Noisa, Parinya; Raivio, Taneli

2016-08-09

Gonadotropin-releasing hormone (GnRH) neurons regulate human puberty and reproduction. Modeling their development and function in vitro would be of interest for both basic research and clinical translation. Here, we report a three-step protocol to differentiate human pluripotent stem cells (hPSCs) into GnRH-secreting neurons. Firstly, hPSCs were differentiated to FOXG1, EMX2, and PAX6 expressing anterior neural progenitor cells (NPCs) by dual SMAD inhibition. Secondly, NPCs were treated for 10 days with FGF8, which is a key ligand implicated in GnRH neuron ontogeny, and finally, the cells were matured with Notch inhibitor to bipolar TUJ1-positive neurons that robustly expressed GNRH1 and secreted GnRH decapeptide into the culture medium. The protocol was reproducible both in human embryonic stem cells and induced pluripotent stem cells, and thus provides a translational tool for investigating the mechanisms of human puberty and its disorders. Copyright © 2016 The Author(s). Published by Elsevier Inc. All rights reserved.

A short protocol using dexamethasone and monophosphoryl lipid A generates tolerogenic dendritic cells that display a potent migratory capacity to lymphoid chemokines

PubMed Central

2013-01-01

Background Generation of tolerogenic dendritic cells (TolDCs) for therapy is challenging due to its implications for the design of protocols suitable for clinical applications, which means not only using safe products, but also working at defining specific biomarkers for TolDCs identification, developing shorter DCs differentiation methods and obtaining TolDCs with a stable phenotype. We describe here, a short-term protocol for TolDCs generation, which are characterized in terms of phenotypic markers, cytokines secretion profile, CD4+ T cell-stimulatory ability and migratory capacity. Methods TolDCs from healthy donors were generated by modulation with dexamethasone plus monophosphoryl lipid A (MPLA-tDCs). We performed an analysis of MPLA-tDCs in terms of yield, viability, morphology, phenotypic markers, cytokines secretion profile, stability, allogeneic and antigen-specific CD4+ T-cell stimulatory ability and migration capacity. Results After a 5-day culture, MPLA-tDCs displayed reduced expression of costimulatory and maturation molecules together to an anti-inflammatory cytokines secretion profile, being able to maintain these tolerogenic features even after the engagement of CD40 by its cognate ligand. In addition, MPLA-tDCs exhibited reduced capabilities to stimulate allogeneic and antigen-specific CD4+ T cell proliferation, and induced an anti-inflammatory cytokine secretion pattern. Among potential tolerogenic markers studied, only TLR-2 was highly expressed in MPLA-tDCs when compared to mature and immature DCs. Remarkable, like mature DCs, MPLA-tDCs displayed a high CCR7 and CXCR4 expression, both chemokine receptors involved in migration to secondary lymphoid organs, and even more, in an in vitro assay they exhibited a high migration response towards CCL19 and CXCL12. Conclusion We describe a short-term protocol for TolDC generation, which confers them a stable phenotype and migratory capacity to lymphoid chemokines, essential features for TolDCs to be used as therapeutics for autoimmunity and prevention of graft rejection. PMID:23706017

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.

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…

DWTP: a basis for networked VR on the Internet

NASA Astrophysics Data System (ADS)

Broll, Wolfgang; Schick, Daniel

1998-04-01

Shared virtual worlds are one of today's major research topics. While limited to particular application areas and high speed networks in the past, they become more and more available to a large number of users. One reason for this development was the introduction of VRML (the Virtual Reality Modeling Language), which has been established as a standard of the exchange of 3D worlds on the Internet. Although a number of prototype systems have been developed to realize shared multi-user worlds based on VRML, no suitable network protocol to support the demands of such environments has yet been established. In this paper we will introduce our approach of a network protocol for shared virtual environments: DWTP--the Distributed Worlds Transfer and communication Protocol. We will show how DWTP meets the demands of shared virtual environments on the Internet. We will further present SmallView, our prototype of a distributed multi-user VR system, to show how DWTP can be used to realize shared worlds.

Central peptidergic mechanisms controlling reproductive hormone secretion: novel methodology reveals a role for the natriuretic peptides.

PubMed

Samson, W K; Alexander, B D; Skala, K D; Huang, F L; Fulton, R J

1992-05-01

A variety of neural factors can influence reproductive hormone secretion by neuromodulatory actions within the hypothalamus or neuroendocrine actions within the anterior pituitary gland. Passive immunoneutralization and antagonist administration protocols have suggested physiological roles for a number of these factors; however, both experimental approaches have severe technical limitations. We have developed novel methodology utilizing cytotoxin cell targeting with neuropeptides linked to the toxic A chain of the plant cytotoxin ricin. With this methodology we can target and destroy in vivo or in vitro cells bearing receptors for that peptide. Ricin A chain conjugated to atrial natriuretic peptide (ANP), a neuropeptide known to pharmacologically inhibit luteinizing hormone-releasing hormone (LHRH) release, was injected into the cerebroventricular system of intact, cycling rats and ovariectomized rats. Cytotoxin conjugate treatment significantly lengthened the estrous cycle. In ovariectomized rats the luteinizing hormone surge induced by steroid priming was completely inhibited. LHRH content of the median eminences of these rats was not significantly altered. These data suggest that ANP binding to clearance receptors in the hypothalamus displaces the C-type natriuretic peptide (CNP) from the shared clearance receptor, making more CNP available to inhibit LHRH release. In the absence of cells bearing the clearance receptor all available CNP binds to the ANPR-B receptor and exerts its effect via an inhibitory interneuron, since LHRH fibers are spared by this treatment.

Quantum Secure Conditional Direct Communication via EPR Pairs

NASA Astrophysics Data System (ADS)

Gao, Ting; Yan, Fengli; Wang, Zhixi

Two schemes for quantum secure conditional direct communication are proposed, where a set of EPR pairs of maximally entangled particles in Bell states, initially made by the supervisor Charlie, but shared by the sender Alice and the receiver Bob, functions as quantum information channels for faithful transmission. After insuring the security of the quantum channel and obtaining the permission of Charlie (i.e., Charlie is trustworthy and cooperative, which means the "conditional" in the two schemes), Alice and Bob begin their private communication under the control of Charlie. In the first scheme, Alice transmits secret message to Bob in a deterministic manner with the help of Charlie by means of Alice's local unitary transformations, both Alice and Bob's local measurements, and both of Alice and Charlie's public classical communication. In the second scheme, the secure communication between Alice and Bob can be achieved via public classical communication of Charlie and Alice, and the local measurements of both Alice and Bob. The common feature of these protocols is that the communications between two communication parties Alice and Bob depend on the agreement of the third side Charlie. Moreover, transmitting one bit secret message, the sender Alice only needs to apply a local operation on her one qubit and send one bit classical information. We also show that the two schemes are completely secure if quantum channels are perfect.

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

Interlibrary Loan, the Key to Resource Sharing: A Manual of Procedures and Protocols.

ERIC Educational Resources Information Center

Alaska State Dept. of Education, Juneau. Div. of State Libraries.

Intended for use by librarians in Alaska, this manual provides general guidelines for the maximum utilization of library resources through interlibrary loan service. The first of four major sections describes the Alaska Library Network (ALN), which provides protocols and procedures to libraries for resource sharing; points out that new protocols…

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.

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

Method-centered digital communities on protocols.io for fast-paced scientific innovation.

PubMed

Kindler, Lori; Stoliartchouk, Alexei; Teytelman, Leonid; Hurwitz, Bonnie L

2016-01-01

The Internet has enabled online social interaction for scientists beyond physical meetings and conferences. Yet despite these innovations in communication, dissemination of methods is often relegated to just academic publishing. Further, these methods remain static, with subsequent advances published elsewhere and unlinked. For communities undergoing fast-paced innovation, researchers need new capabilities to share, obtain feedback, and publish methods at the forefront of scientific development. For example, a renaissance in virology is now underway given the new metagenomic methods to sequence viral DNA directly from an environment. Metagenomics makes it possible to "see" natural viral communities that could not be previously studied through culturing methods. Yet, the knowledge of specialized techniques for the production and analysis of viral metagenomes remains in a subset of labs.  This problem is common to any community using and developing emerging technologies and techniques. We developed new capabilities to create virtual communities in protocols.io, an open access platform, for disseminating protocols and knowledge at the forefront of scientific development. To demonstrate these capabilities, we present a virology community forum called VERVENet. These new features allow virology researchers to share protocols and their annotations and optimizations, connect with the broader virtual community to share knowledge, job postings, conference announcements through a common online forum, and discover the current literature through personalized recommendations to promote discussion of cutting edge research. Virtual communities in protocols.io enhance a researcher's ability to: discuss and share protocols, connect with fellow community members, and learn about new and innovative research in the field.  The web-based software for developing virtual communities is free to use on protocols.io. Data are available through public APIs at protocols.io.

Improvements of Quantum Private Comparison Protocol Based on Cluster States

NASA Astrophysics Data System (ADS)

Zhou, Ming-Kuai

2018-01-01

Quantum private comparison aims to determine whether the secrets from two different users are equal or not by utilizing the laws of quantum mechanics. Recently, Sun and Long put forward a quantum private comparison (QPC) protocol by using four-particle cluster states (Int. J. Theor. Phys. 52, 212-218, 2013). In this paper, we investigate this protocol in depth, and suggest the corresponding improvements. Compared with the original protocol, the improved protocol has the following advantages: 1) it can release the requirements of authenticated classical channels and unitary operations; 2) it can prevent the malicious attack from the genuine semi-honest TP; 3) it can enhance the qubit efficiency.

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.

Induction of pancreatic duct cells of neonatal rats into insulin-producing cells with fetal bovine serum: A natural protocol and its use for patch clamp experiments

PubMed Central

Leng, San-Hua; Lu, Fu-Er

2005-01-01

AIM: To induce the pancreatic duct cells into endocrine cells with a new natural protocol for electrophysiological study. METHODS: The pancreatic duct cells of neonatal rats were isolated, cultured and induced into endocrine cells with 15% fetal bovine serum for a period of 20 d. During this period, insulin secretion, MTT value, and morphological change of neonatal and adult pancreatic islet cells were comparatively investigated. Pancreatic β-cells were identified by morphological and electrophysiological characteristics, while ATP sensitive potassium channels (KATP), voltage-dependent potassium channels (KV), and voltage-dependent calcium channels (KCA) in β-cells were identified by patch clamp technique. RESULTS: After incubation with fetal bovine serum, the neonatal duct cells budded out, changed from duct-like cells into islet clusters. In the first 4 d, MTT value and insulin secretion increased slowly (MTT value from 0.024±0.003 to 0.028±0.003, insulin secretion from 2.6±0.6 to 3.1±0.8 mIU/L). Then MTT value and insulin secretion increased quickly from d 5 to d 10 (MTT value from 0.028±0.003 to 0.052±0.008, insulin secretion from 3.1±0.8 to 18.3±2.6 mIU/L), then reached high plateau (MTT value >0.052±0.008, insulin secretion >18.3±2.6 mIU/L). In contrast, for the isolated adult pancreatic islet cells, both insulin release and MTT value were stable in the first 4 d (MTT value from 0.029±0.01 to 0.031±0.011, insulin secretion from 13.9±3.1 to 14.3±3.3 mIU/L), but afterwards they reduced gradually (MTT value <0.031±0.011, insulin secretion <8.2±1.5 mIU/L), and the pancreatic islet cells became dispersed, broken or atrophied correspondingly. The differentiated neonatal cells were identified as pancreatic islet cells by dithizone staining method, and pancreatic β-cells were further identified by both morphological features and electrophysiological characteristics, i.e. the existence of recording currents from KATP, KV, and KCA. CONCLUSION: Islet cells differentiated from neonatal pancreatic duct cells with the new natural protocol are more advantageous in performing patch clamp study over the isolated adult pancreatic islet cells. PMID:16437601

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.

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.

Beyond Gisin’s Theorem and its Applications: Violation of Local Realism by Two-Party Einstein-Podolsky-Rosen Steering

PubMed Central

Chen, Jing-Ling; Su, Hong-Yi; Xu, Zhen-Peng; Wu, Yu-Chun; Wu, Chunfeng; Ye, Xiang-Jun; Żukowski, Marek; Kwek, L. C.

2015-01-01

We demonstrate here that for a given mixed multi-qubit state if there are at least two observers for whom mutual Einstein-Podolsky-Rosen steering is possible, i.e. each observer is able to steer the other qubits into two different pure states by spontaneous collapses due to von Neumann type measurements on his/her qubit, then nonexistence of local realistic models is fully equivalent to quantum entanglement (this is not so without this condition). This result leads to an enhanced version of Gisin’s theorem (originally: all pure entangled states violate local realism). Local realism is violated by all mixed states with the above steering property. The new class of states allows one e.g. to perform three party secret sharing with just pairs of entangled qubits, instead of three qubit entanglements (which are currently available with low fidelity). This significantly increases the feasibility of having high performance versions of such protocols. Finally, we discuss some possible applications. PMID:26108704

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.

Progress toward developing field protocols for a North American marsh bird monitoring program

Treesearch

Courtney J. Conway; Steven T. A. Timmermans

2005-01-01

Populations of many marsh-dependent birds appear to be declining, but we currently lack a continental program that provides estimates of population trends for most secretive marshbirds. The survey protocol outlined here is a standardized survey methodology being used on a pilot basis at National Wildlife Refuges and other protected wetland areas across North America...

Maximizing Interhospital Transfer Resources for Neurosurgical Patients.

PubMed

Schnurman, Zane; Chin, Robert; Fishkin, Edward R; Huang, Paul P

2017-08-01

Delays in patient transfers are associated with worse outcomes for some neurosurgical conditions. One of the primary causes of transfer delay is lack of neurosurgery intensive care unit bed availability. In the present study, we characterize the results of implementing an interhospital transfer protocol to reduce unnecessary transfers and improve bed availability. A transfer protocol was implemented in July 2012 at the Bellevue Hospital Department of Neurosurgery that screened for and prevented transfer of low-risk patients who were unlikely to require specialized inpatient neurosurgical care. The impact of this protocol was assessed with prospectively recorded data on all potential interhospital transfers from May 2011 through June 2016. Of the 1978 calls (regarding 1886 individual patients), 402 occurred before the implementation of the transfer protocol and 1576 occurred after. Before the protocol, 84.1% of transfer requests were accepted, but 15.2% were subsequently denied for bed unavailability. After the protocol, a smaller share of transfer requests were accepted after protocol screening (71.8%, P < 0.001), but only 1.9% (P < 0.001) were subsequently denied because of bed unavailability. The diagnosis demographics changed significantly (P < 0.001), with a larger share of arriving transfers suffering from aneurysms or tumors after the protocol and a smaller share suffering from stenosis/disc disease without neurological symptoms. The transfer protocol implemented in the present study allowed transfer determination based on the need for specialized neurosurgical care rather than chance unavailability of beds. Developing interhospital transfer protocols may be an effective strategy to efficiently allocate limited hospital resources and improve transfer systems. Copyright © 2017 Elsevier Inc. All rights reserved.

A Secured Authentication Protocol for SIP Using Elliptic Curves Cryptography

NASA Astrophysics Data System (ADS)

Chen, Tien-Ho; Yeh, Hsiu-Lien; Liu, Pin-Chuan; Hsiang, Han-Chen; Shih, Wei-Kuan

Session initiation protocol (SIP) is a technology regularly performed in Internet Telephony, and Hyper Text Transport Protocol (HTTP) as digest authentication is one of the major methods for SIP authentication mechanism. In 2005, Yang et al. pointed out that HTTP could not resist server spoofing attack and off-line guessing attack and proposed a secret authentication with Diffie-Hellman concept. In 2009, Tsai proposed a nonce based authentication protocol for SIP. In this paper, we demonstrate that their protocol could not resist the password guessing attack and insider attack. Furthermore, we propose an ECC-based authentication mechanism to solve their issues and present security analysis of our protocol to show that ours is suitable for applications with higher security requirement.

Comment on 'Quantum direct communication with authentication'

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

Zhang, Zhan-jun; Key Laboratory of Optoelectronic Information Acquisition and Manipulation of Ministry of Education of China, School of Physics and Material Science, Anhui University, Hefei 230039; Liu, Jun

2007-02-15

Two protocols of quantum direct communication with authentication [Phys. Rev. A 73, 042305 (2006)] were recently proposed by Lee, Lim, and Yang. In this paper we will show that in the two protocols the authenticator Trent should be prevented from knowing the secret message. The first protocol can be eavesdropped on by Trent using the intercept-measure-resend attack, while the second protocol can be eavesdropped on by Trent using a simple single-qubit measurement. To fix these leaks, we revise the original versions of the protocols by using the Pauli Z operation {sigma}{sub z} instead of the original bit-flip operation X. Asmore » a consequence, the attacks we present can be prevented and accordingly the protocol securities are improved.« less

Virtual laboratories: new opportunities for collaborative water science

NASA Astrophysics Data System (ADS)

Ceola, Serena; Arheimer, Berit; Bloeschl, Guenter; Baratti, Emanuele; Capell, Rene; Castellarin, Attilio; Freer, Jim; Han, Dawei; Hrachowitz, Markus; Hundecha, Yeshewatesfa; Hutton, Christopher; Lindström, Goran; Montanari, Alberto; Nijzink, Remko; Parajka, Juraj; Toth, Elena; Viglione, Alberto; Wagener, Thorsten

2015-04-01

Reproducibility and repeatability of experiments are the fundamental prerequisites that allow researchers to validate results and share hydrological knowledge, experience and expertise in the light of global water management problems. Virtual laboratories offer new opportunities to enable these prerequisites since they allow experimenters to share data, tools and pre-defined experimental procedures (i.e. protocols). Here we present the outcomes of a first collaborative numerical experiment undertaken by five different international research groups in a virtual laboratory to address the key issues of reproducibility and repeatability. Moving from the definition of accurate and detailed experimental protocols, a rainfall-runoff model was independently applied to 15 European catchments by the research groups and model results were collectively examined through a web-based discussion. We found that a detailed modelling protocol was crucial to ensure the comparability and reproducibility of the proposed experiment across groups. Our results suggest that sharing comprehensive and precise protocols and running the experiments within a controlled environment (e.g. virtual laboratory) is as fundamental as sharing data and tools for ensuring experiment repeatability and reproducibility across the broad scientific community and thus advancing hydrology in a more coherent way.

Measurement device-independent quantum dialogue

NASA Astrophysics Data System (ADS)

Maitra, Arpita

2017-12-01

Very recently, the experimental demonstration of quantum secure direct communication (QSDC) with state-of-the-art atomic quantum memory has been reported (Zhang et al. in Phys Rev Lett 118:220501, 2017). Quantum dialogue (QD) falls under QSDC where the secrete messages are communicated simultaneously between two legitimate parties. The successful experimental demonstration of QSDC opens up the possibilities for practical implementation of QD protocols. Thus, it is necessary to analyze the practical security issues of QD protocols for future implementation. Since the very first proposal for QD by Nguyen (Phys Lett A 328:6-10, 2004), a large number of variants and extensions have been presented till date. However, all of those leak half of the secret bits to the adversary through classical communications of the measurement results. In this direction, motivated by the idea of Lo et al. (Phys Rev Lett 108:130503, 2012), we propose a measurement device-independent quantum dialogue scheme which is resistant to such information leakage as well as side-channel attacks. In the proposed protocol, Alice and Bob, two legitimate parties, are allowed to prepare the states only. The states are measured by an untrusted third party who may himself behave as an adversary. We show that our protocol is secure under this adversarial model. The current protocol does not require any quantum memory, and thus, it is inherently robust against memory attacks. Such robustness might not be guaranteed in the QSDC protocol with quantum memory (Zhang et al. 2017).

Experimental dissociation of the effects of prostaglandins on renal sodium and water reabsorption by cyclo-oxygenase inhibitors in the rat.

PubMed

Bartoli, E; Branca, G F; Faedda, R; Olmeo, N A; Satta, A; Soggia, G

1982-07-01

1 The relative importance of the effect of prostaglandins on renal sodium and water reabsorption was assessed in rats. 2 Clearance experiments were performed on 24 anaesthetized rats divided into 3 groups. Each group was infused throughout either with Ringer solution at 9 ml/h (Protocol I), or at 3 ml/h (Protocol II) or with hypotonic fluid at 5 ml/h (Protocol III). Clearance periods were performed before and after intravenous injection of indomethacin (5 mg/kg) and then of aspirin (20 mg/kg). The natriuretic response to different degrees of volume expansion was not modified during the action of the inhibitors. 3 When baseline urine osmolality (Uosm) was high (Protocol II) no further increase occurred in the presence of prostaglandin inhibition. Conversely, Uosm rose from 771 +/- 134 to 1356 +/- 414 and from 575 +/- 245 to 841 +/- 407 mosm/kg (P less than 0.05) in Protocol I and Protocol III respectively, when antidiuretic hormone secretion was inhibited by the higher degree of volume expansion. 4 There was a significant correlation between the change in urine flow rate induced by cyclooxygenase inhibitors and the attendant variations in Na excretion, r = 0.42, n = 41, P less than 0.01. 5 Thus, prostaglandins affect Na loss during saline load as a side effect of their action on water permeability. They could play an important role in volume depletion by counterbalancing the large secretion rate of renal vasoconstrictors.

Experimental dissociation of the effects of prostaglandins on renal sodium and water reabsorption by cyclo-oxygenase inhibitors in the rat.

PubMed Central

Bartoli, E.; Branca, G. F.; Faedda, R.; Olmeo, N. A.; Satta, A.; Soggia, G.

1982-01-01

1 The relative importance of the effect of prostaglandins on renal sodium and water reabsorption was assessed in rats. 2 Clearance experiments were performed on 24 anaesthetized rats divided into 3 groups. Each group was infused throughout either with Ringer solution at 9 ml/h (Protocol I), or at 3 ml/h (Protocol II) or with hypotonic fluid at 5 ml/h (Protocol III). Clearance periods were performed before and after intravenous injection of indomethacin (5 mg/kg) and then of aspirin (20 mg/kg). The natriuretic response to different degrees of volume expansion was not modified during the action of the inhibitors. 3 When baseline urine osmolality (Uosm) was high (Protocol II) no further increase occurred in the presence of prostaglandin inhibition. Conversely, Uosm rose from 771 +/- 134 to 1356 +/- 414 and from 575 +/- 245 to 841 +/- 407 mosm/kg (P less than 0.05) in Protocol I and Protocol III respectively, when antidiuretic hormone secretion was inhibited by the higher degree of volume expansion. 4 There was a significant correlation between the change in urine flow rate induced by cyclooxygenase inhibitors and the attendant variations in Na excretion, r = 0.42, n = 41, P less than 0.01. 5 Thus, prostaglandins affect Na loss during saline load as a side effect of their action on water permeability. They could play an important role in volume depletion by counterbalancing the large secretion rate of renal vasoconstrictors. PMID:6809089

Cell differentiation: therapeutical challenges in diabetes.

PubMed

Roche, Enrique; Vicente-Salar, Nestor; Arribas, Maribel; Paredes, Beatriz

2012-01-01

Stem cells, derived from either embryonic or adult tissues, are considered to be potential sources of insulin-secreting cells to be transplanted into type 1 and advanced stages of type 2 diabetic patients. Many laboratories have considered this possibility, resulting in a large amount of published protocols, with a wide degree of complexity among them. Our group was the first to report that it was possible to obtain insulin-secreting cells from mouse embryonic stem cells, proving the feasibility of this new challenge. The same observation was immediately reported using human embryonic stem cells. However, the resulting cell product was not properly characterised, affecting the reproducibility of the protocol by other groups. A more elaborated protocol was developed by Lumelsky and co-workers, demonstrating that neuroectodermal cells could be an alternative source for insulin-producing cells. However, the resulting cells of this protocol produced low amounts of the hormone. This aimed other groups to perform key changes in order to improve the insulin content of the resulting cells. Recently, Baetge's group has published a new protocol based on the knowledge accumulated in pancreatic development. In this protocol, human embryonic stem cells were differentiated into islet-like structures through a five step protocol, emulating the key steps during embryonic development of the endocrine pancreas. The final cell product, however, seemed to be in an immature state, thus further improvement is required. Despite this drawback, the protocol represents the culmination of work performed by different groups and offers new research challenges for the investigators in this exciting field. Concerning adult stem cells, the possibility of identifying pancreatic precursors or of reprogramming extrapancreatic derived cells are key possibilities that may circumvent the problems that appear when using embryonic stem cells, such as immune rejection and tumour formation.

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.

Multiparty Quantum Key Agreement Based on Quantum Search Algorithm

PubMed Central

Cao, Hao; Ma, Wenping

2017-01-01

Quantum key agreement is an important topic that the shared key must be negotiated equally by all participants, and any nontrivial subset of participants cannot fully determine the shared key. To date, the embed modes of subkey in all the previously proposed quantum key agreement protocols are based on either BB84 or entangled states. The research of the quantum key agreement protocol based on quantum search algorithms is still blank. In this paper, on the basis of investigating the properties of quantum search algorithms, we propose the first quantum key agreement protocol whose embed mode of subkey is based on a quantum search algorithm known as Grover’s algorithm. A novel example of protocols with 5 – party is presented. The efficiency analysis shows that our protocol is prior to existing MQKA protocols. Furthermore it is secure against both external attack and internal attacks. PMID:28332610

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.

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

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.

Lessons Learned from the Afghan Mission Network: Developing a Coalition Contingency Network

DTIC Science & Technology

2014-01-01

SIPRNet Secret Internet Protocol Router Network SOP Standard Operating Procedure SVTC Secure Video Teleconference (or –Conferencing) TTP Tactics...Voice over internet protocol (VOIP) telephone connectivity • Email • Web browsing • Secure video teleconferencing (SVTC...10, 2012. As of January 15, 2013: http://www.guardian.co.uk/world/2012/oct/10/us-troops-jordan-syria-crisis Baldor, Lolita C., and Pauline Jelinek

Gaussian operations and privacy

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

Navascues, Miguel; Acin, Antonio

2005-07-15

We consider the possibilities offered by Gaussian states and operations for two honest parties, Alice and Bob, to obtain privacy against a third eavesdropping party, Eve. We first extend the security analysis of the protocol proposed in [Navascues et al. Phys. Rev. Lett. 94, 010502 (2005)]. Then, we prove that a generalized version of this protocol does not allow one to distill a secret key out of bound entangled Gaussian states.

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

Data Sharing to Improve Close Approach Monitoring and Safety of Flight

NASA Astrophysics Data System (ADS)

Chan, Joseph; DalBello, Richard; Hope, Dean; Wauthier, Pascal; Douglas, Tim; Inghram, Travis

2009-03-01

Individual satellite operators have done a good job of developing the internal protocols and procedures to ensure the safe operation of their fleets. However, data sharing among operators for close approach monitoring is conducted in an ad-hoc manner during relocations, and there is currently no standardized agreement among operators on the content, format, and distribution protocol for data sharing. Crowding in geostationary orbit, participation by new commercial actors, government interest in satellite constellations, and highly maneuverable spacecraft all suggest that satellite operators will need to begin a dialogue on standard communication protocols and procedure to improve situation awareness. We will give an overview of the current best practices among different operators for close approach monitoring and discuss the concept of an active data center to improve data sharing, conjunction monitoring, and avoidance among satellite operators. We will also report on the progress and lessons learned from a Data Center prototype conducted by several operators over a one year period.

A hash based mutual RFID tag authentication protocol in telecare medicine information system.

PubMed

Srivastava, Keerti; Awasthi, Amit K; Kaul, Sonam D; Mittal, R C

2015-01-01

Radio Frequency Identification (RFID) is a technology which has multidimensional applications to reduce the complexity of today life. Everywhere, like access control, transportation, real-time inventory, asset management and automated payment systems etc., RFID has its enormous use. Recently, this technology is opening its wings in healthcare environments, where potential applications include patient monitoring, object traceability and drug administration systems etc. In this paper, we propose a secure RFID-based protocol for the medical sector. This protocol is based on hash operation with synchronized secret. The protocol is safe against active and passive attacks such as forgery, traceability, replay and de-synchronization attack.

Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way postprocessing.

PubMed

Scarani, Valerio; Renner, Renato

2008-05-23

We derive a bound for the security of quantum key distribution with finite resources under one-way postprocessing, based on a definition of security that is composable and has an operational meaning. While our proof relies on the assumption of collective attacks, unconditional security follows immediately for standard protocols such as Bennett-Brassard 1984 and six-states protocol. For single-qubit implementations of such protocols, we find that the secret key rate becomes positive when at least N approximately 10(5) signals are exchanged and processed. For any other discrete-variable protocol, unconditional security can be obtained using the exponential de Finetti theorem, but the additional overhead leads to very pessimistic estimates.

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.

Controller-Independent Bidirectional Direct Communication with Four-Qubit Cluster States

NASA Astrophysics Data System (ADS)

Cao, Yong; Zha, Xin-Wei; Wang, Shu-Kai

2018-03-01

We propose a feasible scheme for implementing bidirectional quantum direct communication protocol using four-qubit cluster states. In this scheme, the quantum channel between the sender Alice and the receiver Bob consists of an ordered sequence of cluster states which are prepared by Alice. After ensuring the security of quantum channel, according to the secret messages, the sender will perform the unitary operation and the receiver can obtain different secret messages in a deterministic way.

Quantum dialogue by nonselective measurements

NASA Astrophysics Data System (ADS)

Nguyen, Ba An

2018-06-01

Unlike classical measurements, quantum measurements may be useful even without reading the outcome. Such so called nonselective measurements are exploited in this paper to design a quantum dialogue protocol that allows exchanging secret data without prior key distributions. The relevant data to be exchanged are in terms of the high-dimensional mutually unbiased bases of quantum measurements. Appropriate modes of bidirectional controlling are devised to ensure the protocol security which is asymptotic.

Performance Analysis and Optimization of the Winnow Secret Key Reconciliation Protocol

DTIC Science & Technology

2011-06-01

use in a quantum key system can be defined in two ways :  The number of messages passed between Alice and Bob  The...classical and quantum environment. Post- quantum cryptography , which is generally used to describe classical quantum -resilient protocols, includes...composed of a one- way quantum channel and a two - way classical channel. Owing to the physics of the channel, the quantum channel is subject to

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.

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.

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

X-Windows Information Sharing Protocol Widget Class

NASA Technical Reports Server (NTRS)

Barry, Matthew R.

2006-01-01

The X-Windows Information Sharing Protocol (ISP) Widget Class ("Class") is used here in the object-oriented-programming sense of the word) was devised to simplify the task of implementing ISP graphical-user-interface (GUI) computer programs. ISP programming tasks require many method calls to identify, query, and interpret the connections and messages exchanged between a client and an ISP server. Most X-Windows GUI programs use widget sets or toolkits to facilitate management of complex objects. The widget standards facilitate construction of toolkits and application programs. The X-Windows Information Sharing Protocol (ISP) Widget Class encapsulates the client side of the ISP programming libraries within the framework of an X-Windows widget. Using the widget framework, X-Windows GUI programs can interact with ISP services in an abstract way and in the same manner as that of other graphical widgets, making it easier to write ISP GUI client programs. Wrapping ISP client services inside a widget framework enables a programmer to treat an ISP server interface as though it were a GUI. Moreover, an alternate subclass could implement another communication protocol in the same sort of widget.

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 ...

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

Shared Activity Coordination

NASA Technical Reports Server (NTRS)

Clement, Bradley J.; Barrett, Anthony C.

2003-01-01

Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and different constraints on communication and computation, agents will require different coordination protocols in order to efficiently reach consensus in real time. We briefly describe a largely unexplored class of real-time, distributed planning problems (inspired by interacting spacecraft missions), new challenges they pose, and a general approach to solving the problems. These problems involve self-interested agents that have infrequent communication but collaborate on joint activities. We describe a Shared Activity Coordination (SHAC) framework that provides a decentralized algorithm for negotiating the scheduling of shared activities in a dynamic environment, a soft, real-time approach to reaching consensus during execution with limited communication, and a foundation for customizing protocols for negotiating planner interactions. We apply SHAC to a realistic simulation of interacting Mars missions and illustrate the simplicity of protocol development.

Continual coordination through shared activities

NASA Technical Reports Server (NTRS)

Clement, Bradley J.; Barrett, Anthony C.

2003-01-01

Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and different constraints on communication and computation, agents will require different coordination protocols in order to efficiently reach consensus in real time. We briefly describe a largely unexplored class of realtime, distributed planning problems (inspired by interacting spacecraft missions), new challenges they pose, and a general approach to solving the problems. These problems involve self-interested agents that have infrequent communication but collaborate on joint activities. We describe a Shared Activity Coordination (SHAC) framework that provides a decentralized algorithm for negotiating the scheduling of shared activities over the lifetimes of separate missions, a soft, real-time approach to reaching consensus during execution with limited communication, and a foundation for customizing protocols for negotiating planner interactions. We apply SHAC to a realistic simulation of interacting Mars missions and illustrate the simplicity of protocol development.

Argumentation for coordinating shared activities

NASA Technical Reports Server (NTRS)

Clement, Bradley J.; Barrett, Anthony C.; Schaffer, Steven R.

2004-01-01

an increasing need for space missions to be able to collaboratively (and competitively) develop plans both within and across missions. In addition, interacting spacecraft that interleave onboard planning and execution must reach consensus on their commitments to each other prior to execution. In domains where missions have varying degrees of interaction and different constraints on communication and computation, the missions will require different coordination protocols in order to efficiently reach consensus with in their imposed deadlines. We describe a Shared Activity Coordination (SHAC) framework that provides a decentralized algorithm for negotiating the scheduling of shared activities over the lifetimes of multiple agents and a foundation for customizing protocols for negotiating planner interactions. We investigate variations of a few simple protocols based on argumentation and distributed constraints satisfaction techniques and evaluate their abilities to reach consistent solutions according to computation, time, and communication costs in an abstract domain where spacecraft propose joint measurements.

Characterization of Nops, nodulation outer proteins, secreted via the type III secretion system of NGR234.

PubMed

Marie, Corinne; Deakin, William J; Viprey, Virginie; Kopciñska, Joanna; Golinowski, Wladyslaw; Krishnan, Hari B; Perret, Xavier; Broughton, William J

2003-09-01

The nitrogen-fixing symbiotic bacterium Rhizobium species NGR234 secretes, via a type III secretion system (TTSS), proteins called Nops (nodulation outer proteins). Abolition of TTSS-dependent protein secretion has either no effect or leads to a change in the number of nodules on selected plants. More dramatically, Nops impair nodule development on Crotalaria juncea roots, resulting in the formation of nonfixing pseudonodules. A double mutation of nopX and nopL, which code for two previously identified secreted proteins, leads to a phenotype on Pachyrhizus tuberosus differing from that of a mutant in which the TTSS is not functional. Use of antibodies and a modification of the purification protocol revealed that NGR234 secretes additional proteins in a TTSS-dependent manner. One of them was identified as NopA, a small 7-kDa protein. Single mutations in nopX and nopL were also generated to assess the involvement of each Nop in protein secretion and nodule formation. Mutation of nopX had little effect on NopL and NopA secretion but greatly affected the interaction of NGR234 with many plant hosts tested. NopL was not necessary for the secretion of any Nops but was required for efficient nodulation of some plant species. NopL may thus act as an effector protein whose recognition is dependent upon the hosts' genetic background.

Coherent attack on oblivious transfer based on single-qubit rotations

NASA Astrophysics Data System (ADS)

He, Guang Ping

2018-04-01

Recently a bit-string quantum oblivious transfer (OT) protocol based on single-qubit rotations was proposed (Rodrigues et al 2017 J. Phys. A: Math. Theor. 50 205301) and proven secure against few-qubit measurements. However, it was left as an open question whether the protocol remains secure against general attacks. Here, we close the gap by showing that if the receiver Bob can perform collective measurements on all qubits, then he can learn Alice’s secret message with a probability close to one. Thus the protocol fails to meet the security criterion of OT.

Comment on "Bit-string oblivious transfer based on quantum state computational distinguishability"

NASA Astrophysics Data System (ADS)

He, Guang Ping

2015-10-01

We show that in the protocol proposed in Phys. Rev. A 91, 042306 (2015), 10.1103/PhysRevA.91.042306, a dishonest sender can always ensure with certainty that the receiver fails to get the secret message. Thus the security requirement of oblivious transfer is not met. This security problem also makes the protocol unsuitable for serving as a building block for 1-out-of-2 oblivious transfer.

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.

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.

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.

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.

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.

SPECS: Secure and Privacy Enhancing Communications Schemes for VANETs

NASA Astrophysics Data System (ADS)

Chim, T. W.; Yiu, S. M.; Hui, L. C. K.; Jiang, Zoe L.; Li, Victor O. K.

Vehicular ad hoc network (VANET) is an emerging type of networks which facilitates vehicles on roads to communicate for driving safety. The basic idea is to allow arbitrary vehicles to broadcast ad hoc messages (e.g. traffic accidents) to other vehicles. However, this raises the concern of security and privacy. Messages should be signed and verified before they are trusted while the real identity of vehicles should not be revealed, but traceable by authorized party. Existing solutions either rely heavily on a tamper-proof hardware device, or cannot satisfy the privacy requirement and do not have an effective message verification scheme. In this paper, we provide a software-based solution which makes use of only two shared secrets to satisfy the privacy requirement and gives lower message overhead and at least 45% higher successful rate than previous solutions in the message verification phase using the bloom filter and the binary search techniques. We also provide the first group communication protocol to allow vehicles to authenticate and securely communicate with others in a group of known vehicles.

Controlling Distributed Planning

NASA Technical Reports Server (NTRS)

Clement, Bradley; Barrett, Anthony

2004-01-01

A system of software implements an extended version of an approach, denoted shared activity coordination (SHAC), to the interleaving of planning and the exchange of plan information among organizations devoted to different missions that normally communicate infrequently except that they need to collaborate on joint activities and/or the use of shared resources. SHAC enables the planning and scheduling systems of the organizations to coordinate by resolving conflicts while optimizing local planning solutions. The present software provides a framework for modeling and executing communication protocols for SHAC. Shared activities are represented in each interacting planning system to establish consensus on joint activities or to inform the other systems of consumption of a common resource or a change in a shared state. The representations of shared activities are extended to include information on (1) the role(s) of each participant, (2) permissions (defined as specifications of which participant controls what aspects of shared activities and scheduling thereof), and (3) constraints on the parameters of shared activities. Also defined in the software are protocols for changing roles, permissions, and constraints during the course of coordination and execution.

Numerical approach for unstructured quantum key distribution

PubMed Central

Coles, Patrick J.; Metodiev, Eric M.; Lütkenhaus, Norbert

2016-01-01

Quantum key distribution (QKD) allows for communication with security guaranteed by quantum theory. The main theoretical problem in QKD is to calculate the secret key rate for a given protocol. Analytical formulas are known for protocols with symmetries, since symmetry simplifies the analysis. However, experimental imperfections break symmetries, hence the effect of imperfections on key rates is difficult to estimate. Furthermore, it is an interesting question whether (intentionally) asymmetric protocols could outperform symmetric ones. Here we develop a robust numerical approach for calculating the key rate for arbitrary discrete-variable QKD protocols. Ultimately this will allow researchers to study ‘unstructured' protocols, that is, those that lack symmetry. Our approach relies on transforming the key rate calculation to the dual optimization problem, which markedly reduces the number of parameters and hence the calculation time. We illustrate our method by investigating some unstructured protocols for which the key rate was previously unknown. PMID:27198739

Pancreatic Endoderm-Derived From Diabetic Patient-Specific Induced Pluripotent Stem Cell Generates Glucose-Responsive Insulin-Secreting Cells.

PubMed

Rajaei, Bahareh; Shamsara, Mehdi; Amirabad, Leila Mohammadi; Massumi, Mohammad; Sanati, Mohammad Hossein

2017-10-01

Human-induced pluripotent stem cells (hiPSCs) can potentially serve as an invaluable source for cell replacement therapy and allow the creation of patient- and disease-specific stem cells without the controversial use of embryos and avoids any immunological incompatibility. The generation of insulin-producing pancreatic β-cells from pluripotent stem cells in vitro provides an unprecedented cell source for personal drug discovery and cell transplantation therapy in diabetes. A new five-step protocol was introduced in this study, effectively induced hiPSCs to differentiate into glucose-responsive insulin-producing cells. This process mimics in vivo pancreatic organogenesis by directing cells through stages resembling definitive endoderm, primitive gut-tube endoderm, posterior foregut, pancreatic endoderm, and endocrine precursor. Each stage of differentiation were characterized by stage-specific markers. The produced cells exhibited many properties of functional β-cells, including expression of critical β-cells transcription factors, the potency to secrete C-peptide in response to high levels of glucose and the presence of mature endocrine secretory granules. This high efficient differentiation protocol, established in this study, yielded 79.18% insulin-secreting cells which were responsive to glucose five times higher than the basal level. These hiPSCs-derived glucose-responsive insulin-secreting cells might provide a promising approach for the treatment of type I diabetes mellitus. J. Cell. Physiol. 232: 2616-2625, 2017. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

Evaluation of autonomous recording units for detecting 3 species of secretive marsh birds

USGS Publications Warehouse

Sidie-Slettehahl, Anna M.; Jensen, Kent C.; Johnson, Rex R.; Arnold, Todd W.; Austin, Jane; Stafford, Joshua D.

2015-01-01

Population status and habitat use of yellow rails (Coturnicops noveboracensis), Nelson's sparrows (Ammodramus nelsoni), and Le Conte's sparrows (A. leconteii) are poorly known, so standardized surveys of these species are needed to inform conservation planning and management. A protocol for monitoring secretive marsh birds exists; however, these species regularly call at night and may be missed during early morning surveys. We tested the effectiveness of autonomous recording units (hereafter, recording units) to survey these species by analyzing recorded vocalizations using bioacoustics software. We deployed 22 recording units at 54 sites in northern Minnesota and eastern North Dakota, USA, and conducted traditional broadcast surveys during May–June, 2010 and 2011. We compared detection probabilities between recording units and standard monitoring protocols using robust-design occupancy models. On average, recording units detected 0.59 (SE = 0.11) fewer Le Conte's sparrows, 0.76 (SE = 0.15) fewer Nelson's sparrows, and 1.01 (SE = 0.14) fewer yellow rails per survey than were detected using the standard protocol. Detection probabilities using the standard protocol averaged 0.95 (yellow rail; 95% CI = 0.86–0.98), 0.93 (Le Conte's sparrow; 95% CI = 0.78–0.98), and 0.89 (Nelson's sparrow; 95% CI = 0.56–0.98), but averaged 0.71 (yellow rail; 95% CI = 0.56–0.83), 0.61 (Le Conte's sparrow; 95% CI = 0.42–0.78), and 0.51 (Nelson's sparrow; 95% CI = 0.19–0.82) using recording units. Reduced detection by recording units was likely due to the ability of human listeners to identify birds calling at greater distances. Recording units may be effective for surveying nocturnal secretive marsh birds if investigators correct for differential detectability. Reduced detectability may be outweighed by the increased spatial and temporal coverage feasible with recording units.

Resveratrol Ameliorates the Maturation Process of β-Cell-Like Cells Obtained from an Optimized Differentiation Protocol of Human Embryonic Stem Cells

PubMed Central

Pezzolla, Daniela; López-Beas, Javier; Lachaud, Christian C.; Domínguez-Rodríguez, Alejandro; Smani, Tarik; Hmadcha, Abdelkrim; Soria, Bernat

2015-01-01

Human embryonic stem cells (hESCs) retain the extraordinary capacity to differentiate into different cell types of an adult organism, including pancreatic β-cells. For this particular lineage, although a lot of effort has been made in the last ten years to achieve an efficient and reproducible differentiation protocol, it was not until recently that this aim was roughly accomplished. Besides, several studies evidenced the impact of resveratrol (RSV) on insulin secretion, even though the mechanism by which this polyphenol potentiates glucose-stimulated insulin secretion (GSIS) is still not clear. The aim of this study was to optimize an efficient differentiation protocol that mimics in vivo pancreatic organogenesis and to investigate whether RSV may improve the final maturation step to obtain functional insulin-secreting cells. Our results indicate that treatment of hESCs (HS-181) with activin-A induced definitive endoderm differentiation as detected by the expression of SOX17 and FOXA2. Addition of retinoic acid (RA), Noggin and Cyclopamine promoted pancreatic differentiation as indicated by the expression of the early pancreatic progenitor markers ISL1, NGN3 and PDX1. Moreover, during maturation in suspension culture, differentiating cells assembled in islet-like clusters, which expressed specific endocrine markers such as PDX1, SST, GCG and INS. Similar results were confirmed with the human induced Pluripotent Stem Cell (hiPSC) line MSUH-001. Finally, differentiation protocols incorporating RSV treatment yielded numerous insulin-positive cells, induced significantly higher PDX1 expression and were able to transiently normalize glycaemia when transplanted in streptozotocin (STZ) induced diabetic mice thus promoting its survival. In conclusion, our strategy allows the efficient differentiation of hESCs into pancreatic endoderm capable of generating β-cell-like cells and demonstrates that RSV improves the maturation process. PMID:25774684

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.

Offering to Share: How to Put Heads Together in Autism Neuroimaging

ERIC Educational Resources Information Center

Belmonte, Matthew K.; Mazziotta, John C.; Minshew, Nancy J.; Evans, Alan C.; Courchesne, Eric; Dager, Stephen R.; Bookheimer, Susan Y.; Aylward, Elizabeth H.; Amaral, David G.; Cantor, Rita M.; Chugani, Diane C.; Dale, Anders M.; Davatzikos, Christos; Gerig, Guido; Herbert, Martha R.; Lainhart, Janet E.; Murphy, Declan G.; Piven, Joseph; Reiss, Allan L.; Schultz, Robert T.; Zeffiro, Thomas A.; Levi-Pearl, Susan; Lajonchere, Clara; Colamarino, Sophia A.

2008-01-01

Data sharing in autism neuroimaging presents scientific, technical, and social obstacles. We outline the desiderata for a data-sharing scheme that combines imaging with other measures of phenotype and with genetics, defines requirements for comparability of derived data and recommendations for raw data, outlines a core protocol including…

Asynchronous reference frame agreement in a quantum network

NASA Astrophysics Data System (ADS)

Islam, Tanvirul; Wehner, Stephanie

2016-03-01

An efficient implementation of many multiparty protocols for quantum networks requires that all the nodes in the network share a common reference frame. Establishing such a reference frame from scratch is especially challenging in an asynchronous network where network links might have arbitrary delays and the nodes do not share synchronised clocks. In this work, we study the problem of establishing a common reference frame in an asynchronous network of n nodes of which at most t are affected by arbitrary unknown error, and the identities of the faulty nodes are not known. We present a protocol that allows all the correctly functioning nodes to agree on a common reference frame as long as the network graph is complete and not more than t\\lt n/4 nodes are faulty. As the protocol is asynchronous, it can be used with some assumptions to synchronise clocks over a network. Also, the protocol has the appealing property that it allows any existing two-node asynchronous protocol for reference frame agreement to be lifted to a robust protocol for an asynchronous quantum network.

Diadenosine tetraphosphate contributes to carbachol-induced tear secretion.

PubMed

Fonseca, Begoña; Martínez-Águila, Alejandro; Díaz-Hernández, Miguel; Pintor, Jesús

2015-03-01

The purpose of this study is to investigate if the cholinergic stimulation by carbachol on tear secretion is a direct process or if it is also mediated by purinergic mechanisms. Experiments were performed in New Zealand male rabbits. The amount of tear secretion was measured with Schirmer's test and then analyzed by a HPLC protocol in order to study the nucleotide levels. Animal eyes were instilled with carbachol (a cholinergic agonist), pirenzepine, gallamine and 4-DAMP (muscarinic antagonists), PPADS, suramin and reactive blue 2 (purinergic antagonists), and a P2Y2 receptor small interfering RNA (siRNA). Tear secretion increased with the instillation of carbachol, approximately 84 % over control values 20 min after the instillation and so did Ap4A and ATP release. When we applied carbachol in the presence of muscarinic antagonists, tear volume only increased to 4 % with atropine, 12 % in the case of pirenzepine, 3 % with gallamine, and 8 % with 4-DAMP. In the presence of carbachol and purinergic antagonists, tear secretion was increased to 12 % (all values compared to basal tear secretion). By analyzing tear secretion induced with carbachol in presence of a P2Y2 receptor siRNA, we found that tear secretion was diminished to 60 %. The inhibition of tear secretion in the presence of carbachol and purinergic antagonists or P2Y2 siRNA occurred with no apparent change in the tear amount of Ap4A. These experiments demonstrated the participation of Ap4A in lacrimal secretion process.

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.

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.

Cryptanalysis and improvement of a quantum communication-based online shopping mechanism

NASA Astrophysics Data System (ADS)

Huang, Wei; Yang, Ying-Hui; Jia, Heng-Yue

2015-06-01

Recently, Chou et al. (Electron Commer Res 14:349-367, 2014) presented a novel controlled quantum secure direct communication protocol which can be used for online shopping. The authors claimed that their protocol was immune to the attacks from both external eavesdropper and internal betrayer. However, we find that this protocol is vulnerable to the attack from internal betrayer. In this paper, we analyze the security of this protocol to show that the controller in this protocol is able to eavesdrop the secret information of the sender (i.e., the customer's shopping information), which indicates that it cannot be used for secure online shopping as the authors expected. Accordingly, an improvement of this protocol, which could resist the controller's attack, is proposed. In addition, we present another protocol which is more appropriate for online shopping. Finally, a discussion about the difference in detail of the quantum secure direct communication process between regular quantum communications and online shopping is given.

Collective attacks and unconditional security in continuous variable quantum key distribution.

PubMed

Grosshans, Frédéric

2005-01-21

We present here an information theoretic study of Gaussian collective attacks on the continuous variable key distribution protocols based on Gaussian modulation of coherent states. These attacks, overlooked in previous security studies, give a finite advantage to the eavesdropper in the experimentally relevant lossy channel, but are not powerful enough to reduce the range of the reverse reconciliation protocols. Secret key rates are given for the ideal case where Bob performs optimal collective measurements, as well as for the realistic cases where he performs homodyne or heterodyne measurements. We also apply the generic security proof of Christiandl et al. to obtain unconditionally secure rates for these protocols.

Three-party quantum secure direct communication against collective noise

NASA Astrophysics Data System (ADS)

He, Ye-Feng; Ma, Wen-Ping

2017-10-01

Based on logical quantum states, two three-party quantum secure direct communication protocols are proposed, which can realize the exchange of the secret messages between three parties with the help of the measurement correlation property of six-particle entangled states. These two protocols can be immune to the collective-dephasing noise and the collective-rotation noise, respectively; neither of them has information leakage problem. The one-way transmission mode ensures that they can congenitally resist against the Trojan horse attacks and the teleportation attack. Furthermore, these two protocols are secure against other active attacks because of the use of the decoy state technology.

An implementation of the SNR high speed network communication protocol (Receiver part)

NASA Astrophysics Data System (ADS)

Wan, Wen-Jyh

1995-03-01

This thesis work is to implement the receiver pan of the SNR high speed network transport protocol. The approach was to use the Systems of Communicating Machines (SCM) as the formal definition of the protocol. Programs were developed on top of the Unix system using C programming language. The Unix system features that were adopted for this implementation were multitasking, signals, shared memory, semaphores, sockets, timers and process control. The problems encountered, and solved, were signal loss, shared memory conflicts, process synchronization, scheduling, data alignment and errors in the SCM specification itself. The result was a correctly functioning program which implemented the SNR protocol. The system was tested using different connection modes, lost packets, duplicate packets and large data transfers. The contributions of this thesis are: (1) implementation of the receiver part of the SNR high speed transport protocol; (2) testing and integration with the transmitter part of the SNR transport protocol on an FDDI data link layered network; (3) demonstration of the functions of the SNR transport protocol such as connection management, sequenced delivery, flow control and error recovery using selective repeat methods of retransmission; and (4) modifications to the SNR transport protocol specification such as corrections for incorrect predicate conditions, defining of additional packet types formats, solutions for signal lost and processes contention problems etc.

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.

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

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).

Alterations to N-linked oligosaccharides which affect intracellular transport rates and regulated secretion but not sorting of lysosomal acid phosphatase in Dictyostelium discoideum.

PubMed

Bush, J M; Ebert, D L; Cardelli, J A

1990-11-15

The importance of N-linked oligosaccharides and their associated modifications in the transport, sorting, and secretion of lysosomal acid phosphatase was investigated using three mutant Dictyostelium cell lines. These mutants synthesize altered N-linked oligosaccharides with the following properties: (i) in strain HL244 carbohydrate side chains lack mannose 6-sulfate residues, (ii) in strain M31 the side chains retain the two alpha-1,3-linked glucose residues resulting in less sulfate and methylphosphate modifications, and (iii) in strain HL243 the nonglucosylated branches are missing three of the outer mannose sugars and the oligosaccharides contain fewer sulfate and phosphate modifications. Lysosomal enzymes in both HL243 and HL244 are also missing a shared epitope termed common antigen-1 (CA-1), which consists in part of mannose 6-sulfate moieties. No increases were observed in the secretion of radiolabeled acid phosphatase or acid phosphatase activity during growth in any of the mutant cell lines, suggesting that the enzyme was correctly sorted to lysosomes. In support of this, Percoll gradient fractionations and indirect immunofluorescence microscopy indicated that acid phosphatase was transported to lysosomes in all cell lines. However, radiolabel pulse chase protocols indicated that newly synthesized acid phosphatase was transported out of the endoplasmic reticulum (ER) and into lysosomes at a two- to threefold slower rate in HL243 and at a sixfold slower rate in M31. The rate of transport of acid phosphatase from the ER to the Golgi was reduced only twofold in M31 as determined by digestion of newly synthesized enzyme with endoglycosidose H. This suggests that certain alterations in carbohydrate structure may only slightly affect transport of the enzyme from the ER to the Golgi but these alterations may greatly delay transport from the Golgi or post-Golgi compartments to lysosomes. Finally all three mutants secreted acid phosphatase at significantly lower rates than the wild-type strain when growing cells were placed in a buffered salt solution (conditions which stimulate the secretion of mature lysosomally localized enzymes). In contrast, alpha-mannosidase was secreted with similar kinetics from the mutant and wild-type strains. Together, these results suggest that the mechanism(s) operating to sort acid phosphatase in Dictyostelium can tolerate a wide range of changes in N-linked oligosaccharides including a reduction in phosphate and the absence of CA-1 and sulfate, while in contrast, these same alterations can profoundly influence the rate of transport of acid phosphatase from the ER and post-ER compartments to lysosomes as well as the secr

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.

"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.

Semi-quantum Dialogue Based on Single Photons

NASA Astrophysics Data System (ADS)

Ye, Tian-Yu; Ye, Chong-Qiang

2018-02-01

In this paper, we propose two semi-quantum dialogue (SQD) protocols by using single photons as the quantum carriers, where one requires the classical party to possess the measurement capability and the other does not have this requirement. The security toward active attacks from an outside Eve in the first SQD protocol is guaranteed by the complete robustness of present semi-quantum key distribution (SQKD) protocols, the classical one-time pad encryption, the classical party's randomization operation and the decoy photon technology. The information leakage problem of the first SQD protocol is overcome by the classical party' classical basis measurements on the single photons carrying messages which makes him share their initial states with the quantum party. The security toward active attacks from Eve in the second SQD protocol is guaranteed by the classical party's randomization operation, the complete robustness of present SQKD protocol and the classical one-time pad encryption. The information leakage problem of the second SQD protocol is overcome by the quantum party' classical basis measurements on each two adjacent single photons carrying messages which makes her share their initial states with the classical party. Compared with the traditional information leakage resistant QD protocols, the advantage of the proposed SQD protocols lies in that they only require one party to have quantum capabilities. Compared with the existing SQD protocol, the advantage of the proposed SQD protocols lies in that they only employ single photons rather than two-photon entangled states as the quantum carriers. The proposed SQD protocols can be implemented with present quantum technologies.

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.

Targeting tumor antigens to secreted membrane vesicles in vivo induces efficient antitumor immune responses.

PubMed

Zeelenberg, Ingrid S; Ostrowski, Matias; Krumeich, Sophie; Bobrie, Angélique; Jancic, Carolina; Boissonnas, Alexandre; Delcayre, Alain; Le Pecq, Jean-Bernard; Combadière, Béhazine; Amigorena, Sebastian; Théry, Clotilde

2008-02-15

Expression of non-self antigens by tumors can induce activation of T cells in vivo, although this activation can lead to either immunity or tolerance. CD8+ T-cell activation can be direct (if the tumor expresses MHC class I molecules) or indirect (after the capture and cross-presentation of tumor antigens by dendritic cells). The modes of tumor antigen capture by dendritic cells in vivo remain unclear. Here we examine the immunogenicity of the same model antigen secreted by live tumors either in association with membrane vesicles (exosomes) or as a soluble protein. We have artificially addressed the antigen to secreted vesicles by coupling it to the factor VIII-like C1C2 domain of milk fat globule epidermal growth factor-factor VIII (MFG-E8)/lactadherin. We show that murine fibrosarcoma tumor cells that secrete vesicle-bound antigen grow slower than tumors that secrete soluble antigen in immunocompetent, but not in immunodeficient, host mice. This growth difference is due to the induction of a more potent antigen-specific antitumor immune response in vivo by the vesicle-bound than by the soluble antigen. Finally, in vivo secretion of the vesicle-bound antigen either by tumors or by vaccination with naked DNA protects against soluble antigen-secreting tumors. We conclude that the mode of secretion can determine the immunogenicity of tumor antigens and that manipulation of the mode of antigen secretion may be used to optimize antitumor vaccination protocols.

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 ...

Annual gonadal cycles in birds: modeling the effects of photoperiod on seasonal changes in GnRH-1 secretion.

PubMed

Dawson, Alistair

2015-04-01

This paper reviews current knowledge of photoperiod control of GnRH-1 secretion and proposes a model in which two processes act together to regulate GnRH1 secretion. Photo-induction controls GnRH1 secretion and is directly related to prevailing photoperiod. Photo-inhibition, a longer term process, acts through GnRH1 synthesis. It progresses each day during daylight hours, but reverses during darkness. Thus, photo-inhibition gradually increases when photoperiods exceed 12h, and reverses under shorter photoperiods. GnRH1 secretion on any particular day is the net result of these two processes acting in tandem. The only difference between species is their sensitivity to photo-inhibition. This can potentially explain differences in timing and duration of breeding seasons between species, why some species become absolutely photorefractory and others relatively photorefractory, why breeding seasons end at the same time at different latitudes within species, and why experimental protocols sometimes produce results that appear counter to what happens naturally. Copyright © 2014 The Author. Published by Elsevier Inc. All rights reserved.

Two-dimensional distributed-phase-reference protocol for quantum key distribution

NASA Astrophysics Data System (ADS)

Bacco, Davide; Christensen, Jesper Bjerge; Castaneda, Mario A. Usuga; Ding, Yunhong; Forchhammer, Søren; Rottwitt, Karsten; Oxenløwe, Leif Katsuo

2016-12-01

Quantum key distribution (QKD) and quantum communication enable the secure exchange of information between remote parties. Currently, the distributed-phase-reference (DPR) protocols, which are based on weak coherent pulses, are among the most practical solutions for long-range QKD. During the last 10 years, long-distance fiber-based DPR systems have been successfully demonstrated, although fundamental obstacles such as intrinsic channel losses limit their performance. Here, we introduce the first two-dimensional DPR-QKD protocol in which information is encoded in the time and phase of weak coherent pulses. The ability of extracting two bits of information per detection event, enables a higher secret key rate in specific realistic network scenarios. Moreover, despite the use of more dimensions, the proposed protocol remains simple, practical, and fully integrable.

Two-dimensional distributed-phase-reference protocol for quantum key distribution.

PubMed

Bacco, Davide; Christensen, Jesper Bjerge; Castaneda, Mario A Usuga; Ding, Yunhong; Forchhammer, Søren; Rottwitt, Karsten; Oxenløwe, Leif Katsuo

2016-12-22

Quantum key distribution (QKD) and quantum communication enable the secure exchange of information between remote parties. Currently, the distributed-phase-reference (DPR) protocols, which are based on weak coherent pulses, are among the most practical solutions for long-range QKD. During the last 10 years, long-distance fiber-based DPR systems have been successfully demonstrated, although fundamental obstacles such as intrinsic channel losses limit their performance. Here, we introduce the first two-dimensional DPR-QKD protocol in which information is encoded in the time and phase of weak coherent pulses. The ability of extracting two bits of information per detection event, enables a higher secret key rate in specific realistic network scenarios. Moreover, despite the use of more dimensions, the proposed protocol remains simple, practical, and fully integrable.

Two-dimensional distributed-phase-reference protocol for quantum key distribution

PubMed Central

Bacco, Davide; Christensen, Jesper Bjerge; Castaneda, Mario A. Usuga; Ding, Yunhong; Forchhammer, Søren; Rottwitt, Karsten; Oxenløwe, Leif Katsuo

2016-01-01

Quantum key distribution (QKD) and quantum communication enable the secure exchange of information between remote parties. Currently, the distributed-phase-reference (DPR) protocols, which are based on weak coherent pulses, are among the most practical solutions for long-range QKD. During the last 10 years, long-distance fiber-based DPR systems have been successfully demonstrated, although fundamental obstacles such as intrinsic channel losses limit their performance. Here, we introduce the first two-dimensional DPR-QKD protocol in which information is encoded in the time and phase of weak coherent pulses. The ability of extracting two bits of information per detection event, enables a higher secret key rate in specific realistic network scenarios. Moreover, despite the use of more dimensions, the proposed protocol remains simple, practical, and fully integrable. PMID:28004821

QKD-based quantum private query without a failure probability

NASA Astrophysics Data System (ADS)

Liu, Bin; Gao, Fei; Huang, Wei; Wen, QiaoYan

2015-10-01

In this paper, we present a quantum-key-distribution (QKD)-based quantum private query (QPQ) protocol utilizing single-photon signal of multiple optical pulses. It maintains the advantages of the QKD-based QPQ, i.e., easy to implement and loss tolerant. In addition, different from the situations in the previous QKD-based QPQ protocols, in our protocol, the number of the items an honest user will obtain is always one and the failure probability is always zero. This characteristic not only improves the stability (in the sense that, ignoring the noise and the attack, the protocol would always succeed), but also benefits the privacy of the database (since the database will no more reveal additional secrets to the honest users). Furthermore, for the user's privacy, the proposed protocol is cheat sensitive, and for security of the database, we obtain an upper bound for the leaked information of the database in theory.

Finite-size analysis of continuous-variable measurement-device-independent quantum key distribution

NASA Astrophysics Data System (ADS)

Zhang, Xueying; Zhang, Yichen; Zhao, Yijia; Wang, Xiangyu; Yu, Song; Guo, Hong

2017-10-01

We study the impact of the finite-size effect on the continuous-variable measurement-device-independent quantum key distribution (CV-MDI QKD) protocol, mainly considering the finite-size effect on the parameter estimation procedure. The central-limit theorem and maximum likelihood estimation theorem are used to estimate the parameters. We also analyze the relationship between the number of exchanged signals and the optimal modulation variance in the protocol. It is proved that when Charlie's position is close to Bob, the CV-MDI QKD protocol has the farthest transmission distance in the finite-size scenario. Finally, we discuss the impact of finite-size effects related to the practical detection in the CV-MDI QKD protocol. The overall results indicate that the finite-size effect has a great influence on the secret-key rate of the CV-MDI QKD protocol and should not be ignored.

An Improved Protocol for Controlled Deterministic Secure Quantum Communication Using Five-Qubit Entangled State

NASA Astrophysics Data System (ADS)

Kao, Shih-Hung; Lin, Jason; Tsai, Chia-Wei; Hwang, Tzonelih

2018-03-01

In early 2009, Xiu et al. (Opt. Commun. 282(2) 333-337 2009) presented a controlled deterministic secure quantum communication (CDSQC) protocol via a newly constructed five-qubit entangled quantum state. Later, Qin et al. (Opt. Commun. 282(13), 2656-2658 2009) pointed out two security loopholes in Xiu et al.'s protocol: (1) A correlation-elicitation (CE) attack can reveal the entire secret message; (2) A leakage of partial information for the receiver is noticed. Then, Xiu et al. (Opt. Commun. 283(2), 344-347 2010) presented a revised CDSQC protocol to remedy the CE attack problem. However, the information leakage problem still remains open. This work proposes a new CDSQC protocol using the same five-qubit entangled state which can work without the above mentioned security problems. Moreover, the Trojan Horse attacks can be automatically avoided without using detecting devices in the new CDSQC.

An Improved Protocol for Controlled Deterministic Secure Quantum Communication Using Five-Qubit Entangled State

NASA Astrophysics Data System (ADS)

Kao, Shih-Hung; Lin, Jason; Tsai, Chia-Wei; Hwang, Tzonelih

2018-06-01

In early 2009, Xiu et al. (Opt. Commun. 282(2) 333-337 2009) presented a controlled deterministic secure quantum communication (CDSQC) protocol via a newly constructed five-qubit entangled quantum state. Later, Qin et al. (Opt. Commun. 282(13), 2656-2658 2009) pointed out two security loopholes in Xiu et al.'s protocol: (1) A correlation-elicitation (CE) attack can reveal the entire secret message; (2) A leakage of partial information for the receiver is noticed. Then, Xiu et al. (Opt. Commun. 283(2), 344-347 2010) presented a revised CDSQC protocol to remedy the CE attack problem. However, the information leakage problem still remains open. This work proposes a new CDSQC protocol using the same five-qubit entangled state which can work without the above mentioned security problems. Moreover, the Trojan Horse attacks can be automatically avoided without using detecting devices in the new CDSQC.

Production of Functional Glucagon-Secreting α-Cells From Human Embryonic Stem Cells

PubMed Central

Rezania, Alireza; Riedel, Michael J.; Wideman, Rhonda D.; Karanu, Francis; Ao, Ziliang; Warnock, Garth L.; Kieffer, Timothy J.

2011-01-01

OBJECTIVE Differentiation of human embryonic stem (hES) cells to fully developed cell types holds great therapeutic promise. Despite significant progress, the conversion of hES cells to stable, fully differentiated endocrine cells that exhibit physiologically regulated hormone secretion has not yet been achieved. Here we describe an efficient differentiation protocol for the in vitro conversion of hES cells to functional glucagon-producing α- cells. RESEARCH DESIGN AND METHODS Using a combination of small molecule screening and empirical testing, we developed a six-stage differentiation protocol for creating functional α-cells. An extensive in vitro and in vivo characterization of the differentiated cells was performed. RESULTS A high rate of synaptophysin expression (>75%) and robust expression of glucagon and the α-cell transcription factor ARX was achieved. After a transient polyhormonal state in which cells coexpress glucagon and insulin, maturation in vitro or in vivo resulted in depletion of insulin and other β-cell markers with concomitant enrichment of α-cell markers. After transplantation, these cells secreted fully processed, biologically active glucagon in response to physiologic stimuli including prolonged fasting and amino acid challenge. Moreover, glucagon release from transplanted cells was sufficient to reduce demand for pancreatic glucagon, resulting in a significant decrease in pancreatic α-cell mass. CONCLUSIONS These results indicate that fully differentiated pancreatic endocrine cells can be created via stepwise differentiation of hES cells. These cells may serve as a useful screening tool for the identification of compounds that modulate glucagon secretion as well as those that promote the transdifferentiation of α-cells to β-cells. PMID:20971966

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

Cell synchrony and chromosomal protocols for somatic cells of cotton gossypium hirsutum

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

Van`t Hof, J.; Lamm, S.S.

1994-10-10

The intent of this pamphlet is to share information with others who are interested in useful protocols for cotton cytogenetics and cytology. The protocols described are a beginning effort and they are expected to be improved. All methods, results and data given pertain to cultivar MD 51ne. We are not satisfied with our results of in situ hybridization.

Experimentally feasible quantum-key-distribution scheme using qubit-like qudits and its comparison with existing qubit- and qudit-based protocols

NASA Astrophysics Data System (ADS)

Chau, H. F.; Wang, Qinan; Wong, Cardythy

2017-02-01

Recently, Chau [Phys. Rev. A 92, 062324 (2015), 10.1103/PhysRevA.92.062324] introduced an experimentally feasible qudit-based quantum-key-distribution (QKD) scheme. In that scheme, one bit of information is phase encoded in the prepared state in a 2n-dimensional Hilbert space in the form (|i > ±|j >) /√{2 } with n ≥2 . For each qudit prepared and measured in the same two-dimensional Hilbert subspace, one bit of raw secret key is obtained in the absence of transmission error. Here we show that by modifying the basis announcement procedure, the same experimental setup can generate n bits of raw key for each qudit prepared and measured in the same basis in the noiseless situation. The reason is that in addition to the phase information, each qudit also carries information on the Hilbert subspace used. The additional (n -1 ) bits of raw key comes from a clever utilization of this extra piece of information. We prove the unconditional security of this modified protocol and compare its performance with other existing provably secure qubit- and qudit-based protocols on market in the one-way classical communication setting. Interestingly, we find that for the case of n =2 , the secret key rate of this modified protocol using nondegenerate random quantum code to perform one-way entanglement distillation is equal to that of the six-state scheme.

Highly efficient gene transfer using a retroviral vector into murine T cells for preclinical chimeric antigen receptor-expressing T cell therapy

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

Kusabuka, Hotaka; Fujiwara, Kento; Tokunaga, Yusuke

Adoptive immunotherapy using chimeric antigen receptor-expressing T (CAR-T) cells has attracted attention as an efficacious strategy for cancer treatment. To prove the efficacy and safety of CAR-T cell therapy, the elucidation of immunological mechanisms underlying it in mice is required. Although a retroviral vector (Rv) is mainly used for the introduction of CAR to murine T cells, gene transduction efficiency is generally less than 50%. The low transduction efficiency causes poor precision in the functional analysis of CAR-T cells. We attempted to improve the Rv gene transduction protocol to more efficiently generate functional CAR-T cells by optimizing the period ofmore » pre-cultivation and antibody stimulation. In the improved protocol, gene transduction efficiency to murine T cells was more than 90%. In addition, almost all of the prepared murine T cells expressed CAR after puromycin selection. These CAR-T cells had antigen-specific cytotoxic activity and secreted multiple cytokines by antigen stimulation. We believe that our optimized gene transduction protocol for murine T cells contributes to the advancement of T cell biology and development of immunotherapy using genetically engineered T cells. - Highlights: • We established highly efficient gene transduction protocols for murine T cells. • CD8{sup +} CAR-T cells had antigen-specific cytotoxic activity. • CD4{sup +} CAR-T cells secreted multiple cytokines by antigen stimulation. • This finding can contribute to the development of T-cell biology and immunotherapy.« less

Efficient Group Coordination in Multicast Trees

DTIC Science & Technology

2001-01-01

describe a novel protocol to coordinate multipoint groupwork within the IP-multicast framework. The protocol supports Internet-wide coordination for large...and highly-interactive groupwork , relying on the dissemination of coordination directives among group members across a shared end-to-end multicast

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.

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.

Advanced orbiting systems test-bedding and protocol verification

NASA Technical Reports Server (NTRS)

Noles, James; De Gree, Melvin

1989-01-01

The Consultative Committee for Space Data Systems (CCSDS) has begun the development of a set of protocol recommendations for Advanced Orbiting Systems (SOS). The AOS validation program and formal definition of AOS protocols are reviewed, and the configuration control of the AOS formal specifications is summarized. Independent implementations of the AOS protocols by NASA and ESA are discussed, and cross-support/interoperability tests which will allow the space agencies of various countries to share AOS communication facilities are addressed.

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.

Meeting Submission Deadlines--A Shared Responsibility.

ERIC Educational Resources Information Center

Nachby, Andrew L.

1979-01-01

A research administrator is seen as one who provides an environment conducive to the performance of research by allowing the principal investigator to spend as little time as possible with administrative paperwork. A protocol routing sheet and a checklist for protocol submissions are provided. (MLW)

The U.S. Culture Collection Network Responding to the Requirements of the Nagoya Protocol on Access and Benefit Sharing

PubMed Central

Barker, Katharine B.; Barton, Hazel A.; Boundy-Mills, Kyria; Brown, Daniel R.; Coddington, Jonathan A.; Cook, Kevin; Desmeth, Philippe; Geiser, David; Glaeser, Jessie A.; Greene, Stephanie; Kang, Seogchan; Lomas, Michael W.; Melcher, Ulrich; Miller, Scott E.; Nobles, David R.; Owens, Kristina J.; Reichman, Jerome H.; da Silva, Manuela; Wertz, John; Whitworth, Cale; Smith, David

2017-01-01

ABSTRACT The U.S. Culture Collection Network held a meeting to share information about how culture collections are responding to the requirements of the recently enacted Nagoya Protocol on Access to Genetic Resources and the Fair and Equitable Sharing of Benefits Arising from their Utilization to the Convention on Biological Diversity (CBD). The meeting included representatives of many culture collections and other biological collections, the U.S. Department of State, U.S. Department of Agriculture, Secretariat of the CBD, interested scientific societies, and collection groups, including Scientific Collections International and the Global Genome Biodiversity Network. The participants learned about the policies of the United States and other countries regarding access to genetic resources, the definition of genetic resources, and the status of historical materials and genetic sequence information. Key topics included what constitutes access and how the CBD Access and Benefit-Sharing Clearing-House can help guide researchers through the process of obtaining Prior Informed Consent on Mutually Agreed Terms. U.S. scientists and their international collaborators are required to follow the regulations of other countries when working with microbes originally isolated outside the United States, and the local regulations required by the Nagoya Protocol vary by the country of origin of the genetic resource. Managers of diverse living collections in the United States described their holdings and their efforts to provide access to genetic resources. This meeting laid the foundation for cooperation in establishing a set of standard operating procedures for U.S. and international culture collections in response to the Nagoya Protocol. PMID:28811341

The U.S. Culture Collection Network Responding to the Requirements of the Nagoya Protocol on Access and Benefit Sharing.

PubMed

McCluskey, Kevin; Barker, Katharine B; Barton, Hazel A; Boundy-Mills, Kyria; Brown, Daniel R; Coddington, Jonathan A; Cook, Kevin; Desmeth, Philippe; Geiser, David; Glaeser, Jessie A; Greene, Stephanie; Kang, Seogchan; Lomas, Michael W; Melcher, Ulrich; Miller, Scott E; Nobles, David R; Owens, Kristina J; Reichman, Jerome H; da Silva, Manuela; Wertz, John; Whitworth, Cale; Smith, David

2017-08-15

The U.S. Culture Collection Network held a meeting to share information about how culture collections are responding to the requirements of the recently enacted Nagoya Protocol on Access to Genetic Resources and the Fair and Equitable Sharing of Benefits Arising from their Utilization to the Convention on Biological Diversity (CBD). The meeting included representatives of many culture collections and other biological collections, the U.S. Department of State, U.S. Department of Agriculture, Secretariat of the CBD, interested scientific societies, and collection groups, including Scientific Collections International and the Global Genome Biodiversity Network. The participants learned about the policies of the United States and other countries regarding access to genetic resources, the definition of genetic resources, and the status of historical materials and genetic sequence information. Key topics included what constitutes access and how the CBD Access and Benefit-Sharing Clearing-House can help guide researchers through the process of obtaining Prior Informed Consent on Mutually Agreed Terms. U.S. scientists and their international collaborators are required to follow the regulations of other countries when working with microbes originally isolated outside the United States, and the local regulations required by the Nagoya Protocol vary by the country of origin of the genetic resource. Managers of diverse living collections in the United States described their holdings and their efforts to provide access to genetic resources. This meeting laid the foundation for cooperation in establishing a set of standard operating procedures for U.S. and international culture collections in response to the Nagoya Protocol.

Acidic digestion in a teleost: postprandial and circadian pattern of gastric pH, pepsin activity, and pepsinogen and proton pump mRNAs expression.

PubMed

Yúfera, Manuel; Moyano, Francisco J; Astola, Antonio; Pousão-Ferreira, Pedro; Martínez-Rodríguez, Gonzalo

2012-01-01

Two different modes for regulation of stomach acid secretion have been described in vertebrates. Some species exhibit a continuous acid secretion maintaining a low gastric pH during fasting. Others, as some teleosts, maintain a neutral gastric pH during fasting while the hydrochloric acid is released only after the ingestion of a meal. Those different patterns seem to be closely related to specific feeding habits. However, our recent observations suggest that this acidification pattern could be modified by changes in daily feeding frequency and time schedule. The aim of this study was to advance in understanding the regulation mechanisms of stomach digestion and pattern of acid secretion in teleost fish. We have examined the postprandial pattern of gastric pH, pepsin activity, and mRNA expression for pepsinogen and proton pump in white seabream juveniles maintained under a light/dark 12/12 hours cycle and receiving only one morning meal. The pepsin activity was analyzed according to the standard protocol buffering at pH 2 and using the actual pH measured in the stomach. The results show how the enzyme precursor is permanently available while the hydrochloric acid, which activates the zymogen fraction, is secreted just after the ingestion of food. Results also reveal that analytical protocol at pH 2 notably overestimates true pepsin activity in fish stomach. The expression of the mRNA encoding pepsinogen and proton pump exhibited almost parallel patterns, with notable increases during the darkness period and sharp decreases just before the morning meal. These results indicate that white seabream uses the resting hours for recovering the mRNA stock that will be quickly used during the feeding process. Our data clearly shows that both daily illumination pattern and feeding time are involved at different level in the regulation of the secretion of digestive juices.

Network support for turn-taking in multimedia collaboration

NASA Astrophysics Data System (ADS)

Dommel, Hans-Peter; Garcia-Luna-Aceves, Jose J.

1997-01-01

The effectiveness of collaborative multimedia systems depends on the regulation of access to their shared resources, such as continuous media or instruments used concurrently by multiple parties. Existing applications use only simple protocols to mediate such resource contention. Their cooperative rules follow a strict agenda and are largely application-specific. The inherent problem of floor control lacks a systematic methodology. This paper presents a general model on floor control for correct, scalable, fine-grained and fair resource sharing that integrates user interaction with network conditions, and adaptation to various media types. The motion of turn-taking known from psycholinguistics in studies on discourse structure is adapted for this framework. Viewed as a computational analogy to speech communication, online collaboration revolves around dynamically allocated access permissions called floors. The control semantics of floors derives from concurrently control methodology. An explicit specification and verification of a novel distributed Floor Control Protocol are presented. Hosts assume sharing roles that allow for efficient dissemination of control information, agreeing on a floor holder which is granted mutually exclusive access to a resource. Performance analytic aspects of floor control protocols are also briefly discussed.

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

Quantum error correction assisted by two-way noisy communication

PubMed Central

Wang, Zhuo; Yu, Sixia; Fan, Heng; Oh, C. H.

2014-01-01

Pre-shared non-local entanglement dramatically simplifies and improves the performance of quantum error correction via entanglement-assisted quantum error-correcting codes (EAQECCs). However, even considering the noise in quantum communication only, the non-local sharing of a perfectly entangled pair is technically impossible unless additional resources are consumed, such as entanglement distillation, which actually compromises the efficiency of the codes. Here we propose an error-correcting protocol assisted by two-way noisy communication that is more easily realisable: all quantum communication is subjected to general noise and all entanglement is created locally without additional resources consumed. In our protocol the pre-shared noisy entangled pairs are purified simultaneously by the decoding process. For demonstration, we first present an easier implementation of the well-known EAQECC [[4, 1, 3; 1

Quantum error correction assisted by two-way noisy communication.

PubMed

Wang, Zhuo; Yu, Sixia; Fan, Heng; Oh, C H

2014-11-26

Pre-shared non-local entanglement dramatically simplifies and improves the performance of quantum error correction via entanglement-assisted quantum error-correcting codes (EAQECCs). However, even considering the noise in quantum communication only, the non-local sharing of a perfectly entangled pair is technically impossible unless additional resources are consumed, such as entanglement distillation, which actually compromises the efficiency of the codes. Here we propose an error-correcting protocol assisted by two-way noisy communication that is more easily realisable: all quantum communication is subjected to general noise and all entanglement is created locally without additional resources consumed. In our protocol the pre-shared noisy entangled pairs are purified simultaneously by the decoding process. For demonstration, we first present an easier implementation of the well-known EAQECC [[4, 1, 3; 1

Two Quantum Protocols for Oblivious Set-member Decision Problem

NASA Astrophysics Data System (ADS)

Shi, Run-Hua; Mu, Yi; Zhong, Hong; Cui, Jie; Zhang, Shun

2015-10-01

In this paper, we defined a new secure multi-party computation problem, called Oblivious Set-member Decision problem, which allows one party to decide whether a secret of another party belongs to his private set in an oblivious manner. There are lots of important applications of Oblivious Set-member Decision problem in fields of the multi-party collaborative computation of protecting the privacy of the users, such as private set intersection and union, anonymous authentication, electronic voting and electronic auction. Furthermore, we presented two quantum protocols to solve the Oblivious Set-member Decision problem. Protocol I takes advantage of powerful quantum oracle operations so that it needs lower costs in both communication and computation complexity; while Protocol II takes photons as quantum resources and only performs simple single-particle projective measurements, thus it is more feasible with the present technology.

Entropy uncertainty relations and stability of phase-temporal quantum cryptography with finite-length transmitted strings

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

Molotkov, S. N., E-mail: sergei.molotkov@gmail.com

2012-12-15

Any key-generation session contains a finite number of quantum-state messages, and it is there-fore important to understand the fundamental restrictions imposed on the minimal length of a string required to obtain a secret key with a specified length. The entropy uncertainty relations for smooth min and max entropies considerably simplify and shorten the proof of security. A proof of security of quantum key distribution with phase-temporal encryption is presented. This protocol provides the maximum critical error compared to other protocols up to which secure key distribution is guaranteed. In addition, unlike other basic protocols (of the BB84 type), which aremore » vulnerable with respect to an attack by 'blinding' of avalanche photodetectors, this protocol is stable with respect to such an attack and guarantees key security.« less

Two Quantum Protocols for Oblivious Set-member Decision Problem

PubMed Central

Shi, Run-hua; Mu, Yi; Zhong, Hong; Cui, Jie; Zhang, Shun

2015-01-01

In this paper, we defined a new secure multi-party computation problem, called Oblivious Set-member Decision problem, which allows one party to decide whether a secret of another party belongs to his private set in an oblivious manner. There are lots of important applications of Oblivious Set-member Decision problem in fields of the multi-party collaborative computation of protecting the privacy of the users, such as private set intersection and union, anonymous authentication, electronic voting and electronic auction. Furthermore, we presented two quantum protocols to solve the Oblivious Set-member Decision problem. Protocol I takes advantage of powerful quantum oracle operations so that it needs lower costs in both communication and computation complexity; while Protocol II takes photons as quantum resources and only performs simple single-particle projective measurements, thus it is more feasible with the present technology. PMID:26514668

Two Quantum Protocols for Oblivious Set-member Decision Problem.

PubMed

Shi, Run-Hua; Mu, Yi; Zhong, Hong; Cui, Jie; Zhang, Shun

2015-10-30

In this paper, we defined a new secure multi-party computation problem, called Oblivious Set-member Decision problem, which allows one party to decide whether a secret of another party belongs to his private set in an oblivious manner. There are lots of important applications of Oblivious Set-member Decision problem in fields of the multi-party collaborative computation of protecting the privacy of the users, such as private set intersection and union, anonymous authentication, electronic voting and electronic auction. Furthermore, we presented two quantum protocols to solve the Oblivious Set-member Decision problem. Protocol I takes advantage of powerful quantum oracle operations so that it needs lower costs in both communication and computation complexity; while Protocol II takes photons as quantum resources and only performs simple single-particle projective measurements, thus it is more feasible with the present technology.

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 .

XDS-I Gateway Development for HIE Connectivity with Legacy PACS at Gil Hospital.

PubMed

Simalango, Mikael Fernandus; Kim, Youngchul; Seo, Young Tae; Choi, Young Hwan; Cho, Yong Kyun

2013-12-01

The ability to support healthcare document sharing is imperative in a health information exchange (HIE). Sharing imaging documents or images, however, can be challenging, especially when they are stored in a picture archiving and communication system (PACS) archive that does not support document sharing via standard HIE protocols. This research proposes a standard-compliant imaging gateway that enables connectivity between a legacy PACS and the entire HIE. Investigation of the PACS solutions used at Gil Hospital was conducted. An imaging gateway application was then developed using a Java technology stack. Imaging document sharing capability enabled by the gateway was tested by integrating it into Gil Hospital's order communication system and its HIE infrastructure. The gateway can acquire radiology images from a PACS storage system, provide and register the images to Gil Hospital's HIE for document sharing purposes, and make the images retrievable by a cross-enterprise document sharing document viewer. Development of an imaging gateway that mediates communication between a PACS and an HIE can be considered a viable option when the PACS does not support the standard protocol for cross-enterprise document sharing for imaging. Furthermore, the availability of common HIE standards expedites the development and integration of the imaging gateway with an HIE.

XDS-I Gateway Development for HIE Connectivity with Legacy PACS at Gil Hospital

PubMed Central

Simalango, Mikael Fernandus; Kim, Youngchul; Seo, Young Tae; Cho, Yong Kyun

2013-01-01

Objectives The ability to support healthcare document sharing is imperative in a health information exchange (HIE). Sharing imaging documents or images, however, can be challenging, especially when they are stored in a picture archiving and communication system (PACS) archive that does not support document sharing via standard HIE protocols. This research proposes a standard-compliant imaging gateway that enables connectivity between a legacy PACS and the entire HIE. Methods Investigation of the PACS solutions used at Gil Hospital was conducted. An imaging gateway application was then developed using a Java technology stack. Imaging document sharing capability enabled by the gateway was tested by integrating it into Gil Hospital's order communication system and its HIE infrastructure. Results The gateway can acquire radiology images from a PACS storage system, provide and register the images to Gil Hospital's HIE for document sharing purposes, and make the images retrievable by a cross-enterprise document sharing document viewer. Conclusions Development of an imaging gateway that mediates communication between a PACS and an HIE can be considered a viable option when the PACS does not support the standard protocol for cross-enterprise document sharing for imaging. Furthermore, the availability of common HIE standards expedites the development and integration of the imaging gateway with an HIE. PMID:24523994

Optimization of a human IgG B-cell ELISpot assay for the analysis of vaccine-induced B-cell responses.

PubMed

Jahnmatz, Maja; Kesa, Gun; Netterlid, Eva; Buisman, Anne-Marie; Thorstensson, Rigmor; Ahlborg, Niklas

2013-05-31

B-cell responses after infection or vaccination are often measured as serum titers of antigen-specific antibodies. Since this does not address the aspect of memory B-cell activity, it may not give a complete picture of the B-cell response. Analysis of memory B cells by ELISpot is therefore an important complement to conventional serology. B-cell ELISpot was developed more than 25 years ago and many assay protocols/reagents would benefit from optimization. We therefore aimed at developing an optimized B-cell ELISpot for the analysis of vaccine-induced human IgG-secreting memory B cells. A protocol was developed based on new monoclonal antibodies to human IgG and biotin-avidin amplification to increase the sensitivity. After comparison of various compounds commonly used to in vitro-activate memory B cells for ELISpot analysis, the TLR agonist R848 plus interleukin (IL)-2 was selected as the most efficient activator combination. The new protocol was subsequently compared to an established protocol, previously used in vaccine studies, based on polyclonal antibodies without biotin avidin amplification and activation of memory B-cells using a mix of antigen, CpG, IL-2 and IL-10. The new protocol displayed significantly better detection sensitivity, shortened the incubation time needed for the activation of memory B cells and reduced the amount of antigen required for the assay. The functionality of the new protocol was confirmed by analyzing specific memory B cells to five different antigens, induced in a limited number of subjects vaccinated against tetanus, diphtheria and pertussis. The limited number of subjects did not allow for a direct comparison with other vaccine studies. Optimization of the B-cell ELISpot will facilitate an improved analysis of IgG-secreting B cells in vaccine studies. Copyright © 2013 Elsevier B.V. All rights reserved.

Multiparty quantum key agreement protocol based on locally indistinguishable orthogonal product states

NASA Astrophysics Data System (ADS)

Jiang, Dong-Huan; Xu, Guang-Bao

2018-07-01

Based on locally indistinguishable orthogonal product states, we propose a novel multiparty quantum key agreement (QKA) protocol. In this protocol, the private key information of each party is encoded as some orthogonal product states that cannot be perfectly distinguished by local operations and classical communications. To ensure the security of the protocol with small amount of decoy particles, the different particles of each product state are transmitted separately. This protocol not only can make each participant fairly negotiate a shared key, but also can avoid information leakage in the maximum extent. We give a detailed security proof of this protocol. From comparison result with the existing QKA protocols, we can know that the new protocol is more efficient.

Steganography and Cryptography Inspired Enhancement of Introductory Programming Courses

ERIC Educational Resources Information Center

Kortsarts, Yana; Kempner, Yulia

2015-01-01

Steganography is the art and science of concealing communication. The goal of steganography is to hide the very existence of information exchange by embedding messages into unsuspicious digital media covers. Cryptography, or secret writing, is the study of the methods of encryption, decryption and their use in communications protocols.…

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.

[Pituitary gland tumors].

PubMed

Jesser, J; Schlamp, K; Bendszus, M

2014-10-01

This article gives an overview of the most common tumors of the pituitary gland and the differential diagnostics with special emphasis on radiological diagnostic criteria. A selective search of the literature in PubMed was carried out. Pituitary adenomas constitute 10-15% of all intracranial tumors and are the most common tumors of the sellar region. Tumors smaller than 1 cm in diameter are called microadenomas while those larger than 1 cm in diameter are called macroadenomas. Approximately 65% of pituitary gland adenomas secrete hormones whereby approximately 50% secrete prolactin, 10% secrete growth hormone (somatotropin) and 6% secrete corticotropin. Other tumors located in the sella turcica can also cause endocrinological symptoms, such as an oversecretion of pituitary hormone or pituitary insufficiency by impinging on the pituitary gland or its stalk. When tumors spread into the space cranial to the sella turcica, they can impinge on the optic chiasm and cause visual disorders. A common differential diagnosis of a sellar tumor is a craniopharyngeoma. In children up to 10% of all intracranial tumors are craniopharyngeomas. Other differential diagnoses for sellar tumors are metastases, meningiomas, epidermoids and in rare cases astrocytomas, germinomas or Rathke cleft cysts As these tumors are located in an anatomically complex region of the skull base and are often very small, a highly focused imaging protocol is required. The currently favored modality is magnetic resonance imaging (MRI) with the administration of a contrast agent. The sellar region should be mapped in thin slices. In cases of suspected microadenoma the imaging protocol should also contain a sequence with dynamic contrast administration in order to assess the specific enhancement characteristics of the tumor and the pituitary gland.

Corticosteroid-Induced MKP-1 Represses Pro-Inflammatory Cytokine Secretion by Enhancing Activity of Tristetraprolin (TTP) in ASM Cells.

PubMed

Prabhala, Pavan; Bunge, Kristin; Ge, Qi; Ammit, Alaina J

2016-10-01

Exaggerated cytokine secretion drives pathogenesis of a number of chronic inflammatory diseases, including asthma. Anti-inflammatory pharmacotherapies, including corticosteroids, are front-line therapies and although they have proven clinical utility, the molecular mechanisms responsible for their actions are not fully understood. The corticosteroid-inducible gene, mitogen-activated protein kinase (MAPK) phosphatase 1 (MKP-1, DUSP1) has emerged as a key molecule responsible for the repressive effects of steroids. MKP-1 is known to deactivate p38 MAPK phosphorylation and can control the expression and activity of the mRNA destabilizing protein-tristetraprolin (TTP). But whether corticosteroid-induced MKP-1 acts via p38 MAPK-mediated modulation of TTP function in a pivotal airway cell type, airway smooth muscle (ASM), was unknown. While pretreatment of ASM cells with the corticosteroid dexamethasone (preventative protocol) is known to reduce ASM synthetic function in vitro, the impact of adding dexamethasone after stimulation (therapeutic protocol) had not been explored. Whether dexamethasone modulates TTP in a p38 MAPK-dependent manner in this cell type was also unknown. We address this herein and utilize an in vitro model of asthmatic inflammation where ASM cells were stimulated with the pro-asthmatic cytokine tumor necrosis factor (TNF) and the impact of adding dexamethasone 1 h after stimulation assessed. IL-6 mRNA expression and protein secretion was significantly repressed by dexamethasone acting in a temporally distinct manner to increase MKP-1, deactivate p38 MAPK, and modulate TTP phosphorylation status. In this way, dexamethasone-induced MKP-1 acts via p38 MAPK to switch on the mRNA destabilizing function of TTP to repress pro-inflammatory cytokine secretion from ASM cells. J. Cell. Physiol. 231: 2153-2158, 2016. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

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...

Single-cell analysis and sorting using droplet-based microfluidics.

PubMed

Mazutis, Linas; Gilbert, John; Ung, W Lloyd; Weitz, David A; Griffiths, Andrew D; Heyman, John A

2013-05-01

We present a droplet-based microfluidics protocol for high-throughput analysis and sorting of single cells. Compartmentalization of single cells in droplets enables the analysis of proteins released from or secreted by cells, thereby overcoming one of the major limitations of traditional flow cytometry and fluorescence-activated cell sorting. As an example of this approach, we detail a binding assay for detecting antibodies secreted from single mouse hybridoma cells. Secreted antibodies are detected after only 15 min by co-compartmentalizing single mouse hybridoma cells, a fluorescent probe and single beads coated with anti-mouse IgG antibodies in 50-pl droplets. The beads capture the secreted antibodies and, when the captured antibodies bind to the probe, the fluorescence becomes localized on the beads, generating a clearly distinguishable fluorescence signal that enables droplet sorting at ∼200 Hz as well as cell enrichment. The microfluidic system described is easily adapted for screening other intracellular, cell-surface or secreted proteins and for quantifying catalytic or regulatory activities. In order to screen ∼1 million cells, the microfluidic operations require 2-6 h; the entire process, including preparation of microfluidic devices and mammalian cells, requires 5-7 d.

Single-cell analysis and sorting using droplet-based microfluidics

PubMed Central

Mazutis, Linas; Gilbert, John; Ung, W Lloyd; Weitz, David A; Griffiths, Andrew D; Heyman, John A

2014-01-01

We present a droplet-based microfluidics protocol for high-throughput analysis and sorting of single cells. compartmentalization of single cells in droplets enables the analysis of proteins released from or secreted by cells, thereby overcoming one of the major limitations of traditional flow cytometry and fluorescence-activated cell sorting. as an example of this approach, we detail a binding assay for detecting antibodies secreted from single mouse hybridoma cells. secreted antibodies are detected after only 15 min by co-compartmentalizing single mouse hybridoma cells, a fluorescent probe and single beads coated with anti-mouse IgG antibodies in 50-pl droplets. the beads capture the secreted antibodies and, when the captured antibodies bind to the probe, the fluorescence becomes localized on the beads, generating a clearly distinguishable fluorescence signal that enables droplet sorting at ~200 Hz as well as cell enrichment. the microfluidic system described is easily adapted for screening other intracellular, cell-surface or secreted proteins and for quantifying catalytic or regulatory activities. In order to screen ~1 million cells, the microfluidic operations require 2–6 h; the entire process, including preparation of microfluidic devices and mammalian cells, requires 5–7 d. PMID:23558786

Plug into a Network.

ERIC Educational Resources Information Center

Vander Linden, Doug; Clark, Larry

1994-01-01

Stand-alone, single-user software programs for classroom use can be prohibitively expensive, compared to information-sharing network systems. Based on a Kansas district's experience, this article explains three types of networks (device-sharing, operating-system-based, and client-server-based) and discusses network protocols, software choices,…

Armenian Virtual Observatory: Services and Data Sharing

NASA Astrophysics Data System (ADS)

Knyazyan, A. V.; Astsatryan, H. V.; Mickaelian, A. M.

2016-06-01

The main aim of this article is to introduce the data management and services of the Armenian Virtual Observatory (ArVO), which consists of user friendly data management mechanisms, a new and productive cross-correlation service, and data sharing API based on international standards and protocols.

The effectiveness and cost-effectiveness of shared care: protocol for a realist review.

PubMed

Hardwick, Rebecca; Pearson, Mark; Byng, Richard; Anderson, Rob

2013-02-12

Shared care (an enhanced information exchange over and above routine outpatient letters) is commonly used to improve care coordination and communication between a specialist and primary care services for people with long-term conditions. Evidence of the effectiveness and cost-effectiveness of shared care is mixed. Informed decision-making for targeting shared care requires a greater understanding of how it works, for whom it works, in what contexts and why. This protocol outlines how realist review methods can be used to synthesise evidence on shared care for long-term conditions.A further aim of the review is to explore economic evaluations of shared care. Economic evaluations are difficult to synthesise due to problems in accounting for contextual differences that impact on resource use and opportunity costs. Realist review methods have been suggested as a way to overcome some of these issues, so this review will also assess whether realist review methods are amenable to synthesising economic evidence. Database and web searching will be carried out in order to find relevant evidence to develop and test programme theories about how shared care works. The review will have two phases. Phase 1 will concentrate on the contextual conditions and mechanisms that influence how shared care works, in order to develop programme theories, which partially explain how it works. Phase 2 will focus on testing these programme theories. A Project Reference Group made up of health service professionals and people with actual experience of long-term conditions will be used to ground the study in real-life experience. Review findings will be disseminated through local and sub-national networks for integrated care and long-term conditions. This realist review will explore why and for whom shared care works, in order to support decision-makers working to improve the effectiveness of care for people outside hospital. The development of realist review methods to take into account cost and cost-effectiveness evidence is particularly innovative and challenging, and if successful will offer a new approach to synthesising economic evidence. This systematic review protocol is registered on the PROSPERO database (registration number: CRD42012002842).

Extended analysis of the Trojan-horse attack in quantum key distribution

NASA Astrophysics Data System (ADS)

Vinay, Scott E.; Kok, Pieter

2018-04-01

The discrete-variable quantum key distribution protocols based on the 1984 protocol of Bennett and Brassard (BB84) are known to be secure against an eavesdropper, Eve, intercepting the flying qubits and performing any quantum operation on them. However, these protocols may still be vulnerable to side-channel attacks. We investigate the Trojan-horse side-channel attack where Eve sends her own state into Alice's apparatus and measures the reflected state to estimate the key. We prove that the separable coherent state is optimal for Eve among the class of multimode Gaussian attack states, even in the presence of thermal noise. We then provide a bound on the secret key rate in the case where Eve may use any separable state.

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.

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.

Melanins and melanogenesis: methods, standards, protocols.

PubMed

d'Ischia, Marco; Wakamatsu, Kazumasa; Napolitano, Alessandra; Briganti, Stefania; Garcia-Borron, José-Carlos; Kovacs, Daniela; Meredith, Paul; Pezzella, Alessandro; Picardo, Mauro; Sarna, Tadeusz; Simon, John D; Ito, Shosuke

2013-09-01

Despite considerable advances in the past decade, melanin research still suffers from the lack of universally accepted and shared nomenclature, methodologies, and structural models. This paper stems from the joint efforts of chemists, biochemists, physicists, biologists, and physicians with recognized and consolidated expertise in the field of melanins and melanogenesis, who critically reviewed and experimentally revisited methods, standards, and protocols to provide for the first time a consensus set of recommended procedures to be adopted and shared by researchers involved in pigment cell research. The aim of the paper was to define an unprecedented frame of reference built on cutting-edge knowledge and state-of-the-art methodology, to enable reliable comparison of results among laboratories and new progress in the field based on standardized methods and shared information. © 2013 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

A secure RFID authentication protocol adopting error correction code.

PubMed

Chen, Chien-Ming; Chen, Shuai-Min; Zheng, Xinying; Chen, Pei-Yu; Sun, Hung-Min

2014-01-01

RFID technology has become popular in many applications; however, most of the RFID products lack security related functionality due to the hardware limitation of the low-cost RFID tags. In this paper, we propose a lightweight mutual authentication protocol adopting error correction code for RFID. Besides, we also propose an advanced version of our protocol to provide key updating. Based on the secrecy of shared keys, the reader and the tag can establish a mutual authenticity relationship. Further analysis of the protocol showed that it also satisfies integrity, forward secrecy, anonymity, and untraceability. Compared with other lightweight protocols, the proposed protocol provides stronger resistance to tracing attacks, compromising attacks and replay attacks. We also compare our protocol with previous works in terms of performance.

A Secure RFID Authentication Protocol Adopting Error Correction Code

PubMed Central

Zheng, Xinying; Chen, Pei-Yu

2014-01-01

RFID technology has become popular in many applications; however, most of the RFID products lack security related functionality due to the hardware limitation of the low-cost RFID tags. In this paper, we propose a lightweight mutual authentication protocol adopting error correction code for RFID. Besides, we also propose an advanced version of our protocol to provide key updating. Based on the secrecy of shared keys, the reader and the tag can establish a mutual authenticity relationship. Further analysis of the protocol showed that it also satisfies integrity, forward secrecy, anonymity, and untraceability. Compared with other lightweight protocols, the proposed protocol provides stronger resistance to tracing attacks, compromising attacks and replay attacks. We also compare our protocol with previous works in terms of performance. PMID:24959619

High-capacity quantum secure direct communication with two-photon six-qubit hyperentangled states

NASA Astrophysics Data System (ADS)

Wu, FangZhou; Yang, GuoJian; Wang, HaiBo; Xiong, Jun; Alzahrani, Faris; Hobiny, Aatef; Deng, FuGuo

2017-12-01

This study proposes the first high-capacity quantum secure direct communication (QSDC) with two-photon six-qubit hyper-entangled Bell states in two longitudinal momentum and polarization degrees of freedom (DOFs) of photon pairs, which can be generated using two 0.5 mm-thick type-I β barium borate crystal slabs aligned one behind the other and an eight-hole screen. The secret message can be independently encoded on the photon pairs with 64 unitary operations in all three DOFs. This protocol has a higher capacity than previous QSDC protocols because each photon pair can carry 6 bits of information, not just 2 or 4 bits. Our QSDC protocol decreases the influence of decoherence from environment noise by exploiting the decoy photons to check the security of the transmission of the first photon sequence. Compared with two-way QSDC protocols, our QSDC protocol is immune to an attack by an eavesdropper using Trojan horse attack strategies because it is a one-way quantum communication. The QSDC protocol has good applications in the future quantum communication because of all these features.

Robust and Reusable Fuzzy Extractors

NASA Astrophysics Data System (ADS)

Boyen, Xavier

The use of biometric features as key material in security protocols has often been suggested to relieve their owner from the need to remember long cryptographic secrets. The appeal of biometric data as cryptographic secrets stems from their high apparent entropy, their availability to their owner, and their relative immunity to loss. In particular, they constitute a very effective basis for user authentication, especially when combined with complementary credentials such as a short memorized password or a physical token. However, the use of biometrics in cryptography does not come without problems. Some difficulties are technical, such as the lack of uniformity and the imperfect reproducibility of biometrics, but some challenges are more fundamental.

Six-State Quantum Key Distribution Using Photons with Orbital Angular Momentum

NASA Astrophysics Data System (ADS)

Li, Jun-Lin; Wang, Chuan

2010-11-01

A new implementation of high-dimensional quantum key distribution (QKD) protocol is discussed. Using three mutual unbiased bases, we present a d-level six-state QKD protocol that exploits the orbital angular momentum with the spatial mode of the light beam. The protocol shows that the feature of a high capacity since keys are encoded using photon modes in d-level Hilbert space. The devices for state preparation and measurement are also discussed. This protocol has high security and the alignment of shared reference frames is not needed between sender and receiver.

Robust quantum secure direct communication and authentication protocol against decoherence noise based on six-qubit DF state

NASA Astrophysics Data System (ADS)

Chang, Yan; Zhang, Shi-Bin; Yan, Li-Li; Han, Gui-Hua

2015-05-01

By using six-qubit decoherence-free (DF) states as quantum carriers and decoy states, a robust quantum secure direct communication and authentication (QSDCA) protocol against decoherence noise is proposed. Four six-qubit DF states are used in the process of secret transmission, however only the |0‧⟩ state is prepared. The other three six-qubit DF states can be obtained by permuting the outputs of the setup for |0‧⟩. By using the |0‧⟩ state as the decoy state, the detection rate and the qubit error rate reach 81.3%, and they will not change with the noise level. The stability and security are much higher than those of the ping-pong protocol both in an ideal scenario and a decoherence noise scenario. Even if the eavesdropper measures several qubits, exploiting the coherent relationship between these qubits, she can gain one bit of secret information with probability 0.042. Project supported by the National Natural Science Foundation of China (Grant No. 61402058), the Science and Technology Support Project of Sichuan Province of China (Grant No. 2013GZX0137), the Fund for Young Persons Project of Sichuan Province of China (Grant No. 12ZB017), and the Foundation of Cyberspace Security Key Laboratory of Sichuan Higher Education Institutions, China (Grant No. szjj2014-074).

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.

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.

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.

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.

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

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.

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

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.

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

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).

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.

Protocols for distributive scheduling

NASA Technical Reports Server (NTRS)

Richards, Stephen F.; Fox, Barry

1993-01-01

The increasing complexity of space operations and the inclusion of interorganizational and international groups in the planning and control of space missions lead to requirements for greater communication, coordination, and cooperation among mission schedulers. These schedulers must jointly allocate scarce shared resources among the various operational and mission oriented activities while adhering to all constraints. This scheduling environment is complicated by such factors as the presence of varying perspectives and conflicting objectives among the schedulers, the need for different schedulers to work in parallel, and limited communication among schedulers. Smooth interaction among schedulers requires the use of protocols that govern such issues as resource sharing, authority to update the schedule, and communication of updates. This paper addresses the development and characteristics of such protocols and their use in a distributed scheduling environment that incorporates computer-aided scheduling tools. An example problem is drawn from the domain of space shuttle mission planning.

Distributed project scheduling at NASA: Requirements for manual protocols and computer-based support

NASA Technical Reports Server (NTRS)

Richards, Stephen F.

1992-01-01

The increasing complexity of space operations and the inclusion of interorganizational and international groups in the planning and control of space missions lead to requirements for greater communication, coordination, and cooperation among mission schedulers. These schedulers must jointly allocate scarce shared resources among the various operational and mission oriented activities while adhering to all constraints. This scheduling environment is complicated by such factors as the presence of varying perspectives and conflicting objectives among the schedulers, the need for different schedulers to work in parallel, and limited communication among schedulers. Smooth interaction among schedulers requires the use of protocols that govern such issues as resource sharing, authority to update the schedule, and communication of updates. This paper addresses the development and characteristics of such protocols and their use in a distributed scheduling environment that incorporates computer-aided scheduling tools. An example problem is drawn from the domain of Space Shuttle mission planning.

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.

GLobal Integrated Design Environment (GLIDE): A Concurrent Engineering Application

NASA Technical Reports Server (NTRS)

McGuire, Melissa L.; Kunkel, Matthew R.; Smith, David A.

2010-01-01

The GLobal Integrated Design Environment (GLIDE) is a client-server software application purpose-built to mitigate issues associated with real time data sharing in concurrent engineering environments and to facilitate discipline-to-discipline interaction between multiple engineers and researchers. GLIDE is implemented in multiple programming languages utilizing standardized web protocols to enable secure parameter data sharing between engineers and researchers across the Internet in closed and/or widely distributed working environments. A well defined, HyperText Transfer Protocol (HTTP) based Application Programming Interface (API) to the GLIDE client/server environment enables users to interact with GLIDE, and each other, within common and familiar tools. One such common tool, Microsoft Excel (Microsoft Corporation), paired with its add-in API for GLIDE, is discussed in this paper. The top-level examples given demonstrate how this interface improves the efficiency of the design process of a concurrent engineering study while reducing potential errors associated with manually sharing information between study participants.

An adaptive transmission protocol for managing dynamic shared states in collaborative surgical simulation.

PubMed

Qin, J; Choi, K S; Ho, Simon S M; Heng, P A

2008-01-01

A force prediction algorithm is proposed to facilitate virtual-reality (VR) based collaborative surgical simulation by reducing the effect of network latencies. State regeneration is used to correct the estimated prediction. This algorithm is incorporated into an adaptive transmission protocol in which auxiliary features such as view synchronization and coupling control are equipped to ensure the system consistency. We implemented this protocol using multi-threaded technique on a cluster-based network architecture.

Dutch Protocols for Deliberately Ending the Life of Newborns: A Defence.

PubMed

Tedesco, Matthew

2017-06-01

The Groningen Protocol, introduced in the Netherlands in 2005 and accompanied by revised guidelines published in a report commissioned by the Royal Dutch Medical Association in 2014, specifies conditions under which the lives of severely ill newborns may be deliberately ended. Its publication came four years after the Netherlands became the first nation to legalize the voluntary active euthanasia of adults, and the Netherlands remains the only country to offer a pathway to protecting physicians who might engage in deliberately ending the life of a newborn (DELN). In this paper, I offer two lines of argument. The first is a positive argument for the Protocol, grounded in the good of the newborn as unanimously determined by those in a position to determine it. The second addresses the widely shared belief that the killing of newborns is morally prohibited, where I offer two arguments-one grounded in the fact that the kinds of cases the Protocol is meant to govern are very rare and highly unusual, and the other focused more broadly on the role of pre-theoretical beliefs in moral reasoning-meant to undermine the strong role that the critic of the Protocol affords this belief. I argue that, given this second line of argument, the beliefs underlying my positive argument for the Protocol are in fact more secure than the widely shared belief underlying the critic's position.

Coexistence of WiFi and WiMAX systems based on PS-request protocols.

PubMed

Kim, Jongwoo; Park, Suwon; Rhee, Seung Hyong; Choi, Yong-Hoon; Chung, Young-uk; Hwang, Ho Young

2011-01-01

We introduce both the coexistence zone within the WiMAX frame structure and a PS-Request protocol for the coexistence of WiFi and WiMAX systems sharing a frequency band. Because we know that the PS-Request protocol has drawbacks, we propose a revised PS-Request protocol to improve the performance. Two PS-Request protocols are based on the time division operation (TDO) of WiFi system and WiMAX system to avoid the mutual interference, and use the vestigial power management (PwrMgt) bit within the Frame Control field of the frames transmitted by a WiFi AP. The performance of the revised PS-Request protocol is evaluated by computer simulation, and compared to those of the cases without a coexistence protocol and to the original PS-Request protocol.

Deterministic entanglement distillation for secure double-server blind quantum computation.

PubMed

Sheng, Yu-Bo; Zhou, Lan

2015-01-15

Blind quantum computation (BQC) provides an efficient method for the client who does not have enough sophisticated technology and knowledge to perform universal quantum computation. The single-server BQC protocol requires the client to have some minimum quantum ability, while the double-server BQC protocol makes the client's device completely classical, resorting to the pure and clean Bell state shared by two servers. Here, we provide a deterministic entanglement distillation protocol in a practical noisy environment for the double-server BQC protocol. This protocol can get the pure maximally entangled Bell state. The success probability can reach 100% in principle. The distilled maximally entangled states can be remaind to perform the BQC protocol subsequently. The parties who perform the distillation protocol do not need to exchange the classical information and they learn nothing from the client. It makes this protocol unconditionally secure and suitable for the future BQC protocol.

Deterministic entanglement distillation for secure double-server blind quantum computation

PubMed Central

Sheng, Yu-Bo; Zhou, Lan

2015-01-01

Blind quantum computation (BQC) provides an efficient method for the client who does not have enough sophisticated technology and knowledge to perform universal quantum computation. The single-server BQC protocol requires the client to have some minimum quantum ability, while the double-server BQC protocol makes the client's device completely classical, resorting to the pure and clean Bell state shared by two servers. Here, we provide a deterministic entanglement distillation protocol in a practical noisy environment for the double-server BQC protocol. This protocol can get the pure maximally entangled Bell state. The success probability can reach 100% in principle. The distilled maximally entangled states can be remaind to perform the BQC protocol subsequently. The parties who perform the distillation protocol do not need to exchange the classical information and they learn nothing from the client. It makes this protocol unconditionally secure and suitable for the future BQC protocol. PMID:25588565

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

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

Sleepiness and Cognitive Performance among Younger and Older Adolescents across a 28-Hour Forced Desynchrony Protocol.

PubMed

Wu, Lora J; Acebo, Christine; Seifer, Ronald; Carskadon, Mary A

2015-12-01

Quantify the homeostatic and circadian effects on sleepiness and performance of adolescents. Examine age-related changes in homeostatic and circadian regulation of sleepiness and performance by comparing younger and older adolescent groups. Three-week laboratory study including 12 cycles of a 28-h forced desynchrony protocol. Controlled laboratory environment with individual sleep and performance testing rooms and shared common areas. Twenty-seven healthy adolescents including 16 females. Ages ranged from 9.6-15.2 years and participants were split into younger (n = 14 ages 9-12) and older (n = 13 ages 13-15) groups based on median age split of 13.0 years. N/A. Testing occurred every 2 h during scheduled wake periods. Measures included sleep latency during repeated nap opportunities and scores from a computerized neurobehavioral assessment battery including a 10-min psychomotor vigilance task, a digit symbol substitution task, and the Karolinska Sleepiness Scale. Significant main effects of circadian and homeostatic factors were observed, as well as several circadian and homeostatic interaction effects. Age group did not have a significant main effect on sleep and performance data. A significant interaction of circadian phase and age group was found for sleep latency, with younger adolescents showing greater circadian modulation than older teens during the circadian night. Adolescents demonstrated a similar pattern of response to forced desynchrony as reported for adults. Sleepiness and performance were affected by homeostatic and circadian factors, and age group did not interact with homoeostatic and circadian factors for subjective sleepiness and most performance metrics. Younger adolescents had a shorter latency to sleep onset than older during the circadian bin spanning 4 to 8 h after the onset of melatonin secretion. © 2015 Associated Professional Sleep Societies, LLC.

Access and benefit sharing: Best practices for the use and exchange of invertebrate biological control agents

USDA-ARS?s Scientific Manuscript database

The Convention on Biological Diversity (CBD) acknowledges the sovereign rights that countries have over their ‘genetic resources’. The Nagoya Protocol that came into force in 2014 provides a framework for implementation of and equitable process by which access to, and sharing of benefits between don...

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

Threat Assessment Teams Target School Crisis

ERIC Educational Resources Information Center

Stover, Del

2005-01-01

In this article, the author discusses the creation of a threat-assessment team to be utilized in order to analyze each threat and the usage of threat-assessment protocols for the purpose of guiding school administrators through a crisis. These are actually developed with the advice from the US Department of Education and the Secret Service. When a…

Measurement of backbone hydrogen-deuterium exchange in the type III secretion system needle protein PrgI by solid-state NMR

NASA Astrophysics Data System (ADS)

Chevelkov, Veniamin; Giller, Karin; Becker, Stefan; Lange, Adam

2017-10-01

In this report we present site-specific measurements of amide hydrogen-deuterium exchange rates in a protein in the solid state phase by MAS NMR. Employing perdeuteration, proton detection and a high external magnetic field we could adopt the highly efficient Relax-EXSY protocol previously developed for liquid state NMR. According to this method, we measured the contribution of hydrogen exchange on apparent 15N longitudinal relaxation rates in samples with differing D2O buffer content. Differences in the apparent T1 times allowed us to derive exchange rates for multiple residues in the type III secretion system needle protein.

On Alarm Protocol in Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Cichoń, Jacek; Kapelko, Rafał; Lemiesz, Jakub; Zawada, Marcin

We consider the problem of efficient alarm protocol for ad-hoc radio networks consisting of devices that try to gain access for transmission through a shared radio communication channel. The problem arise in tasks that sensors have to quickly inform the target user about an alert situation such as presence of fire, dangerous radiation, seismic vibrations, and more. In this paper, we present a protocol which uses O(logn) time slots and show that Ω(logn/loglogn) is a lower bound for used time slots.

Low-cost Cognitive Electronics Technology for Enhanced Communications and Situational Awareness for Networks of Small Unmanned Aerial Vehicles (UAV)

DTIC Science & Technology

2013-03-01

series of checkpoints in a complex route network,” while observing standard traffic etiquette and regulations [17]. The rules for the 2012 RoboCup...structure or protocols above the PHY. To support AVEP operation, we developed a packet structure based on the transmission control protocol (TCP...Control Protocol .” 1981. [37] F. Ge, Q. Chen, Y. Wang, C. W. Bostian, T. W. Rondeau, and B. Le, “Cognitive radio: from spectrum sharing to adaptive

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...";…

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 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…

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.

PP172. Indian scenario of preeclampsia and its consequences and early prophylaxis.

PubMed

Jariwala, M C

2012-07-01

Preeclampsia remains one of the major obstetrical problems in less-developed countries. The causes of this condition are still unknown, we have designed a prevention protocol with new concept to describe the etiology and cause of preeclampsia. To study the effectiveness of the Jariwala's therapy and etiological causes of preeclapsia. we want to establish the new version of efficient prophylactic management to prevent the concequences of preeclampsia. We have selected 800 cases who have developed preeclampsia during any phase of pregnancy and tried to prevent the developing preeclampsia (predicted with roll over test, color doppler and weight gain and or edema) by Jariwala's protocol. our aim is to reduce the severity of disease process by early prediction and treatment. we have not included the cases who may have completely treated after the inclusion criteria to predict the preclampsia and treated. the inclusion criteris is strictly followed by a protocol designed. Jariwala's therapy is effective in mild to moderate cases of preeclampsia. Till date we have successfully treated 800 cases of mild to moderate preeclapsia with 98% neonates delivered with birth weight of 2kg and more, 92% neonates sent directly to home without any complication; and developed well at home. If we try to treat the blood pressure (during pregnancy) by anti hypertensive we have noticedà IUGR and rebound increase of blood pressure, means decrease maternal blood pressure à decrease placental supplyà deficient nutrientà rebound increase in toxin secretion (by fetus and placenta) à increase in blood pressure to supply more nutrient). So that it is my suggestion that the antihypertensive should be avoided if possible 2: increase permeability of placental membranes due to toxins secreted by fetus to supply more nutrient leads to increase permeability of placental membranes means increase protein loss from kidneys (due to toxins secreted from the fetus and placenta) increase third space leakage of fluid as nutrient leads to serum protein deficiency and increase permeability of endovascularities of all organs multi system disorder. so instead of treating the developing preeclampsia with routine treatment either terminate the pregnancy if it is severe and developing intensely or treat with the Jariwala's protocol. Copyright © 2012. Published by Elsevier B.V.

Efficient File Sharing by Multicast - P2P Protocol Using Network Coding and Rank Based Peer Selection

NASA Technical Reports Server (NTRS)

Stoenescu, Tudor M.; Woo, Simon S.

2009-01-01

In this work, we consider information dissemination and sharing in a distributed peer-to-peer (P2P highly dynamic communication network. In particular, we explore a network coding technique for transmission and a rank based peer selection method for network formation. The combined approach has been shown to improve information sharing and delivery to all users when considering the challenges imposed by the space network environments.

Secure quantum communication using classical correlated channel

NASA Astrophysics Data System (ADS)

Costa, D.; de Almeida, N. G.; Villas-Boas, C. J.

2016-10-01

We propose a secure protocol to send quantum information from one part to another without a quantum channel. In our protocol, which resembles quantum teleportation, a sender (Alice) and a receiver (Bob) share classical correlated states instead of EPR ones, with Alice performing measurements in two different bases and then communicating her results to Bob through a classical channel. Our secure quantum communication protocol requires the same amount of classical bits as the standard quantum teleportation protocol. In our scheme, as in the usual quantum teleportation protocol, once the classical channel is established in a secure way, a spy (Eve) will never be able to recover the information of the unknown quantum state, even if she is aware of Alice's measurement results. Security, advantages, and limitations of our protocol are discussed and compared with the standard quantum teleportation protocol.

Coexistence of WiFi and WiMAX Systems Based on PS-Request Protocols†

PubMed Central

Kim, Jongwoo; Park, Suwon; Rhee, Seung Hyong; Choi, Yong-Hoon; Chung, Young-uk; Hwang, Ho Young

2011-01-01

We introduce both the coexistence zone within the WiMAX frame structure and a PS-Request protocol for the coexistence of WiFi and WiMAX systems sharing a frequency band. Because we know that the PS-Request protocol has drawbacks, we propose a revised PS-Request protocol to improve the performance. Two PS-Request protocols are based on the time division operation (TDO) of WiFi system and WiMAX system to avoid the mutual interference, and use the vestigial power management (PwrMgt) bit within the Frame Control field of the frames transmitted by a WiFi AP. The performance of the revised PS-Request protocol is evaluated by computer simulation, and compared to those of the cases without a coexistence protocol and to the original PS-Request protocol. PMID:22163721

Continuous-variable measurement-device-independent quantum key distribution with virtual photon subtraction

NASA Astrophysics Data System (ADS)

Zhao, Yijia; Zhang, Yichen; Xu, Bingjie; Yu, Song; Guo, Hong

2018-04-01

The method of improving the performance of continuous-variable quantum key distribution protocols by postselection has been recently proposed and verified. In continuous-variable measurement-device-independent quantum key distribution (CV-MDI QKD) protocols, the measurement results are obtained from untrusted third party Charlie. There is still not an effective method of improving CV-MDI QKD by the postselection with untrusted measurement. We propose a method to improve the performance of coherent-state CV-MDI QKD protocol by virtual photon subtraction via non-Gaussian postselection. The non-Gaussian postselection of transmitted data is equivalent to an ideal photon subtraction on the two-mode squeezed vacuum state, which is favorable to enhance the performance of CV-MDI QKD. In CV-MDI QKD protocol with non-Gaussian postselection, two users select their own data independently. We demonstrate that the optimal performance of the renovated CV-MDI QKD protocol is obtained with the transmitted data only selected by Alice. By setting appropriate parameters of the virtual photon subtraction, the secret key rate and tolerable excess noise are both improved at long transmission distance. The method provides an effective optimization scheme for the application of CV-MDI QKD protocols.

Transitions of care from Child and Adolescent Mental Health Services to Adult Mental Health Services (TRACK Study): a study of protocols in Greater London.

PubMed

Singh, Swaran P; Paul, Moli; Ford, Tamsin; Kramer, Tami; Weaver, Tim

2008-06-23

Although young people's transition from Child and Adolescent Mental Health Services (CAMHS) to Adult Mental Health Services (AMHS) in England is a significant health issue for service users, commissioners and providers, there is little evidence available to guide service development. The TRACK study aims to identify factors which facilitate or impede effective transition from CAHMS to AMHS. This paper presents findings from a survey of transition protocols in Greater London. A questionnaire survey (Jan-April 2005) of Greater London CAMHS to identify transition protocols and collect data on team size, structure, transition protocols, population served and referral rates to AMHS. Identified transition protocols were subjected to content analysis. Forty two of the 65 teams contacted (65%) responded to the survey. Teams varied in type (generic/targeted/in-patient), catchment area (locality-based, wider or national) and transition boundaries with AMHS. Estimated annual average number of cases considered suitable for transfer to AMHS, per CAMHS team (mean 12.3, range 0-70, SD 14.5, n = 37) was greater than the annual average number of cases actually accepted by AMHS (mean 8.3, range 0-50, SD 9.5, n = 33). In April 2005, there were 13 active and 2 draft protocols in Greater London. Protocols were largely similar in stated aims and policies, but differed in key procedural details, such as joint working between CAHMS and AMHS and whether protocols were shared at Trust or locality level. While the centrality of service users' involvement in the transition process was identified, no protocol specified how users should be prepared for transition. A major omission from protocols was procedures to ensure continuity of care for patients not accepted by AMHS. At least 13 transition protocols were in operation in Greater London in April 2005. Not all protocols meet all requirements set by government policy. Variation in protocol-sharing organisational units and transition process suggest that practice may vary. There is discontinuity of care provision for some patients who 'graduate' from CAMHS services but are not accepted by adult services.

Transitions of Care from Child and Adolescent Mental Health Services to Adult Mental Health Services (TRACK Study): A study of protocols in Greater London

PubMed Central

Singh, Swaran P; Paul, Moli; Ford, Tamsin; Kramer, Tami; Weaver, Tim

2008-01-01

Background Although young people's transition from Child and Adolescent Mental Health Services (CAMHS) to Adult Mental Health Services (AMHS) in England is a significant health issue for service users, commissioners and providers, there is little evidence available to guide service development. The TRACK study aims to identify factors which facilitate or impede effective transition from CAHMS to AMHS. This paper presents findings from a survey of transition protocols in Greater London. Methods A questionnaire survey (Jan-April 2005) of Greater London CAMHS to identify transition protocols and collect data on team size, structure, transition protocols, population served and referral rates to AMHS. Identified transition protocols were subjected to content analysis. Results Forty two of the 65 teams contacted (65%) responded to the survey. Teams varied in type (generic/targeted/in-patient), catchment area (locality-based, wider or national) and transition boundaries with AMHS. Estimated annual average number of cases considered suitable for transfer to AMHS, per CAMHS team (mean 12.3, range 0–70, SD 14.5, n = 37) was greater than the annual average number of cases actually accepted by AMHS (mean 8.3, range 0–50, SD 9.5, n = 33). In April 2005, there were 13 active and 2 draft protocols in Greater London. Protocols were largely similar in stated aims and policies, but differed in key procedural details, such as joint working between CAHMS and AMHS and whether protocols were shared at Trust or locality level. While the centrality of service users' involvement in the transition process was identified, no protocol specified how users should be prepared for transition. A major omission from protocols was procedures to ensure continuity of care for patients not accepted by AMHS. Conclusion At least 13 transition protocols were in operation in Greater London in April 2005. Not all protocols meet all requirements set by government policy. Variation in protocol-sharing organisational units and transition process suggest that practice may vary. There is discontinuity of care provision for some patients who 'graduate' from CAMHS services but are not accepted by adult services. PMID:18573214

The expanding cognitive-behavioural therapy treatment umbrella for the anxiety disorders: disorder-specific and transdiagnostic approaches.

PubMed

Rector, Neil A; Man, Vincent; Lerman, Bethany

2014-06-01

Cognitive-behavioural therapy (CBT) is an empirically supported treatment for anxiety disorders. CBT treatments are based on disorder-specific protocols that have been developed to target individual anxiety disorders, despite that anxiety disorders frequently co-occur and are comorbid with depression. Given the high rates of diagnostic comorbidity, substantial overlap in dimensional symptom ratings, and extensive evidence that the mood and anxiety disorders share a common set of psychological and biological vulnerabilities, transdiagnostic CBT protocols have recently been developed to treat the commonalities among the mood and anxiety disorders. We conducted a selective review of empirical developments in the transdiagnostic CBT treatment of anxiety and depression (2008-2013). Preliminary evidence suggests that theoretically based transdiagnostic CBT approaches lead to large treatment effects on the primary anxiety disorder, considerable reduction of diagnostic comorbidity, and some preliminary effects regarding the impact on the putative, shared psychological mechanisms. However, the empirical literature remains tentative owing to relatively small samples, limited direct comparisons with disorder-specific CBT protocols, and the relative absence of the study of disorder-specific compared with shared mechanisms of action in treatment. We conclude with a treatment conceptualization of the new transdiagnostic interventions as complementary, rather than contradictory, to disorder-specific CBT.

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.

Secure multi-party communication with quantum key distribution managed by trusted authority

DOEpatents

Nordholt, Jane Elizabeth; Hughes, Richard John; Peterson, Charles Glen

2013-07-09

Techniques and tools for implementing protocols for secure multi-party communication after quantum key distribution ("QKD") are described herein. In example implementations, a trusted authority facilitates secure communication between multiple user devices. The trusted authority distributes different quantum keys by QKD under trust relationships with different users. The trusted authority determines combination keys using the quantum keys and makes the combination keys available for distribution (e.g., for non-secret distribution over a public channel). The combination keys facilitate secure communication between two user devices even in the absence of QKD between the two user devices. With the protocols, benefits of QKD are extended to multi-party communication scenarios. In addition, the protocols can retain benefit of QKD even when a trusted authority is offline or a large group seeks to establish secure communication within the group.

Secure multi-party communication with quantum key distribution managed by trusted authority

DOEpatents

Hughes, Richard John; Nordholt, Jane Elizabeth; Peterson, Charles Glen

2015-01-06

Techniques and tools for implementing protocols for secure multi-party communication after quantum key distribution ("QKD") are described herein. In example implementations, a trusted authority facilitates secure communication between multiple user devices. The trusted authority distributes different quantum keys by QKD under trust relationships with different users. The trusted authority determines combination keys using the quantum keys and makes the combination keys available for distribution (e.g., for non-secret distribution over a public channel). The combination keys facilitate secure communication between two user devices even in the absence of QKD between the two user devices. With the protocols, benefits of QKD are extended to multi-party communication scenarios. In addition, the protocols can retain benefit of QKD even when a trusted authority is offline or a large group seeks to establish secure communication within the group.

Biased decoy-state measurement-device-independent quantum cryptographic conferencing with finite resources.

PubMed

Chen, RuiKe; Bao, WanSu; Zhou, Chun; Li, Hongwei; Wang, Yang; Bao, HaiZe

2016-03-21

In recent years, a large quantity of work have been done to narrow the gap between theory and practice in quantum key distribution (QKD). However, most of them are focus on two-party protocols. Very recently, Yao Fu et al proposed a measurement-device-independent quantum cryptographic conferencing (MDI-QCC) protocol and proved its security in the limit of infinitely long keys. As a step towards practical application for MDI-QCC, we design a biased decoy-state measurement-device-independent quantum cryptographic conferencing protocol and analyze the performance of the protocol in both the finite-key and infinite-key regime. From numerical simulations, we show that our decoy-state analysis is tighter than Yao Fu et al. That is, we can achieve the nonzero asymptotic secret key rate in long distance with approximate to 200km and we also demonstrate that with a finite size of data (say 10¹¹ to 10¹³ signals) it is possible to perform secure MDI-QCC over reasonable distances.

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.

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.

Conducting Clinically Based Intimate Partner Violence Research: Safety Protocol Recommendations.

PubMed

Anderson, Jocelyn C; Glass, Nancy E; Campbell, Jacquelyn C

Maintaining safety is of utmost importance during research involving participants who have experienced intimate partner violence (IPV). Limited guidance on safety protocols to protect participants is available, particularly information related to technology-based approaches to informed consent, data collection, and contacting participants during the course of a study. The purpose of the article is to provide details on the safety protocol developed and utilized with women receiving care at an urban HIV clinic and who were taking part in an observational study of IPV, mental health symptoms, and substance abuse and their relationship to HIV treatment adherence. The protocol presents the technological strategies to promote safety and allow autonomy in participant decision-making throughout the research process, including Voice over Internet Protocol telephone numbers, and tablet-based eligibility screening and data collection. Protocols for management of participants at risk for suicide and/or intimate partner homicide that included automated high-risk messaging to participants and research staff and facilitated disclosure of risk to clinical staff based on participant preferences are discussed. Use of technology and partnership with clinic staff helped to provide an environment where research regarding IPV could be conducted without undue burden or risk to participants. Utilizing tablet-based survey administration provided multiple practical and safety benefits for participants. Most women who screened into high-risk categories for suicide or intimate partner homicide did not choose to have their results shared with their healthcare providers, indicating the importance of allowing participants control over information sharing whenever possible.

Virtual memory support for distributed computing environments using a shared data object model

NASA Astrophysics Data System (ADS)

Huang, F.; Bacon, J.; Mapp, G.

1995-12-01

Conventional storage management systems provide one interface for accessing memory segments and another for accessing secondary storage objects. This hinders application programming and affects overall system performance due to mandatory data copying and user/kernel boundary crossings, which in the microkernel case may involve context switches. Memory-mapping techniques may be used to provide programmers with a unified view of the storage system. This paper extends such techniques to support a shared data object model for distributed computing environments in which good support for coherence and synchronization is essential. The approach is based on a microkernel, typed memory objects, and integrated coherence control. A microkernel architecture is used to support multiple coherence protocols and the addition of new protocols. Memory objects are typed and applications can choose the most suitable protocols for different types of object to avoid protocol mismatch. Low-level coherence control is integrated with high-level concurrency control so that the number of messages required to maintain memory coherence is reduced and system-wide synchronization is realized without severely impacting the system performance. These features together contribute a novel approach to the support for flexible coherence under application control.

THE EFFECT OF ATRAZINE ON PUBERTY IN THE MALE WISTAR RATS: AN EVALUATION IN THE PROTOCOL FOR THE ASSESSMENT OF PUBERTAL DEVELOPMENT AND THYROID FUNCTION

EPA Science Inventory

Since atrazine (ATR), a chlorotriazine herbicide, has been shown previously to alter the secretion of luteinizing hormone (LH) and prolactin (PRL) through a direct effect on the central nervous system (CNS), we hypothesized that exposure to ATR in the EDSTAC male pubertal protoco...

Transient Expression of Chimeric Fluorescent Reporter Proteins in Pollen Tubes to Study Protein Polar Secretion and Dynamics.

PubMed

Zhong, Guitao; Liu, Ronghe; Zhuang, Menglong; Wang, Hao

2017-01-01

Transient expression of chimeric fluorescent reporter proteins by biolistic bombardment is a quick and useful procedure for studying subcellular protein localization and dynamics in plants. It is especially beneficial in specific plant cells which are not suitable for protoplast-based and Agrobacterium-mediated protein transient expression. Polar protein secretion and vesicular trafficking play essential functions for cell polarization and tip growth. The growing pollen tube is regarded as an ideal model plant cell system to study the machinery and regulation of polar protein trafficking and targeting. A large amount of newly synthesized proteins are packed and polarly transported to the apical region to support the rapid and highly polarized tip growth. Here, we described a detailed step-by-step protocol for the transient expression of chimeric fluorescent reporter proteins in growing Arabidopsis and tobacco pollen tubes to study polar transportation logistics and mechanisms. In addition, we have optimized the Arabidopsis and tobacco in vitro pollen germination medium and the conditions to maximize the efficiency of protein expression. As a proof of concept, we have used this protocol to express actin microfilament and late endosomal fluorescent markers in Arabidopsis and tobacco pollen tubes.

Live cell imaging of phosphoinositide dynamics during Legionella infection.

PubMed

Weber, Stephen; Hilbi, Hubert

2014-01-01

The "accidental" pathogen Legionella pneumophila replicates intracellularly in a distinct compartment, the Legionella-containing vacuole (LCV). To form this specific pathogen vacuole, the bacteria translocate via the Icm/Dot type IV secretion system approximately 300 different effector proteins into the host cell. Several of these secreted effectors anchor to the cytoplasmic face of the LCV membrane by binding to phosphoinositide (PI) lipids. L. pneumophila thus largely controls the localization of secreted bacterial effectors and the recruitment of host factors to the LCV through the modulation of the vacuole membrane PI pattern. The LCV PI pattern and its dynamics can be studied in real-time using fluorescently labeled protein probes stably produced by the soil amoeba Dictyostelium discoideum. In this chapter, we describe a protocol to (1) construct and handle amoeba model systems as a tool for observing PIs in live cell imaging, (2) capture rapid changes in membrane PI patterning during uptake events, and (3) observe the dynamics of LCV PIs over the course of a Legionella infection.

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.

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.

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

iLAP: a workflow-driven software for experimental protocol development, data acquisition and analysis

PubMed Central

2009-01-01

Background In recent years, the genome biology community has expended considerable effort to confront the challenges of managing heterogeneous data in a structured and organized way and developed laboratory information management systems (LIMS) for both raw and processed data. On the other hand, electronic notebooks were developed to record and manage scientific data, and facilitate data-sharing. Software which enables both, management of large datasets and digital recording of laboratory procedures would serve a real need in laboratories using medium and high-throughput techniques. Results We have developed iLAP (Laboratory data management, Analysis, and Protocol development), a workflow-driven information management system specifically designed to create and manage experimental protocols, and to analyze and share laboratory data. The system combines experimental protocol development, wizard-based data acquisition, and high-throughput data analysis into a single, integrated system. We demonstrate the power and the flexibility of the platform using a microscopy case study based on a combinatorial multiple fluorescence in situ hybridization (m-FISH) protocol and 3D-image reconstruction. iLAP is freely available under the open source license AGPL from http://genome.tugraz.at/iLAP/. Conclusion iLAP is a flexible and versatile information management system, which has the potential to close the gap between electronic notebooks and LIMS and can therefore be of great value for a broad scientific community. PMID:19941647

The Exosome Secretory Pathway Transports Amyloid Precursor Protein Carboxyl-terminal Fragments from the Cell into the Brain Extracellular Space*

PubMed Central

Perez-Gonzalez, Rocio; Gauthier, Sebastien A.; Kumar, Asok; Levy, Efrat

2012-01-01

In vitro studies have shown that neuronal cell cultures secrete exosomes containing amyloid-β precursor protein (APP) and the APP-processing products, C-terminal fragments (CTFs) and amyloid-β (Aβ). We investigated the secretion of full-length APP (flAPP) and APP CTFs via the exosome secretory pathway in vivo. To this end, we developed a novel protocol designed to isolate exosomes secreted into mouse brain extracellular space. Exosomes with typical morphology were isolated from freshly removed mouse brains and from frozen mouse and human brain tissues, demonstrating that exosomes can be isolated from post-mortem tissue frozen for long periods of time. flAPP, APP CTFs, and enzymes that cleave both flAPP and APP CTFs were identified in brain exosomes. Although higher levels of both flAPP and APP CTFs were observed in exosomes isolated from the brains of transgenic mice overexpressing human APP (Tg2576) compared with wild-type control mice, there was no difference in the number of secreted brain exosomes. These data indicate that the levels of flAPP and APP CTFs associated with exosomes mirror the cellular levels of flAPP and APP CTFs. Interestingly, exosomes isolated from the brains of both Tg2576 and wild-type mice are enriched with APP CTFs relative to flAPP. Thus, we hypothesize that the exosome secretory pathway plays a pleiotropic role in the brain: exosome secretion is beneficial to the cell, acting as a specific releasing system of neurotoxic APP CTFs and Aβ, but the secretion of exosomes enriched with APP CTFs, neurotoxic proteins that are also a source of secreted Aβ, is harmful to the brain. PMID:23129776

Quantitative assessment of interactions between hospitalized patients and portable medical equipment and other fomites.

PubMed

Suwantarat, Nuntra; Supple, Laura A; Cadnum, Jennifer L; Sankar, Thriveen; Donskey, Curtis J

2017-11-01

In an observational study, we demonstrated that hospitalized patients frequently had direct or indirect interactions with medical equipment and other fomites that are shared among patients, and these items were often contaminated with health care-associated pathogens. There is a need for protocols to ensure routine cleaning of shared portable equipment. Published by Elsevier Inc.

Adapted Shared Storybook Reading: A Study of Its Application for Children with Autism Spectrum Disorders in Home Settings

ERIC Educational Resources Information Center

Golloher, Andrea N.

2018-01-01

This study investigated the use of an adapted shared reading protocol with three children with autism spectrum disorders (ASD) in home settings. Using a multiple baseline across participants design, this investigation replicated and extended a previous investigation by Browder et al. to children with ASD and home settings. In addition, this study…

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

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.