Reset Tree-Based Optical Fault Detection

PubMed Central

Lee, Dong-Geon; Choi, Dooho; Seo, Jungtaek; Kim, Howon

2013-01-01

In this paper, we present a new reset tree-based scheme to protect cryptographic hardware against optical fault injection attacks. As one of the most powerful invasive attacks on cryptographic hardware, optical fault attacks cause semiconductors to misbehave by injecting high-energy light into a decapped integrated circuit. The contaminated result from the affected chip is then used to reveal secret information, such as a key, from the cryptographic hardware. Since the advent of such attacks, various countermeasures have been proposed. Although most of these countermeasures are strong, there is still the possibility of attack. In this paper, we present a novel optical fault detection scheme that utilizes the buffers on a circuit's reset signal tree as a fault detection sensor. To evaluate our proposal, we model radiation-induced currents into circuit components and perform a SPICE simulation. The proposed scheme is expected to be used as a supplemental security tool. PMID:23698267

Evaluation of Information Leakage from Cryptographic Hardware via Common-Mode Current

NASA Astrophysics Data System (ADS)

Hayashi, Yu-Ichi; Homma, Naofumi; Mizuki, Takaaki; Sugawara, Takeshi; Kayano, Yoshiki; Aoki, Takafumi; Minegishi, Shigeki; Satoh, Akashi; Sone, Hideaki; Inoue, Hiroshi

This paper presents a possibility of Electromagnetic (EM) analysis against cryptographic modules outside their security boundaries. The mechanism behind the information leakage is explained from the view point of Electromagnetic Compatibility: electric fluctuation released from cryptographic modules can conduct to peripheral circuits based on ground bounce, resulting in radiation. We demonstrate the consequence of the mechanism through experiments where the ISO/IEC standard block cipher AES (Advanced Encryption Standard) is implemented on an FPGA board and EM radiations from power and communication cables are measured. Correlation Electromagnetic Analysis (CEMA) is conducted in order to evaluate the information leakage. The experimental results show that secret keys are revealed even though there are various disturbing factors such as voltage regulators and AC/DC converters between the target module and the measurement points. We also discuss information-suppression techniques as electrical-level countermeasures against such CEMAs.

Psst, Can You Keep a Secret?

PubMed Central

Vassilev, Apostol; Mouha, Nicky; Brandão, Luís

2018-01-01

The security of encrypted data depends not only on the theoretical properties of cryptographic primitives but also on the robustness of their implementations in software and hardware. Threshold cryptography introduces a computational paradigm that enables higher assurance for such implementations. PMID:29576634

A physical zero-knowledge object-comparison system for nuclear warhead verification

PubMed Central

Philippe, Sébastien; Goldston, Robert J.; Glaser, Alexander; d'Errico, Francesco

2016-01-01

Zero-knowledge proofs are mathematical cryptographic methods to demonstrate the validity of a claim while providing no further information beyond the claim itself. The possibility of using such proofs to process classified and other sensitive physical data has attracted attention, especially in the field of nuclear arms control. Here we demonstrate a non-electronic fast neutron differential radiography technique using superheated emulsion detectors that can confirm that two objects are identical without revealing their geometry or composition. Such a technique could form the basis of a verification system that could confirm the authenticity of nuclear weapons without sharing any secret design information. More broadly, by demonstrating a physical zero-knowledge proof that can compare physical properties of objects, this experiment opens the door to developing other such secure proof-systems for other applications. PMID:27649477

A physical zero-knowledge object-comparison system for nuclear warhead verification.

PubMed

Philippe, Sébastien; Goldston, Robert J; Glaser, Alexander; d'Errico, Francesco

2016-09-20

Zero-knowledge proofs are mathematical cryptographic methods to demonstrate the validity of a claim while providing no further information beyond the claim itself. The possibility of using such proofs to process classified and other sensitive physical data has attracted attention, especially in the field of nuclear arms control. Here we demonstrate a non-electronic fast neutron differential radiography technique using superheated emulsion detectors that can confirm that two objects are identical without revealing their geometry or composition. Such a technique could form the basis of a verification system that could confirm the authenticity of nuclear weapons without sharing any secret design information. More broadly, by demonstrating a physical zero-knowledge proof that can compare physical properties of objects, this experiment opens the door to developing other such secure proof-systems for other applications.

A physical zero-knowledge object-comparison system for nuclear warhead verification

NASA Astrophysics Data System (ADS)

Philippe, Sébastien; Goldston, Robert J.; Glaser, Alexander; D'Errico, Francesco

2016-09-01

Zero-knowledge proofs are mathematical cryptographic methods to demonstrate the validity of a claim while providing no further information beyond the claim itself. The possibility of using such proofs to process classified and other sensitive physical data has attracted attention, especially in the field of nuclear arms control. Here we demonstrate a non-electronic fast neutron differential radiography technique using superheated emulsion detectors that can confirm that two objects are identical without revealing their geometry or composition. Such a technique could form the basis of a verification system that could confirm the authenticity of nuclear weapons without sharing any secret design information. More broadly, by demonstrating a physical zero-knowledge proof that can compare physical properties of objects, this experiment opens the door to developing other such secure proof-systems for other applications.

A physical zero-knowledge object-comparison system for nuclear warhead verification

DOE PAGES

Philippe, Sébastien; Goldston, Robert J.; Glaser, Alexander; ...

2016-09-20

Zero-knowledge proofs are mathematical cryptographic methods to demonstrate the validity of a claim while providing no further information beyond the claim itself. The possibility of using such proofs to process classified and other sensitive physical data has attracted attention, especially in the field of nuclear arms control. Here we demonstrate a non-electronic fast neutron differential radiography technique using superheated emulsion detectors that can confirm that two objects are identical without revealing their geometry or composition. Such a technique could form the basis of a verification system that could confirm the authenticity of nuclear weapons without sharing any secret design information.more » More broadly, by demonstrating a physical zero-knowledge proof that can compare physical properties of objects, this experiment opens the door to developing other such secure proof-systems for other applications.« less

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

NASA Astrophysics Data System (ADS)

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

2015-02-01

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

A physical zero-knowledge object-comparison system for nuclear warhead verification

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

Philippe, Sébastien; Goldston, Robert J.; Glaser, Alexander

Zero-knowledge proofs are mathematical cryptographic methods to demonstrate the validity of a claim while providing no further information beyond the claim itself. The possibility of using such proofs to process classified and other sensitive physical data has attracted attention, especially in the field of nuclear arms control. Here we demonstrate a non-electronic fast neutron differential radiography technique using superheated emulsion detectors that can confirm that two objects are identical without revealing their geometry or composition. Such a technique could form the basis of a verification system that could confirm the authenticity of nuclear weapons without sharing any secret design information.more » More broadly, by demonstrating a physical zero-knowledge proof that can compare physical properties of objects, this experiment opens the door to developing other such secure proof-systems for other applications.« less

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

Novel Authentication of Monitoring Data Through the use of Secret and Public Cryptographic Keys

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

Benz, Jacob M.; Tolk, Keith; Tanner, Jennifer E.

The Office of Nuclear Verification (ONV) is supporting the development of a piece of equipment to provide data authentication and protection for a suite of monitoring sensors as part of a larger effort to create an arms control technology toolkit. This device, currently called the Red Box, leverages the strengths of both secret and public cryptographic keys to authenticate, digitally sign, and pass along monitoring data to allow for host review, and redaction if necessary, without the loss of confidence in the authenticity of the data by the monitoring party. The design of the Red Box will allow for themore » addition and removal of monitoring equipment and can also verify that the data was collected by authentic monitoring equipment prior to signing the data and sending it to the host and for review. The host will then forward the data to the monitor for review and inspection. This paper will highlight the progress to date of the Red Box development, and will explain the novel method of leveraging both symmetric and asymmetric (secret and public key) cryptography to authenticate data within a warhead monitoring regime.« less

A Cryptographic SoC for Robust Protection of Secret Keys in IPTV DRM Systems

NASA Astrophysics Data System (ADS)

Lee, Sanghan; Yang, Hae-Yong; Yeom, Yongjin; Park, Jongsik

The security level of an internet protocol television (IPTV) digital right management (DRM) system ultimately relies on protection of secret keys. Well known devices for the key protection include smartcards and battery backup SRAMs (BB-SRAMs); however, these devices could be vulnerable to various physical attacks. In this paper, we propose a secure and cost-effective design of a cryptographic system on chip (SoC) that integrates the BB-SRAM with a cell-based design technique. The proposed SoC provides robust safeguard against the physical attacks, and satisfies high-speed and low-price requirements of IPTV set-top boxes. Our implementation results show that the maximum encryption rate of the SoC is 633Mb/s. In order to verify the data retention capabilities, we made a prototype chip using 0.18µm standard cell technology. The experimental results show that the integrated BB-SRAM can reliably retain data with a 1.4µA leakage current.

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.

Harry Potter and the Cryptography with Matrices

ERIC Educational Resources Information Center

Chua, Boon Liang

2006-01-01

This article describes Cryptography, defined as the science of encrypting and deciphering messages written in secret codes, it has played a vital role in securing information since ancient times. There are several cryptographic techniques and many make extensive use of mathematics to secure information. The author discusses an activity built…

Gencrypt: one-way cryptographic hashes to detect overlapping individuals across samples

PubMed Central

Turchin, Michael C.; Hirschhorn, Joel N.

2012-01-01

Summary: Meta-analysis across genome-wide association studies is a common approach for discovering genetic associations. However, in some meta-analysis efforts, individual-level data cannot be broadly shared by study investigators due to privacy and Institutional Review Board concerns. In such cases, researchers cannot confirm that each study represents a unique group of people, leading to potentially inflated test statistics and false positives. To resolve this problem, we created a software tool, Gencrypt, which utilizes a security protocol known as one-way cryptographic hashes to allow overlapping participants to be identified without sharing individual-level data. Availability: Gencrypt is freely available under the GNU general public license v3 at http://www.broadinstitute.org/software/gencrypt/ Contact: joelh@broadinstitute.org Supplementary information: Supplementary data are available at Bioinformatics online. PMID:22302573

Secure management of biomedical data with cryptographic hardware.

PubMed

Canim, Mustafa; Kantarcioglu, Murat; Malin, Bradley

2012-01-01

The biomedical community is increasingly migrating toward research endeavors that are dependent on large quantities of genomic and clinical data. At the same time, various regulations require that such data be shared beyond the initial collecting organization (e.g., an academic medical center). It is of critical importance to ensure that when such data are shared, as well as managed, it is done so in a manner that upholds the privacy of the corresponding individuals and the overall security of the system. In general, organizations have attempted to achieve these goals through deidentification methods that remove explicitly, and potentially, identifying features (e.g., names, dates, and geocodes). However, a growing number of studies demonstrate that deidentified data can be reidentified to named individuals using simple automated methods. As an alternative, it was shown that biomedical data could be shared, managed, and analyzed through practical cryptographic protocols without revealing the contents of any particular record. Yet, such protocols required the inclusion of multiple third parties, which may not always be feasible in the context of trust or bandwidth constraints. Thus, in this paper, we introduce a framework that removes the need for multiple third parties by collocating services to store and to process sensitive biomedical data through the integration of cryptographic hardware. Within this framework, we define a secure protocol to process genomic data and perform a series of experiments to demonstrate that such an approach can be run in an efficient manner for typical biomedical investigations.

Secure Management of Biomedical Data With Cryptographic Hardware

PubMed Central

Canim, Mustafa; Kantarcioglu, Murat; Malin, Bradley

2014-01-01

The biomedical community is increasingly migrating toward research endeavors that are dependent on large quantities of genomic and clinical data. At the same time, various regulations require that such data be shared beyond the initial collecting organization (e.g., an academic medical center). It is of critical importance to ensure that when such data are shared, as well as managed, it is done so in a manner that upholds the privacy of the corresponding individuals and the overall security of the system. In general, organizations have attempted to achieve these goals through deidentification methods that remove explicitly, and potentially, identifying features (e.g., names, dates, and geocodes). However, a growing number of studies demonstrate that deidentified data can be reidentified to named individuals using simple automated methods. As an alternative, it was shown that biomedical data could be shared, managed, and analyzed through practical cryptographic protocols without revealing the contents of any particular record. Yet, such protocols required the inclusion of multiple third parties, which may not always be feasible in the context of trust or bandwidth constraints. Thus, in this paper, we introduce a framework that removes the need for multiple third parties by collocating services to store and to process sensitive biomedical data through the integration of cryptographic hardware. Within this framework, we define a secure protocol to process genomic data and perform a series of experiments to demonstrate that such an approach can be run in an efficient manner for typical biomedical investigations. PMID:22010157

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

Enhanced diffie-hellman algorithm for reliable key exchange

NASA Astrophysics Data System (ADS)

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

2017-11-01

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

Physical key-protected one-time pad

PubMed Central

Horstmeyer, Roarke; Judkewitz, Benjamin; Vellekoop, Ivo M.; Assawaworrarit, Sid; Yang, Changhuei

2013-01-01

We describe an encrypted communication principle that forms a secure link between two parties without electronically saving either of their keys. Instead, random cryptographic bits are kept safe within the unique mesoscopic randomness of two volumetric scattering materials. We demonstrate how a shared set of patterned optical probes can generate 10 gigabits of statistically verified randomness between a pair of unique 2 mm3 scattering objects. This shared randomness is used to facilitate information-theoretically secure communication following a modified one-time pad protocol. Benefits of volumetric physical storage over electronic memory include the inability to probe, duplicate or selectively reset any bits without fundamentally altering the entire key space. Our ability to securely couple the randomness contained within two unique physical objects can extend to strengthen hardware required by a variety of cryptographic protocols, which is currently a critically weak link in the security pipeline of our increasingly mobile communication culture. PMID:24345925

On protection against a bright-pulse attack in the two-pass quantum cryptography system

NASA Astrophysics Data System (ADS)

Balygin, K. A.; Klimov, A. N.; Korol'kov, A. V.; Kulik, S. P.; Molotkov, S. N.

2016-06-01

The security of keys in quantum cryptography systems, in contrast to mathematical cryptographic algorithms, is guaranteed by fundamental quantum-mechanical laws. However, the cryptographic resistance of such systems, which are distributed physical devices, fundamentally depends on the method of their implementation and particularly on the calibration and control of critical parameters. The most important parameter is the number of photons in quasi-single-photon information states in a communication channel. The sensitivity to a bright-pulse attack has been demonstrated in an explicit form for a number of systems. A method guaranteeing the resistance to such attacks has been proposed and implemented. Furthermore, the relation of physical observables used and obtained at the control of quantum states to the length of final secret keys has been obtained for the first time.

Combining Cryptography with EEG Biometrics

PubMed Central

Kazanavičius, Egidijus; Woźniak, Marcin

2018-01-01

Cryptographic frameworks depend on key sharing for ensuring security of data. While the keys in cryptographic frameworks must be correctly reproducible and not unequivocally connected to the identity of a user, in biometric frameworks this is different. Joining cryptography techniques with biometrics can solve these issues. We present a biometric authentication method based on the discrete logarithm problem and Bose-Chaudhuri-Hocquenghem (BCH) codes, perform its security analysis, and demonstrate its security characteristics. We evaluate a biometric cryptosystem using our own dataset of electroencephalography (EEG) data collected from 42 subjects. The experimental results show that the described biometric user authentication system is effective, achieving an Equal Error Rate (ERR) of 0.024.

Combining Cryptography with EEG Biometrics.

PubMed

Damaševičius, Robertas; Maskeliūnas, Rytis; Kazanavičius, Egidijus; Woźniak, Marcin

2018-01-01

Cryptographic frameworks depend on key sharing for ensuring security of data. While the keys in cryptographic frameworks must be correctly reproducible and not unequivocally connected to the identity of a user, in biometric frameworks this is different. Joining cryptography techniques with biometrics can solve these issues. We present a biometric authentication method based on the discrete logarithm problem and Bose-Chaudhuri-Hocquenghem (BCH) codes, perform its security analysis, and demonstrate its security characteristics. We evaluate a biometric cryptosystem using our own dataset of electroencephalography (EEG) data collected from 42 subjects. The experimental results show that the described biometric user authentication system is effective, achieving an Equal Error Rate (ERR) of 0.024.

Improving Individual Acceptance of Health Clouds through Confidentiality Assurance.

PubMed

Ermakova, Tatiana; Fabian, Benjamin; Zarnekow, Rüdiger

2016-10-26

Cloud computing promises to essentially improve healthcare delivery performance. However, shifting sensitive medical records to third-party cloud providers could create an adoption hurdle because of security and privacy concerns. This study examines the effect of confidentiality assurance in a cloud-computing environment on individuals' willingness to accept the infrastructure for inter-organizational sharing of medical data. We empirically investigate our research question by a survey with over 260 full responses. For the setting with a high confidentiality assurance, we base on a recent multi-cloud architecture which provides very high confidentiality assurance through a secret-sharing mechanism: Health information is cryptographically encoded and distributed in a way that no single and no small group of cloud providers is able to decode it. Our results indicate the importance of confidentiality assurance in individuals' acceptance of health clouds for sensitive medical data. Specifically, this finding holds for a variety of practically relevant circumstances, i.e., in the absence and despite the presence of conventional offline alternatives and along with pseudonymization. On the other hand, we do not find support for the effect of confidentiality assurance in individuals' acceptance of health clouds for non-sensitive medical data. These results could support the process of privacy engineering for health-cloud solutions.

Improving Individual Acceptance of Health Clouds through Confidentiality Assurance

PubMed Central

Fabian, Benjamin; Zarnekow, Rüdiger

2016-01-01

Summary Background Cloud computing promises to essentially improve healthcare delivery performance. However, shifting sensitive medical records to third-party cloud providers could create an adoption hurdle because of security and privacy concerns. Objectives This study examines the effect of confidentiality assurance in a cloud-computing environment on individuals’ willingness to accept the infrastructure for inter-organizational sharing of medical data. Methods We empirically investigate our research question by a survey with over 260 full responses. For the setting with a high confidentiality assurance, we base on a recent multi-cloud architecture which provides very high confidentiality assurance through a secret-sharing mechanism: Health information is cryptographically encoded and distributed in a way that no single and no small group of cloud providers is able to decode it. Results Our results indicate the importance of confidentiality assurance in individuals’ acceptance of health clouds for sensitive medical data. Specifically, this finding holds for a variety of practically relevant circumstances, i.e., in the absence and despite the presence of conventional offline alternatives and along with pseudonymization. On the other hand, we do not find support for the effect of confidentiality assurance in individuals’ acceptance of health clouds for non-sensitive medical data. These results could support the process of privacy engineering for health-cloud solutions. PMID:27781238

An Introduction to PunchScan

NASA Astrophysics Data System (ADS)

Popoveniuc, Stefan; Hosp, Ben

PunchScan is a precinct-read optical-scan balloting system that allows voters to take their ballot with them after scanning. This does not violate the secret ballot principle because the ballots cannot be read without secret information held by the distributed authority in charge of the election. In fact, this election authority will publish the ballots for everyone to see, allowing voters whose ballots were incorrectly omitted to complain. PunchScan vote-counting is performed in private by the election authority - who uses their secret information to decode the ballots - but is verified in public by an auditor.In this paper we describe how and why PunchScan works. We have kept most of the description at an outline level so that it may be used as a straw model of a cryptographic voting system.

Election Verifiability: Cryptographic Definitions and an Analysis of Helios and JCJ

DTIC Science & Technology

2015-04-01

anonymous credentials. In CSF’14: 27th Computer Security Foundations Symposium. IEEE Computer Society, 2014. To appear. [22] David Chaum . Untraceable...electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84–88, 1981. [23] David Chaum . Secret-ballot receipts...True voter-verifiable elections. IEEE Security and Privacy, 2(1):38–47, 2004. [24] David Chaum , Richard Carback, Jeremy Clark, Aleksander Essex, Stefan

Choice of optical system is critical for the security of double random phase encryption systems

NASA Astrophysics Data System (ADS)

Muniraj, Inbarasan; Guo, Changliang; Malallah, Ra'ed; Cassidy, Derek; Zhao, Liang; Ryle, James P.; Healy, John J.; Sheridan, John T.

2017-06-01

The linear canonical transform (LCT) is used in modeling a coherent light-field propagation through first-order optical systems. Recently, a generic optical system, known as the quadratic phase encoding system (QPES), for encrypting a two-dimensional image has been reported. In such systems, two random phase keys and the individual LCT parameters (α,β,γ) serve as secret keys of the cryptosystem. It is important that such encryption systems also satisfy some dynamic security properties. We, therefore, examine such systems using two cryptographic evaluation methods, the avalanche effect and bit independence criterion, which indicate the degree of security of the cryptographic algorithms using QPES. We compared our simulation results with the conventional Fourier and the Fresnel transform-based double random phase encryption (DRPE) systems. The results show that the LCT-based DRPE has an excellent avalanche and bit independence characteristics compared to the conventional Fourier and Fresnel-based encryption systems.

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.

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.

Twenty Seven Years of Quantum Cryptography!

NASA Astrophysics Data System (ADS)

Hughes, Richard

2011-03-01

One of the fundamental goals of cryptographic research is to minimize the assumptions underlying the protocols that enable secure communications between pairs or groups of users. In 1984, building on earlier research by Stephen Wiesner, Charles Bennett and Gilles Brassard showed how quantum physics could be harnessed to provide information-theoretic security for protocols such as the distribution of cryptographic keys, which enables two parties to secure their conventional communications. Bennett and Brassard and colleagues performed a proof-of-principle quantum key distribution (QKD) experiment with single-photon quantum state transmission over a 32-cm air path in 1991. This seminal experiment led other researchers to explore QKD in optical fibers and over line-of-sight outdoor atmospheric paths (``free-space''), resulting in dramatic increases in range, bit rate and security. These advances have been enabled by improvements in sources and single-photon detectors. Also in 1991 Artur Ekert showed how the security of QKD could be related to quantum entanglement. This insight led to a deeper understanding and proof of QKD security with practical sources and detectors in the presence of transmission loss and channel noise. Today, QKD has been implemented over ranges much greater than 100km in both fiber and free-space, multi-node network testbeds have been demonstrated, and satellite-based QKD is under study in several countries. ``Quantum hacking'' researchers have shown the importance of extending security considerations to the classical devices that produce and detect the photon quantum states. New quantum cryptographic protocols such as secure identification have been proposed, and others such as quantum secret splitting have been demonstrated. It is now possible to envision quantum cryptography providing a more secure alternative to present-day cryptographic methods for many secure communications functions. My talk will survey these remarkable developments.

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.

Network-Centric Quantum Communications

NASA Astrophysics Data System (ADS)

Hughes, Richard

2014-03-01

Single-photon quantum communications (QC) offers ``future-proof'' cryptographic security rooted in the laws of physics. Today's quantum-secured communications cannot be compromised by unanticipated future technological advances. But to date, QC has only existed in point-to-point instantiations that have limited ability to address the cyber security challenges of our increasingly networked world. In my talk I will describe a fundamentally new paradigm of network-centric quantum communications (NQC) that leverages the network to bring scalable, QC-based security to user groups that may have no direct user-to-user QC connectivity. With QC links only between each of N users and a trusted network node, NQC brings quantum security to N2 user pairs, and to multi-user groups. I will describe a novel integrated photonics quantum smartcard (``QKarD'') and its operation in a multi-node NQC test bed. The QKarDs are used to implement the quantum cryptographic protocols of quantum identification, quantum key distribution and quantum secret splitting. I will explain how these cryptographic primitives are used to provide key management for encryption, authentication, and non-repudiation for user-to-user communications. My talk will conclude with a description of a recent demonstration that QC can meet both the security and quality-of-service (latency) requirements for electric grid control commands and data. These requirements cannot be met simultaneously with present-day cryptography.

Low-power cryptographic coprocessor for autonomous wireless sensor networks

NASA Astrophysics Data System (ADS)

Olszyna, Jakub; Winiecki, Wiesław

2013-10-01

The concept of autonomous wireless sensor networks involves energy harvesting, as well as effective management of system resources. Public-key cryptography (PKC) offers the advantage of elegant key agreement schemes with which a secret key can be securely established over unsecure channels. In addition to solving the key management problem, the other major application of PKC is digital signatures, with which non-repudiation of messages exchanges can be achieved. The motivation for studying low-power and area efficient modular arithmetic algorithms comes from enabling public-key security for low-power devices that can perform under constrained environment like autonomous wireless sensor networks. This paper presents a cryptographic coprocessor tailored to the autonomous wireless sensor networks constraints. Such hardware circuit is aimed to support the implementation of different public-key cryptosystems based on modular arithmetic in GF(p) and GF(2m). Key components of the coprocessor are described as GEZEL models and can be easily transformed to VHDL and implemented in hardware.

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

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

Semiquantum secret sharing using entangled states

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

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

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

Quantum secret sharing with qudit graph states

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

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

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

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

PubMed

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

2017-05-30

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

R2NA: Received Signal Strength (RSS) Ratio-Based Node Authentication for Body Area Network

PubMed Central

Wu, Yang; Wang, Kai; Sun, Yongmei; Ji, Yuefeng

2013-01-01

The body area network (BAN) is an emerging branch of wireless sensor networks for personalized applications. The services in BAN usually have a high requirement on security, especially for the medical diagnosis. One of the fundamental directions to ensure security in BAN is how to provide node authentication. Traditional research using cryptography relies on prior secrets shared among nodes, which leads to high resource cost. In addition, most existing non-cryptographic solutions exploit out-of-band (OOB) channels, but they need the help of additional hardware support or significant modifications to the system software. To avoid the above problems, this paper presents a proximity-based node authentication scheme, which only uses wireless modules equipped on sensors. With only one sensor and one control unit (CU) in BAN, we could detect a unique physical layer characteristic, namely, the difference between the received signal strength (RSS) measured on different devices in BAN. Through the above-mentioned particular difference, we can tell whether the sender is close enough to be legitimate. We validate our scheme through both theoretical analysis and experiments, which are conducted on the real Shimmer nodes. The results demonstrate that our proposed scheme has a good security performance.

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

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

NASA Astrophysics Data System (ADS)

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

2017-10-01

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

A Secure Information Framework with APRQ Properties

NASA Astrophysics Data System (ADS)

Rupa, Ch.

2017-08-01

Internet of the things is the most trending topics in the digital world. Security issues are rampant. In the corporate or institutional setting, security risks are apparent from the outset. Market leaders are unable to use the cryptographic techniques due to their complexities. Hence many bits of private information, including ID, are readily available for third parties to see and to utilize. There is a need to decrease the complexity and increase the robustness of the cryptographic approaches. In view of this, a new cryptographic technique as good encryption pact with adjacency, random prime number and quantum code properties has been proposed. Here, encryption can be done by using quantum photons with gray code. This approach uses the concepts of physics and mathematics with no external key exchange to improve the security of the data. It also reduces the key attacks by generation of a key at the party side instead of sharing. This method makes the security more robust than with the existing approach. Important properties of gray code and quantum are adjacency property and different photons to a single bit (0 or 1). These can reduce the avalanche effect. Cryptanalysis of the proposed method shows that it is resistant to various attacks and stronger than the existing approaches.

Relativistic (2,3)-threshold quantum secret sharing

NASA Astrophysics Data System (ADS)

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

2017-09-01

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

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

NASA Astrophysics Data System (ADS)

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

2016-11-01

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

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

ERIC Educational Resources Information Center

Frijns, Tom; Finkenauer, Catrin; Keijsers, Loes

2013-01-01

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

Quantum secret sharing with identity authentication based on Bell states

NASA Astrophysics Data System (ADS)

Abulkasim, Hussein; Hamad, Safwat; Khalifa, Amal; El Bahnasy, Khalid

Quantum secret sharing techniques allow two parties or more to securely share a key, while the same number of parties or less can efficiently deduce the secret key. In this paper, we propose an authenticated quantum secret sharing protocol, where a quantum dialogue protocol is adopted to authenticate the identity of the parties. The participants simultaneously authenticate the identity of each other based on parts of a prior shared key. Moreover, the whole prior shared key can be reused for deducing the secret data. Although the proposed scheme does not significantly improve the efficiency performance, it is more secure compared to some existing quantum secret sharing scheme due to the identity authentication process. In addition, the proposed scheme can stand against participant attack, man-in-the-middle attack, impersonation attack, Trojan-horse attack as well as information leaks.

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.

Secure Embedded System Design Methodologies for Military Cryptographic Systems

DTIC Science & Technology

2016-03-31

Fault- Tree Analysis (FTA); Built-In Self-Test (BIST) Introduction Secure access-control systems restrict operations to authorized users via methods...failures in the individual software/processor elements, the question of exactly how unlikely is difficult to answer. Fault- Tree Analysis (FTA) has a...Collins of Sandia National Laboratories for years of sharing his extensive knowledge of Fail-Safe Design Assurance and Fault- Tree Analysis

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

Apparatus, system and method for providing cryptographic key information with physically unclonable function circuitry

DOEpatents

Areno, Matthew

2015-12-08

Techniques and mechanisms for providing a value from physically unclonable function (PUF) circuitry for a cryptographic operation of a security module. In an embodiment, a cryptographic engine receives a value from PUF circuitry and based on the value, outputs a result of a cryptographic operation to a bus of the security module. The bus couples the cryptographic engine to control logic or interface logic of the security module. In another embodiment, the value is provided to the cryptographic engine from the PUF circuitry via a signal line which is distinct from the bus, where any exchange of the value by either of the cryptographic engine and the PUF circuitry is for communication of the first value independent of the bus.

Eavesdropping on the improved three-party quantum secret sharing protocol

NASA Astrophysics Data System (ADS)

Gao, Gan

2011-02-01

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

A Note on Threshold Schemes with Disenrollment

DTIC Science & Technology

2003-01-01

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

Secret sharing based on quantum Fourier transform

NASA Astrophysics Data System (ADS)

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

2013-07-01

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

Breaking down the barriers of using strong authentication and encryption in resource constrained embedded systems

NASA Astrophysics Data System (ADS)

Knobler, Ron; Scheffel, Peter; Jackson, Scott; Gaj, Kris; Kaps, Jens Peter

2013-05-01

Various embedded systems, such as unattended ground sensors (UGS), are deployed in dangerous areas, where they are subject to compromise. Since numerous systems contain a network of devices that communicate with each other (often times with commercial off the shelf [COTS] radios), an adversary is able to intercept messages between system devices, which jeopardizes sensitive information transmitted by the system (e.g. location of system devices). Secret key algorithms such as AES are a very common means to encrypt all system messages to a sufficient security level, for which lightweight implementations exist for even very resource constrained devices. However, all system devices must use the appropriate key to encrypt and decrypt messages from each other. While traditional public key algorithms (PKAs), such as RSA and Elliptic Curve Cryptography (ECC), provide a sufficiently secure means to provide authentication and a means to exchange keys, these traditional PKAs are not suitable for very resource constrained embedded systems or systems which contain low reliability communication links (e.g. mesh networks), especially as the size of the network increases. Therefore, most UGS and other embedded systems resort to pre-placed keys (PPKs) or other naïve schemes which greatly reduce the security and effectiveness of the overall cryptographic approach. McQ has teamed with the Cryptographic Engineering Research Group (CERG) at George Mason University (GMU) to develop an approach using revolutionary cryptographic techniques that provides both authentication and encryption, but on resource constrained embedded devices, without the burden of large amounts of key distribution or storage.

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

NASA Astrophysics Data System (ADS)

Ray, Maharshi; Chatterjee, Sourav; Chakrabarty, Indranil

2016-05-01

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

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

NASA Astrophysics Data System (ADS)

Matsumoto, Ryutaroh

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

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

NASA Astrophysics Data System (ADS)

Matsumoto, Ryutaroh

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

An adaptive cryptographic accelerator for network storage security on dynamically reconfigurable platform

NASA Astrophysics Data System (ADS)

Tang, Li; Liu, Jing-Ning; Feng, Dan; Tong, Wei

2008-12-01

Existing security solutions in network storage environment perform poorly because cryptographic operations (encryption and decryption) implemented in software can dramatically reduce system performance. In this paper we propose a cryptographic hardware accelerator on dynamically reconfigurable platform for the security of high performance network storage system. We employ a dynamic reconfigurable platform based on a FPGA to implement a PowerPCbased embedded system, which executes cryptographic algorithms. To reduce the reconfiguration latency, we apply prefetch scheduling. Moreover, the processing elements could be dynamically configured to support different cryptographic algorithms according to the request received by the accelerator. In the experiment, we have implemented AES (Rijndael) and 3DES cryptographic algorithms in the reconfigurable accelerator. Our proposed reconfigurable cryptographic accelerator could dramatically increase the performance comparing with the traditional software-based network storage systems.

ID-based encryption scheme with revocation

NASA Astrophysics Data System (ADS)

Othman, Hafizul Azrie; Ismail, Eddie Shahril

2017-04-01

In 2015, Meshram proposed an efficient ID-based cryptographic encryption based on the difficulty of solving discrete logarithm and integer-factoring problems. The scheme was pairing free and claimed to be secure against adaptive chosen plaintext attacks (CPA). Later, Tan et al. proved that the scheme was insecure by presenting a method to recover the secret master key and to obtain prime factorization of modulo n. In this paper, we propose a new pairing-free ID-based encryption scheme with revocation based on Meshram's ID-based encryption scheme, which is also secure against Tan et al.'s 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.

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.

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

DOEpatents

Kroeger, Thomas M.; Benson, Thomas R.

2016-12-06

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

Quantum secret sharing for a general quantum access structure

NASA Astrophysics Data System (ADS)

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

2017-10-01

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

Entanglement-secured single-qubit quantum secret sharing

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

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

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

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

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.

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.

Using Cryptography to Improve Conjunction Analysis

NASA Astrophysics Data System (ADS)

Hemenway, B.; Welser, B.; Baiocchi, D.

2012-09-01

Coordination of operations between satellite operators is becoming increasingly important to prevent collisions. Unfortunately, this coordination is often handicapped by a lack of trust. Coordination and cooperation between satellite operators can take many forms, however, one specific area where cooperation between operators would yield significant benefits is in the computation of conjunction analyses. Passively collected orbital are of generally of too low fidelity to be of use in conjunction analyses. Each operator, however, maintains high fidelity data about their own satellites. These high fidelity data are significantly more valuable in calculating conjunction analyses than the lower-fidelity data. If operators were to share their high fidelity data overall space situational awareness could be improved. At present, many operators do not share data and as a consequence space situational awareness suffers. Restrictive data sharing policies are primarily motivated by privacy concerns on the part of the satellite operators, as each operator is reluctant or unwilling to share data that might compromise its political or commercial interests. In order to perform the necessary conjunction analyses while still maintaining the privacy of their own data, a few operators have entered data sharing agreements. These operators provide their private data to a trusted outside party, who then performs the conjunction analyses and reports the results to the operators. These types of agreements are not an ideal solution as they require a degree of trust between the parties, and the cost of employing the trusted party can be large. In this work, we present and analyze cryptographic tools that would allow satellite operators to securely calculate conjunction analyses without the help of a trusted outside party, while provably maintaining the privacy of their own orbital information. For example, recent advances in cryptographic protocols, specifically in the area of secure Multiparty Computation (MPC) have the potential to allow satellite operators to perform the necessary conjunction analyses without the need to reveal their orbital information to anyone. This talk will describe how MPC works, and how we propose to use it to facilitate secure information sharing between satellite operators.

Verifiable Secret Redistribution

DTIC Science & Technology

2001-10-01

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

Unconditional security of entanglement-based continuous-variable quantum secret sharing

NASA Astrophysics Data System (ADS)

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

2017-01-01

The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it. While several variants of this protocol have been investigated, including realizations using quantum systems, the security of quantum secret sharing schemes still remains unproven almost two decades after their original conception. Here we establish an unconditional security proof for entanglement-based continuous-variable quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players. We tackle the problem by resorting to the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate theoretically the feasibility of our scheme, which can be implemented by Gaussian states and homodyne measurements, with no need for ideal single-photon sources or quantum memories. Our results contribute to validating quantum secret sharing as a viable primitive for quantum technologies.

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.

High-Dimensional Circular Quantum Secret Sharing Using Orbital Angular Momentum

NASA Astrophysics Data System (ADS)

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

2016-11-01

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

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.

PKPass

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

Adamson, Ryan M.

Password management solutions exist, but few are designed for enterprise systems administrators sharing oncall rotations. Due to the Multi-Factor Level of Assurance 4 effort, DOE is now distributing PIV cards with cryptographically signed certificate and private key pairs to administrators and other security-significant users. We utilize this public key infrastructure (PKI) to encrypt passwords for other recipients in a secure way. This is cross platform (works on OSX and Linux systems), and has already been adopted internally by the NCCS systems administration staff to replace their old password book system.

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.

Number theoretical foundations in cryptography

NASA Astrophysics Data System (ADS)

Atan, Kamel Ariffin Mohd

2017-08-01

In recent times the hazards in relationships among entities in different establishments worldwide have generated exciting developments in cryptography. Central to this is the theory of numbers. This area of mathematics provides very rich source of fundamental materials for constructing secret codes. Some number theoretical concepts that have been very actively used in designing crypto systems will be highlighted in this presentation. This paper will begin with introduction to basic number theoretical concepts which for many years have been thought to have no practical applications. This will include several theoretical assertions that were discovered much earlier in the historical development of number theory. This will be followed by discussion on the "hidden" properties of these assertions that were later exploited by designers of cryptosystems in their quest for developing secret codes. This paper also highlights some earlier and existing cryptosystems and the role played by number theoretical concepts in their constructions. The role played by cryptanalysts in detecting weaknesses in the systems developed by cryptographers concludes this presentation.

Multi-party semi-quantum key distribution-convertible multi-party semi-quantum secret sharing

NASA Astrophysics Data System (ADS)

Yu, Kun-Fei; Gu, Jun; Hwang, Tzonelih; Gope, Prosanta

2017-08-01

This paper proposes a multi-party semi-quantum secret sharing (MSQSS) protocol which allows a quantum party (manager) to share a secret among several classical parties (agents) based on GHZ-like states. By utilizing the special properties of GHZ-like states, the proposed scheme can easily detect outside eavesdropping attacks and has the highest qubit efficiency among the existing MSQSS protocols. Then, we illustrate an efficient way to convert the proposed MSQSS protocol into a multi-party semi-quantum key distribution (MSQKD) protocol. The proposed approach is even useful to convert all the existing measure-resend type of semi-quantum secret sharing protocols into semi-quantum key distribution protocols.

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.

An overview of human genetic privacy

PubMed Central

Shi, Xinghua; Wu, Xintao

2016-01-01

The study of human genomics is becoming a Big Data science, owing to recent biotechnological advances leading to availability of millions of personal genome sequences, which can be combined with biometric measurements from mobile apps and fitness trackers, and of human behavior data monitored from mobile devices and social media. With increasing research opportunities for integrative genomic studies through data sharing, genetic privacy emerges as a legitimate yet challenging concern that needs to be carefully addressed, not only for individuals but also for their families. In this paper, we present potential genetic privacy risks and relevant ethics and regulations for sharing and protecting human genomics data. We also describe the techniques for protecting human genetic privacy from three broad perspectives: controlled access, differential privacy, and cryptographic solutions. PMID:27626905

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

NASA Astrophysics Data System (ADS)

Gao, Gan; Wang, Yue; Wang, Dong

2018-03-01

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

A New Improving Quantum Secret Sharing Scheme

NASA Astrophysics Data System (ADS)

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

2017-04-01

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

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

NASA Astrophysics Data System (ADS)

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

2016-05-01

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

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.

Secure method for biometric-based recognition with integrated cryptographic functions.

PubMed

Chiou, Shin-Yan

2013-01-01

Biometric systems refer to biometric technologies which can be used to achieve authentication. Unlike cryptography-based technologies, the ratio for certification in biometric systems needs not to achieve 100% accuracy. However, biometric data can only be directly compared through proximal access to the scanning device and cannot be combined with cryptographic techniques. Moreover, repeated use, improper storage, or transmission leaks may compromise security. Prior studies have attempted to combine cryptography and biometrics, but these methods require the synchronization of internal systems and are vulnerable to power analysis attacks, fault-based cryptanalysis, and replay attacks. This paper presents a new secure cryptographic authentication method using biometric features. The proposed system combines the advantages of biometric identification and cryptographic techniques. By adding a subsystem to existing biometric recognition systems, we can simultaneously achieve the security of cryptographic technology and the error tolerance of biometric recognition. This method can be used for biometric data encryption, signatures, and other types of cryptographic computation. The method offers a high degree of security with protection against power analysis attacks, fault-based cryptanalysis, and replay attacks. Moreover, it can be used to improve the confidentiality of biological data storage and biodata identification processes. Remote biometric authentication can also be safely applied.

Dynamic quantum secret sharing by using d-dimensional GHZ state

NASA Astrophysics Data System (ADS)

Qin, Huawang; Dai, Yuewei

2017-03-01

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

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

NASA Astrophysics Data System (ADS)

Gao, Gan; Wang, Li-Ping

2010-11-01

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

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

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

NASA Astrophysics Data System (ADS)

Takahashi, Junko; Fukunaga, Toshinori

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

An overview of human genetic privacy.

PubMed

Shi, Xinghua; Wu, Xintao

2017-01-01

The study of human genomics is becoming a Big Data science, owing to recent biotechnological advances leading to availability of millions of personal genome sequences, which can be combined with biometric measurements from mobile apps and fitness trackers, and of human behavior data monitored from mobile devices and social media. With increasing research opportunities for integrative genomic studies through data sharing, genetic privacy emerges as a legitimate yet challenging concern that needs to be carefully addressed, not only for individuals but also for their families. In this paper, we present potential genetic privacy risks and relevant ethics and regulations for sharing and protecting human genomics data. We also describe the techniques for protecting human genetic privacy from three broad perspectives: controlled access, differential privacy, and cryptographic solutions. © 2016 New York Academy of Sciences.

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.

Hardware device binding and mutual authentication

DOEpatents

Hamlet, Jason R; Pierson, Lyndon G

2014-03-04

Detection and deterrence of device tampering and subversion by substitution may be achieved by including a cryptographic unit within a computing device for binding multiple hardware devices and mutually authenticating the devices. The cryptographic unit includes a physically unclonable function ("PUF") circuit disposed in or on the hardware device, which generates a binding PUF value. The cryptographic unit uses the binding PUF value during an enrollment phase and subsequent authentication phases. During a subsequent authentication phase, the cryptographic unit uses the binding PUF values of the multiple hardware devices to generate a challenge to send to the other device, and to verify a challenge received from the other device to mutually authenticate the hardware devices.

Memristive crypto primitive for building highly secure physical unclonable functions

NASA Astrophysics Data System (ADS)

Gao, Yansong; Ranasinghe, Damith C.; Al-Sarawi, Said F.; Kavehei, Omid; Abbott, Derek

2015-08-01

Physical unclonable functions (PUFs) exploit the intrinsic complexity and irreproducibility of physical systems to generate secret information. The advantage is that PUFs have the potential to provide fundamentally higher security than traditional cryptographic methods by preventing the cloning of devices and the extraction of secret keys. Most PUF designs focus on exploiting process variations in Complementary Metal Oxide Semiconductor (CMOS) technology. In recent years, progress in nanoelectronic devices such as memristors has demonstrated the prevalence of process variations in scaling electronics down to the nano region. In this paper, we exploit the extremely large information density available in nanocrossbar architectures and the significant resistance variations of memristors to develop an on-chip memristive device based strong PUF (mrSPUF). Our novel architecture demonstrates desirable characteristics of PUFs, including uniqueness, reliability, and large number of challenge-response pairs (CRPs) and desirable characteristics of strong PUFs. More significantly, in contrast to most existing PUFs, our PUF can act as a reconfigurable PUF (rPUF) without additional hardware and is of benefit to applications needing revocation or update of secure key information.

Memristive crypto primitive for building highly secure physical unclonable functions.

PubMed

Gao, Yansong; Ranasinghe, Damith C; Al-Sarawi, Said F; Kavehei, Omid; Abbott, Derek

2015-08-04

Physical unclonable functions (PUFs) exploit the intrinsic complexity and irreproducibility of physical systems to generate secret information. The advantage is that PUFs have the potential to provide fundamentally higher security than traditional cryptographic methods by preventing the cloning of devices and the extraction of secret keys. Most PUF designs focus on exploiting process variations in Complementary Metal Oxide Semiconductor (CMOS) technology. In recent years, progress in nanoelectronic devices such as memristors has demonstrated the prevalence of process variations in scaling electronics down to the nano region. In this paper, we exploit the extremely large information density available in nanocrossbar architectures and the significant resistance variations of memristors to develop an on-chip memristive device based strong PUF (mrSPUF). Our novel architecture demonstrates desirable characteristics of PUFs, including uniqueness, reliability, and large number of challenge-response pairs (CRPs) and desirable characteristics of strong PUFs. More significantly, in contrast to most existing PUFs, our PUF can act as a reconfigurable PUF (rPUF) without additional hardware and is of benefit to applications needing revocation or update of secure key information.

Memristive crypto primitive for building highly secure physical unclonable functions

PubMed Central

Gao, Yansong; Ranasinghe, Damith C.; Al-Sarawi, Said F.; Kavehei, Omid; Abbott, Derek

2015-01-01

Physical unclonable functions (PUFs) exploit the intrinsic complexity and irreproducibility of physical systems to generate secret information. The advantage is that PUFs have the potential to provide fundamentally higher security than traditional cryptographic methods by preventing the cloning of devices and the extraction of secret keys. Most PUF designs focus on exploiting process variations in Complementary Metal Oxide Semiconductor (CMOS) technology. In recent years, progress in nanoelectronic devices such as memristors has demonstrated the prevalence of process variations in scaling electronics down to the nano region. In this paper, we exploit the extremely large information density available in nanocrossbar architectures and the significant resistance variations of memristors to develop an on-chip memristive device based strong PUF (mrSPUF). Our novel architecture demonstrates desirable characteristics of PUFs, including uniqueness, reliability, and large number of challenge-response pairs (CRPs) and desirable characteristics of strong PUFs. More significantly, in contrast to most existing PUFs, our PUF can act as a reconfigurable PUF (rPUF) without additional hardware and is of benefit to applications needing revocation or update of secure key information. PMID:26239669

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.

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

NASA Astrophysics Data System (ADS)

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

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

Implementing Diffie-Hellman key exchange using quantum EPR pairs

NASA Astrophysics Data System (ADS)

Mandal, Sayonnha; Parakh, Abhishek

2015-05-01

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

Secure Method for Biometric-Based Recognition with Integrated Cryptographic Functions

PubMed Central

Chiou, Shin-Yan

2013-01-01

Biometric systems refer to biometric technologies which can be used to achieve authentication. Unlike cryptography-based technologies, the ratio for certification in biometric systems needs not to achieve 100% accuracy. However, biometric data can only be directly compared through proximal access to the scanning device and cannot be combined with cryptographic techniques. Moreover, repeated use, improper storage, or transmission leaks may compromise security. Prior studies have attempted to combine cryptography and biometrics, but these methods require the synchronization of internal systems and are vulnerable to power analysis attacks, fault-based cryptanalysis, and replay attacks. This paper presents a new secure cryptographic authentication method using biometric features. The proposed system combines the advantages of biometric identification and cryptographic techniques. By adding a subsystem to existing biometric recognition systems, we can simultaneously achieve the security of cryptographic technology and the error tolerance of biometric recognition. This method can be used for biometric data encryption, signatures, and other types of cryptographic computation. The method offers a high degree of security with protection against power analysis attacks, fault-based cryptanalysis, and replay attacks. Moreover, it can be used to improve the confidentiality of biological data storage and biodata identification processes. Remote biometric authentication can also be safely applied. PMID:23762851

On Asymptotically Good Ramp Secret Sharing Schemes

NASA Astrophysics Data System (ADS)

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

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

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

NASA Astrophysics Data System (ADS)

Qin, Huawang; Dai, Yuewei

2016-04-01

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

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

NASA Astrophysics Data System (ADS)

Guo, Ying; Luo, Peng; Wang, Yijun

2016-11-01

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

A cryptographic key management solution for HIPAA privacy/security regulations.

PubMed

Lee, W-B; Lee, C-D

2008-01-01

The Health Insurance Portability and Accountability Act (HIPAA) privacy and security regulations are two crucial provisions in the protection of healthcare privacy. Privacy regulations create a principle to assure that patients have more control over their health information and set limits on the use and disclosure of health information. The security regulations stipulate the provisions implemented to guard data integrity, confidentiality, and availability. Undoubtedly, the cryptographic mechanisms are well defined to provide suitable solutions. In this paper, to comply with the HIPAA regulations, a flexible cryptographic key management solution is proposed to facilitate interoperations among the applied cryptographic mechanisms. In addition, case of consent exceptions intended to facilitate emergency applications and other possible exceptions can also be handled easily.

Hardware device to physical structure binding and authentication

DOEpatents

Hamlet, Jason R.; Stein, David J.; Bauer, Todd M.

2013-08-20

Detection and deterrence of device tampering and subversion may be achieved by including a cryptographic fingerprint unit within a hardware device for authenticating a binding of the hardware device and a physical structure. The cryptographic fingerprint unit includes an internal physically unclonable function ("PUF") circuit disposed in or on the hardware device, which generate an internal PUF value. Binding logic is coupled to receive the internal PUF value, as well as an external PUF value associated with the physical structure, and generates a binding PUF value, which represents the binding of the hardware device and the physical structure. The cryptographic fingerprint unit also includes a cryptographic unit that uses the binding PUF value to allow a challenger to authenticate the binding.

Enabling Analytics on Sensitive Medical Data with Secure Multi-Party Computation.

PubMed

Veeningen, Meilof; Chatterjea, Supriyo; Horváth, Anna Zsófia; Spindler, Gerald; Boersma, Eric; van der Spek, Peter; van der Galiën, Onno; Gutteling, Job; Kraaij, Wessel; Veugen, Thijs

2018-01-01

While there is a clear need to apply data analytics in the healthcare sector, this is often difficult because it requires combining sensitive data from multiple data sources. In this paper, we show how the cryptographic technique of secure multi-party computation can enable such data analytics by performing analytics without the need to share the underlying data. We discuss the issue of compliance to European privacy legislation; report on three pilots bringing these techniques closer to practice; and discuss the main challenges ahead to make fully privacy-preserving data analytics in the medical sector commonplace.

An Expressive, Lightweight and Secure Construction of Key Policy Attribute-Based Cloud Data Sharing Access Control

NASA Astrophysics Data System (ADS)

Lin, Guofen; Hong, Hanshu; Xia, Yunhao; Sun, Zhixin

2017-10-01

Attribute-based encryption (ABE) is an interesting cryptographic technique for flexible cloud data sharing access control. However, some open challenges hinder its practical application. In previous schemes, all attributes are considered as in the same status while they are not in most of practical scenarios. Meanwhile, the size of access policy increases dramatically with the raise of its expressiveness complexity. In addition, current research hardly notices that mobile front-end devices, such as smartphones, are poor in computational performance while too much bilinear pairing computation is needed for ABE. In this paper, we propose a key-policy weighted attribute-based encryption without bilinear pairing computation (KP-WABE-WB) for secure cloud data sharing access control. A simple weighted mechanism is presented to describe different importance of each attribute. We introduce a novel construction of ABE without executing any bilinear pairing computation. Compared to previous schemes, our scheme has a better performance in expressiveness of access policy and computational efficiency.

Cryptanalysis and Improvement of the Semi-quantum Secret Sharing Protocol

NASA Astrophysics Data System (ADS)

Gao, Xiang; Zhang, Shibin; Chang, Yan

2017-08-01

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

Quantum secret sharing via local operations and classical communication.

PubMed

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

2015-11-20

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

Comment on "Dynamic quantum secret sharing"

NASA Astrophysics Data System (ADS)

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

2013-10-01

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

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

Mechanical Verification of Cryptographic Protocols

NASA Astrophysics Data System (ADS)

Cheng, Xiaochun; Ma, Xiaoqi; Huang, Scott C.-H.; Cheng, Maggie

Information security is playing an increasingly important role in modern society, driven especially by the uptake of the Internet for information transfer. Large amount of information is transmitted everyday through the Internet, which is often the target of malicious attacks. In certain areas, this issue is vital. For example, military departments of governments often transmit a great amount of top-secret data, which, if divulged, could become a huge threat to the public and to national security. Even in our daily life, it is also necessary to protect information. Consider e-commerce systems as an example. No one is willing to purchase anything over the Internet before being assured that all their personal and financial information will always be kept secure and will never be leaked to any unauthorised person or organisation.

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.

Run-length encoding graphic rules, biochemically editable designs and steganographical numeric data embedment for DNA-based cryptographical coding system.

PubMed

Kawano, Tomonori

2013-03-01

There have been a wide variety of approaches for handling the pieces of DNA as the "unplugged" tools for digital information storage and processing, including a series of studies applied to the security-related area, such as DNA-based digital barcodes, water marks and cryptography. In the present article, novel designs of artificial genes as the media for storing the digitally compressed data for images are proposed for bio-computing purpose while natural genes principally encode for proteins. Furthermore, the proposed system allows cryptographical application of DNA through biochemically editable designs with capacity for steganographical numeric data embedment. As a model case of image-coding DNA technique application, numerically and biochemically combined protocols are employed for ciphering the given "passwords" and/or secret numbers using DNA sequences. The "passwords" of interest were decomposed into single letters and translated into the font image coded on the separate DNA chains with both the coding regions in which the images are encoded based on the novel run-length encoding rule, and the non-coding regions designed for biochemical editing and the remodeling processes revealing the hidden orientation of letters composing the original "passwords." The latter processes require the molecular biological tools for digestion and ligation of the fragmented DNA molecules targeting at the polymerase chain reaction-engineered termini of the chains. Lastly, additional protocols for steganographical overwriting of the numeric data of interests over the image-coding DNA are also discussed.

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.

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.

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

Two-party secret key distribution via a modified quantum secret sharing protocol.

PubMed

Grice, W P; Evans, P G; Lawrie, B; Legré, M; Lougovski, P; Ray, W; Williams, B P; Qi, B; Smith, A M

2015-03-23

We present and demonstrate a novel protocol for distributing secret keys between two and only two parties based on N-party single-qubit Quantum Secret Sharing (QSS). We demonstrate our new protocol with N = 3 parties using phase-encoded photons. 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. Our implementation allows for an accessible transition between N-party QSS and arbitrary two party QKD without modification of hardware. In addition, our approach significantly reduces the number of resources such as single photon detectors, lasers and dark fiber connections needed to implement QKD.

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

Use of One Time Pad Algorithm for Bit Plane Security Improvement

NASA Astrophysics Data System (ADS)

Suhardi; Suwilo, Saib; Budhiarti Nababan, Erna

2017-12-01

BPCS (Bit-Plane Complexity Segmentation) which is one of the steganography techniques that utilizes the human vision characteristics that cannot see the change in binary patterns that occur in the image. This technique performs message insertion by making a switch to a high-complexity bit-plane or noise-like regions with bits of secret messages. Bit messages that were previously stored precisely result the message extraction process to be done easily by rearranging a set of previously stored characters in noise-like region in the image. Therefore the secret message becomes easily known by others. In this research, the process of replacing bit plane with message bits is modified by utilizing One Time Pad cryptography technique which aims to increase security in bit plane. In the tests performed, the combination of One Time Pad cryptographic algorithm to the steganography technique of BPCS works well in the insertion of messages into the vessel image, although in insertion into low-dimensional images is poor. The comparison of the original image with the stegoimage looks identical and produces a good quality image with a mean value of PSNR above 30db when using a largedimensional image as the cover messages.

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.

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

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.

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.

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

Cryptography for a High-Assurance Web-Based Enterprise

DTIC Science & Technology

2013-10-01

2. Other Cryptographic services - Java provides many cryptographic services through the Java Cryptography Architecture (JCA) framework. The...id=2125 [7]. Miller, Sandra Kay, Fiber Optic Networks Vulnerable to Attack, Information Security Magazine, November 15, 2006, [8]. José R.C

Cryptographic Securities Exchanges

NASA Astrophysics Data System (ADS)

Thorpe, Christopher; Parkes, David C.

While transparency in financial markets should enhance liquidity, its exploitation by unethical and parasitic traders discourages others from fully embracing disclosure of their own information. Traders exploit both the private information in upstairs markets used to trade large orders outside traditional exchanges and the public information present in exchanges' quoted limit order books. Using homomorphic cryptographic protocols, market designers can create "partially transparent" markets in which every matched trade is provably correct and only beneficial information is revealed. In a cryptographic securities exchange, market operators can hide information to prevent its exploitation, and still prove facts about the hidden information such as bid/ask spread or market depth.

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

Run-length encoding graphic rules, biochemically editable designs and steganographical numeric data embedment for DNA-based cryptographical coding system

PubMed Central

Kawano, Tomonori

2013-01-01

There have been a wide variety of approaches for handling the pieces of DNA as the “unplugged” tools for digital information storage and processing, including a series of studies applied to the security-related area, such as DNA-based digital barcodes, water marks and cryptography. In the present article, novel designs of artificial genes as the media for storing the digitally compressed data for images are proposed for bio-computing purpose while natural genes principally encode for proteins. Furthermore, the proposed system allows cryptographical application of DNA through biochemically editable designs with capacity for steganographical numeric data embedment. As a model case of image-coding DNA technique application, numerically and biochemically combined protocols are employed for ciphering the given “passwords” and/or secret numbers using DNA sequences. The “passwords” of interest were decomposed into single letters and translated into the font image coded on the separate DNA chains with both the coding regions in which the images are encoded based on the novel run-length encoding rule, and the non-coding regions designed for biochemical editing and the remodeling processes revealing the hidden orientation of letters composing the original “passwords.” The latter processes require the molecular biological tools for digestion and ligation of the fragmented DNA molecules targeting at the polymerase chain reaction-engineered termini of the chains. Lastly, additional protocols for steganographical overwriting of the numeric data of interests over the image-coding DNA are also discussed. PMID:23750303

Deductive Verification of Cryptographic Software

NASA Technical Reports Server (NTRS)

Almeida, Jose Barcelar; Barbosa, Manuel; Pinto, Jorge Sousa; Vieira, Barbara

2009-01-01

We report on the application of an off-the-shelf verification platform to the RC4 stream cipher cryptographic software implementation (as available in the openSSL library), and introduce a deductive verification technique based on self-composition for proving the absence of error propagation.

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

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

Christy, J. E.; Nickless, W. K.; Thiede, D. R.

The Transport version 3 (T3) system uses the Network News Transfer Protocol (NNTP) to move data from sources to a Data Reporisoty (DR). Interested recipients subscribe to newsgroups to retrieve data. Data in transport is protected by AES-256 and RSA cryptographic services provided by the external OpenSSL cryptographic libraries.

Report on Pairing-based Cryptography.

PubMed

Moody, Dustin; Peralta, Rene; Perlner, Ray; Regenscheid, Andrew; Roginsky, Allen; Chen, Lily

2015-01-01

This report summarizes study results on pairing-based cryptography. The main purpose of the study is to form NIST's position on standardizing and recommending pairing-based cryptography schemes currently published in research literature and standardized in other standard bodies. The report reviews the mathematical background of pairings. This includes topics such as pairing-friendly elliptic curves and how to compute various pairings. It includes a brief introduction to existing identity-based encryption (IBE) schemes and other cryptographic schemes using pairing technology. The report provides a complete study of the current status of standard activities on pairing-based cryptographic schemes. It explores different application scenarios for pairing-based cryptography schemes. As an important aspect of adopting pairing-based schemes, the report also considers the challenges inherent in validation testing of cryptographic algorithms and modules. Based on the study, the report suggests an approach for including pairing-based cryptography schemes in the NIST cryptographic toolkit. The report also outlines several questions that will require further study if this approach is followed.

Report on Pairing-based Cryptography

PubMed Central

Moody, Dustin; Peralta, Rene; Perlner, Ray; Regenscheid, Andrew; Roginsky, Allen; Chen, Lily

2015-01-01

This report summarizes study results on pairing-based cryptography. The main purpose of the study is to form NIST’s position on standardizing and recommending pairing-based cryptography schemes currently published in research literature and standardized in other standard bodies. The report reviews the mathematical background of pairings. This includes topics such as pairing-friendly elliptic curves and how to compute various pairings. It includes a brief introduction to existing identity-based encryption (IBE) schemes and other cryptographic schemes using pairing technology. The report provides a complete study of the current status of standard activities on pairing-based cryptographic schemes. It explores different application scenarios for pairing-based cryptography schemes. As an important aspect of adopting pairing-based schemes, the report also considers the challenges inherent in validation testing of cryptographic algorithms and modules. Based on the study, the report suggests an approach for including pairing-based cryptography schemes in the NIST cryptographic toolkit. The report also outlines several questions that will require further study if this approach is followed. PMID:26958435

A covert authentication and security solution for GMOs.

PubMed

Mueller, Siguna; Jafari, Farhad; Roth, Don

2016-09-21

Proliferation and expansion of security risks necessitates new measures to ensure authenticity and validation of GMOs. Watermarking and other cryptographic methods are available which conceal and recover the original signature, but in the process reveal the authentication information. In many scenarios watermarking and standard cryptographic methods are necessary but not sufficient and new, more advanced, cryptographic protocols are necessary. Herein, we present a new crypto protocol, that is applicable in broader settings, and embeds the authentication string indistinguishably from a random element in the signature space and the string is verified or denied without disclosing the actual signature. Results show that in a nucleotide string of 1000, the algorithm gives a correlation of 0.98 or higher between the distribution of the codon and that of E. coli, making the signature virtually invisible. This algorithm may be used to securely authenticate and validate GMOs without disclosing the actual signature. While this protocol uses watermarking, its novelty is in use of more complex cryptographic techniques based on zero knowledge proofs to encode information.

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

75 FR 52798 - State-07, Cryptographic Clearance Records

Federal Register 2010, 2011, 2012, 2013, 2014

2010-08-27

... of records, Authority for maintenance of the system, Purpose, Safeguards and Retrievability as well... INDIVIDUALS COVERED BY THE SYSTEM: All current Civil Service and Foreign Service direct hire employees of the... well as those who have already received cryptographic clearance. CATEGORIES OF RECORDS IN THE SYSTEM...

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.

Developing a Standard Method for Link-Layer Security of CCSDS Space Communications

NASA Technical Reports Server (NTRS)

Biggerstaff, Craig

2009-01-01

Communications security for space systems has been a specialized field generally far removed from considerations of mission interoperability and cross-support in fact, these considerations often have been viewed as intrinsically opposed to security objectives. The space communications protocols defined by the Consultative Committee for Space Data Systems (CCSDS) have a twenty-five year history of successful use in over 400 missions. While the CCSDS Telemetry, Telecommand, and Advancing Orbiting Systems protocols for use at OSI Layer 2 are operationally mature, there has been no direct support within these protocols for communications security techniques. Link-layer communications security has been successfully implemented in the past using mission-unique methods, but never before with an objective of facilitating cross-support and interoperability. This paper discusses the design of a standard method for cryptographic authentication, encryption, and replay protection at the data link layer that can be integrated into existing CCSDS protocols without disruption to legacy communications services. Integrating cryptographic operations into existing data structures and processing sequences requires a careful assessment of the potential impediments within spacecraft, ground stations, and operations centers. The objective of this work is to provide a sound method for cryptographic encapsulation of frame data that also facilitates Layer 2 virtual channel switching, such that a mission may procure data transport services as needed without involving third parties in the cryptographic processing, or split independent data streams for separate cryptographic processing.

Secure key from bound entanglement.

PubMed

Horodecki, Karol; Horodecki, Michał; Horodecki, Paweł; Oppenheim, Jonathan

2005-04-29

We characterize the set of shared quantum states which contain a cryptographically private key. This allows us to recast the theory of privacy as a paradigm closely related to that used in entanglement manipulation. It is shown that one can distill an arbitrarily secure key from bound entangled states. There are also states that have less distillable private keys than the entanglement cost of the state. In general, the amount of distillable key is bounded from above by the relative entropy of entanglement. Relationships between distillability and distinguishability are found for a class of states which have Bell states correlated to separable hiding states. We also describe a technique for finding states exhibiting irreversibility in entanglement distillation.

Identifying genetic relatives without compromising privacy

PubMed Central

He, Dan; Furlotte, Nicholas A.; Hormozdiari, Farhad; Joo, Jong Wha J.; Wadia, Akshay; Ostrovsky, Rafail; Sahai, Amit; Eskin, Eleazar

2014-01-01

The development of high-throughput genomic technologies has impacted many areas of genetic research. While many applications of these technologies focus on the discovery of genes involved in disease from population samples, applications of genomic technologies to an individual’s genome or personal genomics have recently gained much interest. One such application is the identification of relatives from genetic data. In this application, genetic information from a set of individuals is collected in a database, and each pair of individuals is compared in order to identify genetic relatives. An inherent issue that arises in the identification of relatives is privacy. In this article, we propose a method for identifying genetic relatives without compromising privacy by taking advantage of novel cryptographic techniques customized for secure and private comparison of genetic information. We demonstrate the utility of these techniques by allowing a pair of individuals to discover whether or not they are related without compromising their genetic information or revealing it to a third party. The idea is that individuals only share enough special-purpose cryptographically protected information with each other to identify whether or not they are relatives, but not enough to expose any information about their genomes. We show in HapMap and 1000 Genomes data that our method can recover first- and second-order genetic relationships and, through simulations, show that our method can identify relationships as distant as third cousins while preserving privacy. PMID:24614977

Identifying genetic relatives without compromising privacy.

PubMed

He, Dan; Furlotte, Nicholas A; Hormozdiari, Farhad; Joo, Jong Wha J; Wadia, Akshay; Ostrovsky, Rafail; Sahai, Amit; Eskin, Eleazar

2014-04-01

The development of high-throughput genomic technologies has impacted many areas of genetic research. While many applications of these technologies focus on the discovery of genes involved in disease from population samples, applications of genomic technologies to an individual's genome or personal genomics have recently gained much interest. One such application is the identification of relatives from genetic data. In this application, genetic information from a set of individuals is collected in a database, and each pair of individuals is compared in order to identify genetic relatives. An inherent issue that arises in the identification of relatives is privacy. In this article, we propose a method for identifying genetic relatives without compromising privacy by taking advantage of novel cryptographic techniques customized for secure and private comparison of genetic information. We demonstrate the utility of these techniques by allowing a pair of individuals to discover whether or not they are related without compromising their genetic information or revealing it to a third party. The idea is that individuals only share enough special-purpose cryptographically protected information with each other to identify whether or not they are relatives, but not enough to expose any information about their genomes. We show in HapMap and 1000 Genomes data that our method can recover first- and second-order genetic relationships and, through simulations, show that our method can identify relationships as distant as third cousins while preserving privacy.

Random multispace quantization as an analytic mechanism for BioHashing of biometric and random identity inputs.

PubMed

Teoh, Andrew B J; Goh, Alwyn; Ngo, David C L

2006-12-01

Biometric analysis for identity verification is becoming a widespread reality. Such implementations necessitate large-scale capture and storage of biometric data, which raises serious issues in terms of data privacy and (if such data is compromised) identity theft. These problems stem from the essential permanence of biometric data, which (unlike secret passwords or physical tokens) cannot be refreshed or reissued if compromised. Our previously presented biometric-hash framework prescribes the integration of external (password or token-derived) randomness with user-specific biometrics, resulting in bitstring outputs with security characteristics (i.e., noninvertibility) comparable to cryptographic ciphers or hashes. The resultant BioHashes are hence cancellable, i.e., straightforwardly revoked and reissued (via refreshed password or reissued token) if compromised. BioHashing furthermore enhances recognition effectiveness, which is explained in this paper as arising from the Random Multispace Quantization (RMQ) of biometric and external random inputs.

A Trustworthy Key Generation Prototype Based on DDR3 PUF for Wireless Sensor Networks

PubMed Central

Liu, Wenchao; Zhang, Zhenhua; Li, Miaoxin; Liu, Zhenglin

2014-01-01

Secret key leakage in wireless sensor networks (WSNs) is a high security risk especially when sensor nodes are deployed in hostile environment and physically accessible to attackers. With nowadays semi/fully-invasive attack techniques attackers can directly derive the cryptographic key from non-volatile memory (NVM) storage. Physically Unclonable Function (PUF) is a promising technology to resist node capture attacks, and it also provides a low cost and tamper-resistant key provisioning solution. In this paper, we designed a PUF based on double-data-rate SDRAM Type 3 (DDR3) memory by exploring its memory decay characteristics. We also described a prototype of 128-bit key generation based on DDR3 PUF with integrated fuzzy extractor. Due to the wide adoption of DDR3 memory in WSN, our proposed DDR3 PUF technology with high security levels and no required hardware changes is suitable for a wide range of WSN applications. PMID:24984058

A Bitslice Implementation of Anderson's Attack on A5/1

NASA Astrophysics Data System (ADS)

Bulavintsev, Vadim; Semenov, Alexander; Zaikin, Oleg; Kochemazov, Stepan

2018-03-01

The A5/1 keystream generator is a part of Global System for Mobile Communications (GSM) protocol, employed in cellular networks all over the world. Its cryptographic resistance was extensively analyzed in dozens of papers. However, almost all corresponding methods either employ a specific hardware or require an extensive preprocessing stage and significant amounts of memory. In the present study, a bitslice variant of Anderson's Attack on A5/1 is implemented. It requires very little computer memory and no preprocessing. Moreover, the attack can be made even more efficient by harnessing the computing power of modern Graphics Processing Units (GPUs). As a result, using commonly available GPUs this method can quite efficiently recover the secret key using only 64 bits of keystream. To test the performance of the implementation, a volunteer computing project was launched. 10 instances of A5/1 cryptanalysis have been successfully solved in this project in a single week.

Quantum key management

DOEpatents

Hughes, Richard John; Thrasher, James Thomas; Nordholt, Jane Elizabeth

2016-11-29

Innovations for quantum key management harness quantum communications to form a cryptography system within a public key infrastructure framework. In example implementations, the quantum key management innovations combine quantum key distribution and a quantum identification protocol with a Merkle signature scheme (using Winternitz one-time digital signatures or other one-time digital signatures, and Merkle hash trees) to constitute a cryptography system. More generally, the quantum key management innovations combine quantum key distribution and a quantum identification protocol with a hash-based signature scheme. This provides a secure way to identify, authenticate, verify, and exchange secret cryptographic keys. Features of the quantum key management innovations further include secure enrollment of users with a registration authority, as well as credential checking and revocation with a certificate authority, where the registration authority and/or certificate authority can be part of the same system as a trusted authority for quantum key distribution.

Experimental bit commitment based on quantum communication and special relativity.

PubMed

Lunghi, T; Kaniewski, J; Bussières, F; Houlmann, R; Tomamichel, M; Kent, A; Gisin, N; Wehner, S; Zbinden, H

2013-11-01

Bit commitment is a fundamental cryptographic primitive in which Bob wishes to commit a secret bit to Alice. Perfectly secure bit commitment between two mistrustful parties is impossible through asynchronous exchange of quantum information. Perfect security is however possible when Alice and Bob split into several agents exchanging classical and quantum information at times and locations suitably chosen to satisfy specific relativistic constraints. Here we report on an implementation of a bit commitment protocol using quantum communication and special relativity. Our protocol is based on [A. Kent, Phys. Rev. Lett. 109, 130501 (2012)] and has the advantage that it is practically feasible with arbitrary large separations between the agents in order to maximize the commitment time. By positioning agents in Geneva and Singapore, we obtain a commitment time of 15 ms. A security analysis considering experimental imperfections and finite statistics is presented.

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

NASA Astrophysics Data System (ADS)

Karimipour, V.

2006-07-01

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

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

NASA Astrophysics Data System (ADS)

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

2011-09-01

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

Elliptic net and its cryptographic application

NASA Astrophysics Data System (ADS)

Muslim, Norliana; Said, Mohamad Rushdan Md

2017-11-01

Elliptic net is a generalization of elliptic divisibility sequence and in cryptography field, most cryptographic pairings that are based on elliptic curve such as Tate pairing can be improved by applying elliptic nets algorithm. The elliptic net is constructed by using n dimensional array of values in rational number satisfying nonlinear recurrence relations that arise from elliptic divisibility sequences. The two main properties hold in the recurrence relations are for all positive integers m>n, hm +nhm -n=hm +1hm -1hn2-hn +1hn -1hm2 and hn divides hm whenever n divides m. In this research, we discuss elliptic divisibility sequence associated with elliptic nets based on cryptographic perspective and its possible research direction.

Design of cryptographically secure AES like S-Box using second-order reversible cellular automata for wireless body area network applications.

PubMed

Gangadari, Bhoopal Rao; Rafi Ahamed, Shaik

2016-09-01

In biomedical, data security is the most expensive resource for wireless body area network applications. Cryptographic algorithms are used in order to protect the information against unauthorised access. Advanced encryption standard (AES) cryptographic algorithm plays a vital role in telemedicine applications. The authors propose a novel approach for design of substitution bytes (S-Box) using second-order reversible one-dimensional cellular automata (RCA 2 ) as a replacement to the classical look-up-table (LUT) based S-Box used in AES algorithm. The performance of proposed RCA 2 based S-Box and conventional LUT based S-Box is evaluated in terms of security using the cryptographic properties such as the nonlinearity, correlation immunity bias, strict avalanche criteria and entropy. Moreover, it is also shown that RCA 2 based S-Boxes are dynamic in nature, invertible and provide high level of security. Further, it is also found that the RCA 2 based S-Box have comparatively better performance than that of conventional LUT based S-Box.

Design of cryptographically secure AES like S-Box using second-order reversible cellular automata for wireless body area network applications

PubMed Central

Rafi Ahamed, Shaik

2016-01-01

In biomedical, data security is the most expensive resource for wireless body area network applications. Cryptographic algorithms are used in order to protect the information against unauthorised access. Advanced encryption standard (AES) cryptographic algorithm plays a vital role in telemedicine applications. The authors propose a novel approach for design of substitution bytes (S-Box) using second-order reversible one-dimensional cellular automata (RCA2) as a replacement to the classical look-up-table (LUT) based S-Box used in AES algorithm. The performance of proposed RCA2 based S-Box and conventional LUT based S-Box is evaluated in terms of security using the cryptographic properties such as the nonlinearity, correlation immunity bias, strict avalanche criteria and entropy. Moreover, it is also shown that RCA2 based S-Boxes are dynamic in nature, invertible and provide high level of security. Further, it is also found that the RCA2 based S-Box have comparatively better performance than that of conventional LUT based S-Box. PMID:27733924

The Zagora cryptograph

NASA Astrophysics Data System (ADS)

Coucouzeli, A.

A unique lead seal from the well-known eighth century B.C. settlement of Zagora on the island of Andros dramatically confirms and expands our knowledge of the town planning identified at the site and constituting the earliest example of an orthogonal grid plan in the Greek world. The seal in question is decorated with a symbolic design that constitutes a rare representation of the Dioskouroi as part of the constellation Gemini. This design appears to have acted as a cryptograph enciphering the basic mathematical and astronomical principles behind the planning of Zagora. Besides offering us new insights into early Greek settlement planning, the cryptograph seems to reveal an advanced practical competence in mathematics and celestial observation, which was hitherto unsuspected for such an early period. The Zagora cryptograph also suggests that astronomy and mathematics played a crucial role in the strengthening of the ruling elite's power at Zagora in the framework of the rising city-state or polis. The tight interweaving of astronomical, mathematical, architectural and social considerations in the planning of Zagora is an entirely new discovery for Greece, whose implications are far-reaching.

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.

Distributed clinical data sharing via dynamic access-control policy transformation.

PubMed

Rezaeibagha, Fatemeh; Mu, Yi

2016-05-01

Data sharing in electronic health record (EHR) systems is important for improving the quality of healthcare delivery. Data sharing, however, has raised some security and privacy concerns because healthcare data could be potentially accessible by a variety of users, which could lead to privacy exposure of patients. Without addressing this issue, large-scale adoption and sharing of EHR data are impractical. The traditional solution to the problem is via encryption. Although encryption can be applied to access control, it is not applicable for complex EHR systems that require multiple domains (e.g. public and private clouds) with various access requirements. This study was carried out to address the security and privacy issues of EHR data sharing with our novel access-control mechanism, which captures the scenario of the hybrid clouds and need of access-control policy transformation, to provide secure and privacy-preserving data sharing among different healthcare enterprises. We introduce an access-control mechanism with some cryptographic building blocks and present a novel approach for secure EHR data sharing and access-control policy transformation in EHR systems for hybrid clouds. We propose a useful data sharing system for healthcare providers to handle various EHR users who have various access privileges in different cloud environments. A systematic study has been conducted on data sharing in EHR systems to provide a solution to the security and privacy issues. In conclusion, we introduce an access-control method for privacy protection of EHRs and EHR policy transformation that allows an EHR access-control policy to be transformed from a private cloud to a public cloud. This method has never been studied previously in the literature. Furthermore, we provide a protocol to demonstrate policy transformation as an application scenario. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Using the Hill Cipher to Teach Cryptographic Principles

ERIC Educational Resources Information Center

McAndrew, Alasdair

2008-01-01

The Hill cipher is the simplest example of a "block cipher," which takes a block of plaintext as input, and returns a block of ciphertext as output. Although it is insecure by modern standards, its simplicity means that it is well suited for the teaching of such concepts as encryption modes, and properties of cryptographic hash functions. Although…

A Software Assurance Framework for Mitigating the Risks of Malicious Software in Embedded Systems Used in Aircraft

DTIC Science & Technology

2011-09-01

to show cryptographic signature # generation on a UNIX system # SHA=/bin/ sha256 CSDB=/tmp/csdb CODEBASE=. touch "$CSDB" find "$CODEBASE" -type f...artifacts generated earlier. 81 #! /bin/sh # # Demo program to show cryptographic signature # verification on a UNIX system # SHA=/bin/ sha256 CSDB=/tmp

Technical Analysis of SSP-21 Protocol

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

Bromberger, S.

As part of the California Energy Systems for the Twenty-First Century (CES-21) program, in December 2016 San Diego Gas and Electric (SDG&E) contracted with Lawrence Livermore National Laboratory (LLNL) to perform an independent verification and validation (IV&V) of a white paper describing their Secure SCADA Protocol for the Twenty-First Century (SSP-21) in order to analyze the effectiveness and propriety of cryptographic protocol use within the SSP-21 specification. SSP-21 is designed to use cryptographic protocols to provide (optional) encryption, authentication, and nonrepudiation, among other capabilities. The cryptographic protocols to be used reflect current industry standards; future versions of SSP-21 will usemore » other advanced technologies to provide a subset of security services.« less

Quantum key distribution with an entangled light emitting diode

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

Dzurnak, B.; Stevenson, R. M.; Nilsson, J.

Measurements performed on entangled photon pairs shared between two parties can allow unique quantum cryptographic keys to be formed, creating secure links between users. An advantage of using such entangled photon links is that they can be adapted to propagate entanglement to end users of quantum networks with only untrusted nodes. However, demonstrations of quantum key distribution with entangled photons have so far relied on sources optically excited with lasers. Here, we realize a quantum cryptography system based on an electrically driven entangled-light-emitting diode. Measurement bases are passively chosen and we show formation of an error-free quantum key. Our measurementsmore » also simultaneously reveal Bell's parameter for the detected light, which exceeds the threshold for quantum entanglement.« less

Quantum key distribution with an entangled light emitting diode

NASA Astrophysics Data System (ADS)

Dzurnak, B.; Stevenson, R. M.; Nilsson, J.; Dynes, J. F.; Yuan, Z. L.; Skiba-Szymanska, J.; Farrer, I.; Ritchie, D. A.; Shields, A. J.

2015-12-01

Measurements performed on entangled photon pairs shared between two parties can allow unique quantum cryptographic keys to be formed, creating secure links between users. An advantage of using such entangled photon links is that they can be adapted to propagate entanglement to end users of quantum networks with only untrusted nodes. However, demonstrations of quantum key distribution with entangled photons have so far relied on sources optically excited with lasers. Here, we realize a quantum cryptography system based on an electrically driven entangled-light-emitting diode. Measurement bases are passively chosen and we show formation of an error-free quantum key. Our measurements also simultaneously reveal Bell's parameter for the detected light, which exceeds the threshold for quantum entanglement.

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.

Security Criteria for Distributed Systems: Functional Requirements.

DTIC Science & Technology

1995-09-01

Open Company Limited. Ziv , J. and A. Lempel . 1977. A Universal Algorithm for Sequential Data Compression . IEEE Transactions on Information Theory Vol...3, SCF-5 DCF-7. Configurable Cryptographic Algorithms (a) It shall be possible to configure the system such that the data confidentiality functions...use different cryptographic algorithms for different protocols (e.g., mail or interprocess communication data ). (b) The modes of encryption

An Analysis of Cryptographically Significant Boolean Functions With High Correlation Immunity by Reconfigurable Computer

DTIC Science & Technology

2010-12-01

with high correlation immunity and then evaluate these functions for other desirable cryptographic features. C. METHOD The only known primary methods...out if not used) # ---------------------------------- # PRIMARY = < primary file 1> < primary file 2> #SECONDARY = <secondary file 1...finding the fuction value for a //set u and for each value of v. end end

Privacy-preserving genome-wide association studies on cloud environment using fully homomorphic encryption.

PubMed

Lu, Wen-Jie; Yamada, Yoshiji; Sakuma, Jun

2015-01-01

Developed sequencing techniques are yielding large-scale genomic data at low cost. A genome-wide association study (GWAS) targeting genetic variations that are significantly associated with a particular disease offers great potential for medical improvement. However, subjects who volunteer their genomic data expose themselves to the risk of privacy invasion; these privacy concerns prevent efficient genomic data sharing. Our goal is to presents a cryptographic solution to this problem. To maintain the privacy of subjects, we propose encryption of all genotype and phenotype data. To allow the cloud to perform meaningful computation in relation to the encrypted data, we use a fully homomorphic encryption scheme. Noting that we can evaluate typical statistics for GWAS from a frequency table, our solution evaluates frequency tables with encrypted genomic and clinical data as input. We propose to use a packing technique for efficient evaluation of these frequency tables. Our solution supports evaluation of the D' measure of linkage disequilibrium, the Hardy-Weinberg Equilibrium, the χ2 test, etc. In this paper, we take χ2 test and linkage disequilibrium as examples and demonstrate how we can conduct these algorithms securely and efficiently in an outsourcing setting. We demonstrate with experimentation that secure outsourcing computation of one χ2 test with 10, 000 subjects requires about 35 ms and evaluation of one linkage disequilibrium with 10, 000 subjects requires about 80 ms. With appropriate encoding and packing technique, cryptographic solutions based on fully homomorphic encryption for secure computations of GWAS can be practical.

Using Compilers to Enhance Cryptographic Product Development

NASA Astrophysics Data System (ADS)

Bangerter, E.; Barbosa, M.; Bernstein, D.; Damgård, I.; Page, D.; Pagter, J. I.; Sadeghi, A.-R.; Sovio, S.

Developing high-quality software is hard in the general case, and it is significantly more challenging in the case of cryptographic software. A high degree of new skill and understanding must be learnt and applied without error to avoid vulnerability and inefficiency. This is often beyond the financial, manpower or intellectual resources avail-able. In this paper we present the motivation for the European funded CACE (Computer Aided Cryptography Engineering) project The main objective of CACE is to provide engineers (with limited or no expertise in cryptography) with a toolbox that allows them to generate robust and efficient implementations of cryptographic primitives. We also present some preliminary results already obtained in the early stages of this project, and discuss the relevance of the project as perceived by stakeholders in the mobile device arena.

Retrieving and routing quantum information in a quantum network

NASA Astrophysics Data System (ADS)

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

2015-12-01

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

Experimental quantum secret sharing and third-man quantum cryptography.

PubMed

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

2005-11-11

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

Automatic Inference of Cryptographic Key Length Based on Analysis of Proof Tightness

DTIC Science & Technology

2016-06-01

within an attack tree structure, then expand attack tree methodology to include cryptographic reductions. We then provide the algorithms for...maintaining and automatically reasoning about these expanded attack trees . We provide a software tool that utilizes machine-readable proof and attack metadata...and the attack tree methodology to provide rapid and precise answers regarding security parameters and effective security. This eliminates the need

Investigation of Current State of Crytpography and Theoretical Implementation of a Cryptographic System for the Combat Service Support Control System.

DTIC Science & Technology

1987-05-01

34 Advances in Crypt g: Proceedings of CRYPTO 84,r o ... .. .. _ __...o ... .. ... ....... ed. by G.R. Blakely and D. Chaum . [Wagn84b] Wagner, Neal R...in Distributed Computer Systems," IEEE Trans. on Computers, Vol. C-35, No. 7, Jul. 86, pp. 583-590. Gifford, David K., "Cryptographic Sealing for

Local distinguishability of Dicke states in quantum secret sharing

NASA Astrophysics Data System (ADS)

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

2017-03-01

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

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

NASA Astrophysics Data System (ADS)

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

2010-01-01

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

Experimental circular quantum secret sharing over telecom fiber network.

PubMed

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

2013-07-15

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

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

PubMed Central

2013-01-01

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

A 3D Split Manufacturing Approach to Trustworthy System Development

DTIC Science & Technology

2012-12-01

addition of any cryptographic algorithm or implementation to be included in the system as a foundry-level option. Essentially, 3D security introduces...8192 bytes). We modeled our cryptographic process after the AES algorithm , which can occupy up to 4640 bytes with an enlarged T-Box implementation [4...Reconfigurable Systems and Algorithms (ERSA), Las Vegas, NV, July 2011. [10] Intelligence Advanced Research Projects Agency (IARPA). Trusted integrated

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.

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.

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.

Detection of entanglement in asymmetric quantum networks and multipartite quantum steering.

PubMed

Cavalcanti, D; Skrzypczyk, P; Aguilar, G H; Nery, R V; Ribeiro, P H Souto; Walborn, S P

2015-08-03

The future of quantum communication relies on quantum networks composed by observers sharing multipartite quantum states. The certification of multipartite entanglement will be crucial to the usefulness of these networks. In many real situations it is natural to assume that some observers are more trusted than others in the sense that they have more knowledge of their measurement apparatuses. Here we propose a general method to certify all kinds of multipartite entanglement in this asymmetric scenario and experimentally demonstrate it in an optical experiment. Our results, which can be seen as a definition of genuine multipartite quantum steering, give a method to detect entanglement in a scenario in between the standard entanglement and fully device-independent scenarios, and provide a basis for semi-device-independent cryptographic applications in quantum networks.

Efficient and Provable Secure Pairing-Free Security-Mediated Identity-Based Identification Schemes

PubMed Central

Chin, Ji-Jian; Tan, Syh-Yuan; Heng, Swee-Huay; Phan, Raphael C.-W.

2014-01-01

Security-mediated cryptography was first introduced by Boneh et al. in 2001. The main motivation behind security-mediated cryptography was the capability to allow instant revocation of a user's secret key by necessitating the cooperation of a security mediator in any given transaction. Subsequently in 2003, Boneh et al. showed how to convert a RSA-based security-mediated encryption scheme from a traditional public key setting to an identity-based one, where certificates would no longer be required. Following these two pioneering papers, other cryptographic primitives that utilize a security-mediated approach began to surface. However, the security-mediated identity-based identification scheme (SM-IBI) was not introduced until Chin et al. in 2013 with a scheme built on bilinear pairings. In this paper, we improve on the efficiency results for SM-IBI schemes by proposing two schemes that are pairing-free and are based on well-studied complexity assumptions: the RSA and discrete logarithm assumptions. PMID:25207333

Efficient and provable secure pairing-free security-mediated identity-based identification schemes.

PubMed

Chin, Ji-Jian; Tan, Syh-Yuan; Heng, Swee-Huay; Phan, Raphael C-W

2014-01-01

Security-mediated cryptography was first introduced by Boneh et al. in 2001. The main motivation behind security-mediated cryptography was the capability to allow instant revocation of a user's secret key by necessitating the cooperation of a security mediator in any given transaction. Subsequently in 2003, Boneh et al. showed how to convert a RSA-based security-mediated encryption scheme from a traditional public key setting to an identity-based one, where certificates would no longer be required. Following these two pioneering papers, other cryptographic primitives that utilize a security-mediated approach began to surface. However, the security-mediated identity-based identification scheme (SM-IBI) was not introduced until Chin et al. in 2013 with a scheme built on bilinear pairings. In this paper, we improve on the efficiency results for SM-IBI schemes by proposing two schemes that are pairing-free and are based on well-studied complexity assumptions: the RSA and discrete logarithm assumptions.

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.

Cryptographic Boolean Functions with Biased Inputs

DTIC Science & Technology

2015-07-31

theory of random graphs developed by Erdős and Rényi [2]. The graph properties in a random graph expressed as such Boolean functions are used by...distributed Bernoulli variates with the parameter p. Since our scope is within the area of cryptography , we initiate an analysis of cryptographic...Boolean functions with biased inputs, which we refer to as µp-Boolean functions, is a common generalization of Boolean functions which stems from the

Practical Computer Security through Cryptography

NASA Technical Reports Server (NTRS)

McNab, David; Twetev, David (Technical Monitor)

1998-01-01

The core protocols upon which the Internet was built are insecure. Weak authentication and the lack of low level encryption services introduce vulnerabilities that propagate upwards in the network stack. Using statistics based on CERT/CC Internet security incident reports, the relative likelihood of attacks via these vulnerabilities is analyzed. The primary conclusion is that the standard UNIX BSD-based authentication system is by far the most commonly exploited weakness. Encryption of Sensitive password data and the adoption of cryptographically-based authentication protocols can greatly reduce these vulnerabilities. Basic cryptographic terminology and techniques are presented, with attention focused on the ways in which technology such as encryption and digital signatures can be used to protect against the most commonly exploited vulnerabilities. A survey of contemporary security software demonstrates that tools based on cryptographic techniques, such as Kerberos, ssh, and PGP, are readily available and effectively close many of the most serious security holes. Nine practical recommendations for improving security are described.

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.

Privacy-preserving genome-wide association studies on cloud environment using fully homomorphic encryption

PubMed Central

2015-01-01

Objective Developed sequencing techniques are yielding large-scale genomic data at low cost. A genome-wide association study (GWAS) targeting genetic variations that are significantly associated with a particular disease offers great potential for medical improvement. However, subjects who volunteer their genomic data expose themselves to the risk of privacy invasion; these privacy concerns prevent efficient genomic data sharing. Our goal is to presents a cryptographic solution to this problem. Methods To maintain the privacy of subjects, we propose encryption of all genotype and phenotype data. To allow the cloud to perform meaningful computation in relation to the encrypted data, we use a fully homomorphic encryption scheme. Noting that we can evaluate typical statistics for GWAS from a frequency table, our solution evaluates frequency tables with encrypted genomic and clinical data as input. We propose to use a packing technique for efficient evaluation of these frequency tables. Results Our solution supports evaluation of the D′ measure of linkage disequilibrium, the Hardy-Weinberg Equilibrium, the χ2 test, etc. In this paper, we take χ2 test and linkage disequilibrium as examples and demonstrate how we can conduct these algorithms securely and efficiently in an outsourcing setting. We demonstrate with experimentation that secure outsourcing computation of one χ2 test with 10, 000 subjects requires about 35 ms and evaluation of one linkage disequilibrium with 10, 000 subjects requires about 80 ms. Conclusions With appropriate encoding and packing technique, cryptographic solutions based on fully homomorphic encryption for secure computations of GWAS can be practical. PMID:26732892

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.

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.

Cryptographic synchronization recovery by measuring randomness of decrypted data

DOEpatents

Maestas, Joseph H.; Pierson, Lyndon G.

1990-01-01

The invention relates to synchronization of encrypted data communication systems and a method which looks for any lack of pattern or intelligent information in the received data and triggers a resynchronization signal based thereon. If the encrypter/decrypter pairs are out of cryptographic synchronization, the received (decrypted) data resembles pseudorandom data. A method and system are provided for detecting such pseudorandom binary data by, for example, ones density. If the data is sufficiently random the system is resynchronized.

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.

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.

A kind of universal quantum secret sharing protocol

NASA Astrophysics Data System (ADS)

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

2017-01-01

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

A kind of universal quantum secret sharing protocol.

PubMed

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

2017-01-12

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

A kind of universal quantum secret sharing protocol

PubMed Central

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

2017-01-01

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

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

PubMed

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

2015-01-01

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

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

PubMed Central

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

2015-01-01

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

Random sequences generation through optical measurements by phase-shifting interferometry

NASA Astrophysics Data System (ADS)

François, M.; Grosges, T.; Barchiesi, D.; Erra, R.; Cornet, A.

2012-04-01

The development of new techniques for producing random sequences with a high level of security is a challenging topic of research in modern cryptographics. The proposed method is based on the measurement by phase-shifting interferometry of the speckle signals of the interaction between light and structures. We show how the combination of amplitude and phase distributions (maps) under a numerical process can produce random sequences. The produced sequences satisfy all the statistical requirements of randomness and can be used in cryptographic schemes.

Using Temporal Logic to Specify and Verify Cryptographic Protocols (Progress Report)

DTIC Science & Technology

1995-01-01

know, Meadows’ 1Supported by grant HKUST 608/94E from the Hong Kong Research Grants Council. 1 Report Documentation Page Form ApprovedOMB No. 0704... 1 Introduction We have started work on a project to apply temporal logic to reason about cryptographic protocols. Some of the goals of the project...are as follows. 1 . Allow the user to state and prove that the penetrator cannot use logical or algebraic techniques (e.g., we are disregarding

Hybrid ququart-encoded quantum cryptography protected by Kochen-Specker contextuality

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

Cabello, Adan; Department of Physics, Stockholm University, S-10691 Stockholm; D'Ambrosio, Vincenzo

2011-09-15

Quantum cryptographic protocols based on complementarity are not secure against attacks in which complementarity is imitated with classical resources. The Kochen-Specker (KS) theorem provides protection against these attacks, without requiring entanglement or spatially separated composite systems. We analyze the maximum tolerated noise to guarantee the security of a KS-protected cryptographic scheme against these attacks and describe a photonic realization of this scheme using hybrid ququarts defined by the polarization and orbital angular momentum of single photons.

Unmaking the bomb: Verifying limits on the stockpiles of nuclear weapons

NASA Astrophysics Data System (ADS)

Glaser, Alexander

2017-11-01

Verifying limits on the stockpiles of nuclear weapons may require the ability for international in-spectors to account for individual warheads, even when non-deployed, and to confirm the authenticity of nuclear warheads prior to dismantlement. These are fundamentally new challenges for nuclear verification, and they have been known for some time; unfortunately, due to a lack of sense of urgency, research in this area has not made substantial progress over the past 20 years. This chapter explores the central outstanding issues and offers a number of possible paths forward. In the case of confirming numerical limits, these in-clude innovative tagging techniques and approaches solely based on declarations using modern crypto-graphic escrow schemes; with regard to warhead confirmation, there has recently been increasing interest in developing fundamentally new measurement approaches where, in one form or another, sensitive infor-mation is not acquired in the first place. Overall, new international R&D efforts could more usefully focus on non-intrusive technologies and approaches, which may show more promise for early demonstration and adoption. In the meantime, while warhead dismantlements remain unverified, nuclear weapon states ought to begin to document warhead assembly, refurbishment, and dismantlement activities and movements of warheads and warhead components through the weapons complex in ways that international inspectors will find credible at a later time. Again, such a process could be enabled by modern cryptographic techniques such as blockchaining. Finally, and perhaps most importantly, it is important to recognize that the main reason for the complexity of technologies and approaches needed for nuclear disarmament verification is the requirement to protect information that nuclear weapon states consider sensitive. Ultimately, if information security concerns cannot be resolved to the satisfaction of all stakeholders, an alternative would be to "reveal the secret" and to make available select warhead design information.

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.

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.

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.

Physically Unclonable Cryptographic Primitives by Chemical Vapor Deposition of Layered MoS2.

PubMed

Alharbi, Abdullah; Armstrong, Darren; Alharbi, Somayah; Shahrjerdi, Davood

2017-12-26

Physically unclonable cryptographic primitives are promising for securing the rapidly growing number of electronic devices. Here, we introduce physically unclonable primitives from layered molybdenum disulfide (MoS 2 ) by leveraging the natural randomness of their island growth during chemical vapor deposition (CVD). We synthesize a MoS 2 monolayer film covered with speckles of multilayer islands, where the growth process is engineered for an optimal speckle density. Using the Clark-Evans test, we confirm that the distribution of islands on the film exhibits complete spatial randomness, hence indicating the growth of multilayer speckles is a spatial Poisson process. Such a property is highly desirable for constructing unpredictable cryptographic primitives. The security primitive is an array of 2048 pixels fabricated from this film. The complex structure of the pixels makes the physical duplication of the array impossible (i.e., physically unclonable). A unique optical response is generated by applying an optical stimulus to the structure. The basis for this unique response is the dependence of the photoemission on the number of MoS 2 layers, which by design is random throughout the film. Using a threshold value for the photoemission, we convert the optical response into binary cryptographic keys. We show that the proper selection of this threshold is crucial for maximizing combination randomness and that the optimal value of the threshold is linked directly to the growth process. This study reveals an opportunity for generating robust and versatile security primitives from layered transition metal dichalcogenides.

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.

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…

Enhanced K-means clustering with encryption on cloud

NASA Astrophysics Data System (ADS)

Singh, Iqjot; Dwivedi, Prerna; Gupta, Taru; Shynu, P. G.

2017-11-01

This paper tries to solve the problem of storing and managing big files over cloud by implementing hashing on Hadoop in big-data and ensure security while uploading and downloading files. Cloud computing is a term that emphasis on sharing data and facilitates to share infrastructure and resources.[10] Hadoop is an open source software that gives us access to store and manage big files according to our needs on cloud. K-means clustering algorithm is an algorithm used to calculate distance between the centroid of the cluster and the data points. Hashing is a algorithm in which we are storing and retrieving data with hash keys. The hashing algorithm is called as hash function which is used to portray the original data and later to fetch the data stored at the specific key. [17] Encryption is a process to transform electronic data into non readable form known as cipher text. Decryption is the opposite process of encryption, it transforms the cipher text into plain text that the end user can read and understand well. For encryption and decryption we are using Symmetric key cryptographic algorithm. In symmetric key cryptography are using DES algorithm for a secure storage of the files. [3

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

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

DOE PAGES

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

2015-11-18

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

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

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

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

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

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

PubMed Central

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

2015-01-01

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

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

NASA Astrophysics Data System (ADS)

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

2018-02-01

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

Jones index, secret sharing and total quantum dimension

NASA Astrophysics Data System (ADS)

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

2017-02-01

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

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

PubMed

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

2017-01-01

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

24-Hour Relativistic Bit Commitment.

PubMed

Verbanis, Ephanielle; Martin, Anthony; Houlmann, Raphaël; Boso, Gianluca; Bussières, Félix; Zbinden, Hugo

2016-09-30

Bit commitment is a fundamental cryptographic primitive in which a party wishes to commit a secret bit to another party. Perfect security between mistrustful parties is unfortunately impossible to achieve through the asynchronous exchange of classical and quantum messages. Perfect security can nonetheless be achieved if each party splits into two agents exchanging classical information at times and locations satisfying strict relativistic constraints. A relativistic multiround protocol to achieve this was previously proposed and used to implement a 2-millisecond commitment time. Much longer durations were initially thought to be insecure, but recent theoretical progress showed that this is not so. In this Letter, we report on the implementation of a 24-hour bit commitment solely based on timed high-speed optical communication and fast data processing, with all agents located within the city of Geneva. This duration is more than 6 orders of magnitude longer than before, and we argue that it could be extended to one year and allow much more flexibility on the locations of the agents. Our implementation offers a practical and viable solution for use in applications such as digital signatures, secure voting and honesty-preserving auctions.

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.

PRECISE:PRivacy-prEserving Cloud-assisted quality Improvement Service in hEalthcare

PubMed Central

Chen, Feng; Wang, Shuang; Mohammed, Noman; Cheng, Samuel; Jiang, Xiaoqian

2015-01-01

Quality improvement (QI) requires systematic and continuous efforts to enhance healthcare services. A healthcare provider might wish to compare local statistics with those from other institutions in order to identify problems and develop intervention to improve the quality of care. However, the sharing of institution information may be deterred by institutional privacy as publicizing such statistics could lead to embarrassment and even financial damage. In this article, we propose a PRivacy-prEserving Cloud-assisted quality Improvement Service in hEalthcare (PRECISE), which aims at enabling cross-institution comparison of healthcare statistics while protecting privacy. The proposed framework relies on a set of state-of-the-art cryptographic protocols including homomorphic encryption and Yao’s garbled circuit schemes. By securely pooling data from different institutions, PRECISE can rank the encrypted statistics to facilitate QI among participating institutes. We conducted experiments using MIMIC II database and demonstrated the feasibility of the proposed PRECISE framework. PMID:26146645

PRECISE:PRivacy-prEserving Cloud-assisted quality Improvement Service in hEalthcare.

PubMed

Chen, Feng; Wang, Shuang; Mohammed, Noman; Cheng, Samuel; Jiang, Xiaoqian

2014-10-01

Quality improvement (QI) requires systematic and continuous efforts to enhance healthcare services. A healthcare provider might wish to compare local statistics with those from other institutions in order to identify problems and develop intervention to improve the quality of care. However, the sharing of institution information may be deterred by institutional privacy as publicizing such statistics could lead to embarrassment and even financial damage. In this article, we propose a PRivacy-prEserving Cloud-assisted quality Improvement Service in hEalthcare (PRECISE), which aims at enabling cross-institution comparison of healthcare statistics while protecting privacy. The proposed framework relies on a set of state-of-the-art cryptographic protocols including homomorphic encryption and Yao's garbled circuit schemes. By securely pooling data from different institutions, PRECISE can rank the encrypted statistics to facilitate QI among participating institutes. We conducted experiments using MIMIC II database and demonstrated the feasibility of the proposed PRECISE framework.

Quantum cryptography using coherent states: Randomized encryption and key generation

NASA Astrophysics Data System (ADS)

Corndorf, Eric

With the advent of the global optical-telecommunications infrastructure, an increasing number of individuals, companies, and agencies communicate information with one another over public networks or physically-insecure private networks. While the majority of the traffic flowing through these networks requires little or no assurance of secrecy, the same cannot be said for certain communications between banks, between government agencies, within the military, and between corporations. In these arenas, the need to specify some level of secrecy in communications is a high priority. While the current approaches to securing sensitive information (namely the public-key-cryptography infrastructure and deterministic private-key ciphers like AES and 3DES) seem to be cryptographically strong based on empirical evidence, there exist no mathematical proofs of secrecy for any widely deployed cryptosystem. As an example, the ubiquitous public-key cryptosystems infer all of their secrecy from the assumption that factoring of the product of two large primes is necessarily time consuming---something which has not, and perhaps cannot, be proven. Since the 1980s, the possibility of using quantum-mechanical features of light as a physical mechanism for satisfying particular cryptographic objectives has been explored. This research has been fueled by the hopes that cryptosystems based on quantum systems may provide provable levels of secrecy which are at least as valid as quantum mechanics itself. Unfortunately, the most widely considered quantum-cryptographic protocols (BB84 and the Ekert protocol) have serious implementation problems. Specifically, they require quantum-mechanical states which are not readily available, and they rely on unproven relations between intrusion-level detection and the information available to an attacker. As a result, the secrecy level provided by these experimental implementations is entirely unspecified. In an effort to provably satisfy the cryptographic objectives of key generation and direct data-encryption, a new quantum cryptographic principle is demonstrated wherein keyed coherent-state signal sets are employed. Taking advantage of the fundamental and irreducible quantum-measurement noise of coherent states, these schemes do not require the users to measure the influence of an attacker. Experimental key-generation and data encryption schemes based on these techniques, which are compatible with today's WDM fiber-optic telecommunications infrastructure, are implemented and analyzed.

A cryptologic based trust center for medical images.

PubMed

Wong, S T

1996-01-01

To investigate practical solutions that can integrate cryptographic techniques and picture archiving and communication systems (PACS) to improve the security of medical images. The PACS at the University of California San Francisco Medical Center consolidate images and associated data from various scanners into a centralized data archive and transmit them to remote display stations for review and consultation purposes. The purpose of this study is to investigate the model of a digital trust center that integrates cryptographic algorithms and protocols seamlessly into such a digital radiology environment to improve the security of medical images. The timing performance of encryption, decryption, and transmission of the cryptographic protocols over 81 volumetric PACS datasets has been measured. Lossless data compression is also applied before the encryption. The transmission performance is measured against three types of networks of different bandwidths: narrow-band Integrated Services Digital Network, Ethernet, and OC-3c Asynchronous Transfer Mode. The proposed digital trust center provides a cryptosystem solution to protect the confidentiality and to determine the authenticity of digital images in hospitals. The results of this study indicate that diagnostic images such as x-rays and magnetic resonance images could be routinely encrypted in PACS. However, applying encryption in teleradiology and PACS is a tradeoff between communications performance and security measures. Many people are uncertain about how to integrate cryptographic algorithms coherently into existing operations of the clinical enterprise. This paper describes a centralized cryptosystem architecture to ensure image data authenticity in a digital radiology department. The system performance has been evaluated in a hospital-integrated PACS environment.

A cryptologic based trust center for medical images.

PubMed Central

Wong, S T

1996-01-01

OBJECTIVE: To investigate practical solutions that can integrate cryptographic techniques and picture archiving and communication systems (PACS) to improve the security of medical images. DESIGN: The PACS at the University of California San Francisco Medical Center consolidate images and associated data from various scanners into a centralized data archive and transmit them to remote display stations for review and consultation purposes. The purpose of this study is to investigate the model of a digital trust center that integrates cryptographic algorithms and protocols seamlessly into such a digital radiology environment to improve the security of medical images. MEASUREMENTS: The timing performance of encryption, decryption, and transmission of the cryptographic protocols over 81 volumetric PACS datasets has been measured. Lossless data compression is also applied before the encryption. The transmission performance is measured against three types of networks of different bandwidths: narrow-band Integrated Services Digital Network, Ethernet, and OC-3c Asynchronous Transfer Mode. RESULTS: The proposed digital trust center provides a cryptosystem solution to protect the confidentiality and to determine the authenticity of digital images in hospitals. The results of this study indicate that diagnostic images such as x-rays and magnetic resonance images could be routinely encrypted in PACS. However, applying encryption in teleradiology and PACS is a tradeoff between communications performance and security measures. CONCLUSION: Many people are uncertain about how to integrate cryptographic algorithms coherently into existing operations of the clinical enterprise. This paper describes a centralized cryptosystem architecture to ensure image data authenticity in a digital radiology department. The system performance has been evaluated in a hospital-integrated PACS environment. PMID:8930857

Token-based information security for commercial and federal information networks

NASA Astrophysics Data System (ADS)

Rohland, William S.

1996-03-01

The planning of cryptographic solutions for messaging and electronic commerce applications in the United States during the past few years has been motivated by a high level of interest in the technology on the part of potential users. It has been marked by a high level of controversy over algorithms, patent rights and escrow policy. The diverse needs of the government and commercial sectors have led to mutually exclusive solutions based on different algorithms and policy; this phenomenon is fairly unique to the United States. Because of the strong requirement to preserve the differences that make these solutions unique for the two environments, the near-term evolution of a single standard appears unlikely. Furthermore, the need on the part of some government agencies and some commercial establishments exists to operate in both environments. This paper deals with the technical definition and design approach to a dual-use cryptographic device and the migration paths to the dual-use device from both environments. Such a device is further considered as a component of a secure cryptographic translation facility.

WLC Preface

NASA Astrophysics Data System (ADS)

Miret, Josep M.; Sebé, Francesc

Low-cost devices are the key component of several applications: RFID tags permit an automated supply chain management while smart cards are a secure means of storing cryptographic keys required for remote and secure authentication in e-commerce and e-government applications. These devices must be cheap in order to permit their cost-effective massive manufacturing and deployment. Unfortunately, their low cost limits their computational power. Other devices such as nodes of sensor networks suffer from an additional constraint, namely, their limited battery life. Secure applications designed for these devices cannot make use of classical cryptographic primitives designed for full-fledged computers.

Post-quantum cryptography.

PubMed

Bernstein, Daniel J; Lange, Tanja

2017-09-13

Cryptography is essential for the security of online communication, cars and implanted medical devices. However, many commonly used cryptosystems will be completely broken once large quantum computers exist. Post-quantum cryptography is cryptography under the assumption that the attacker has a large quantum computer; post-quantum cryptosystems strive to remain secure even in this scenario. This relatively young research area has seen some successes in identifying mathematical operations for which quantum algorithms offer little advantage in speed, and then building cryptographic systems around those. The central challenge in post-quantum cryptography is to meet demands for cryptographic usability and flexibility without sacrificing confidence.

Post-quantum cryptography

NASA Astrophysics Data System (ADS)

Bernstein, Daniel J.; Lange, Tanja

2017-09-01

Cryptography is essential for the security of online communication, cars and implanted medical devices. However, many commonly used cryptosystems will be completely broken once large quantum computers exist. Post-quantum cryptography is cryptography under the assumption that the attacker has a large quantum computer; post-quantum cryptosystems strive to remain secure even in this scenario. This relatively young research area has seen some successes in identifying mathematical operations for which quantum algorithms offer little advantage in speed, and then building cryptographic systems around those. The central challenge in post-quantum cryptography is to meet demands for cryptographic usability and flexibility without sacrificing confidence.

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.

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

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.

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

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.

Secure and Efficient Regression Analysis Using a Hybrid Cryptographic Framework: Development and Evaluation

PubMed Central

Jiang, Xiaoqian; Aziz, Md Momin Al; Wang, Shuang; Mohammed, Noman

2018-01-01

Background Machine learning is an effective data-driven tool that is being widely used to extract valuable patterns and insights from data. Specifically, predictive machine learning models are very important in health care for clinical data analysis. The machine learning algorithms that generate predictive models often require pooling data from different sources to discover statistical patterns or correlations among different attributes of the input data. The primary challenge is to fulfill one major objective: preserving the privacy of individuals while discovering knowledge from data. Objective Our objective was to develop a hybrid cryptographic framework for performing regression analysis over distributed data in a secure and efficient way. Methods Existing secure computation schemes are not suitable for processing the large-scale data that are used in cutting-edge machine learning applications. We designed, developed, and evaluated a hybrid cryptographic framework, which can securely perform regression analysis, a fundamental machine learning algorithm using somewhat homomorphic encryption and a newly introduced secure hardware component of Intel Software Guard Extensions (Intel SGX) to ensure both privacy and efficiency at the same time. Results Experimental results demonstrate that our proposed method provides a better trade-off in terms of security and efficiency than solely secure hardware-based methods. Besides, there is no approximation error. Computed model parameters are exactly similar to plaintext results. Conclusions To the best of our knowledge, this kind of secure computation model using a hybrid cryptographic framework, which leverages both somewhat homomorphic encryption and Intel SGX, is not proposed or evaluated to this date. Our proposed framework ensures data security and computational efficiency at the same time. PMID:29506966

Secure and Efficient Regression Analysis Using a Hybrid Cryptographic Framework: Development and Evaluation.

PubMed

Sadat, Md Nazmus; Jiang, Xiaoqian; Aziz, Md Momin Al; Wang, Shuang; Mohammed, Noman

2018-03-05

Machine learning is an effective data-driven tool that is being widely used to extract valuable patterns and insights from data. Specifically, predictive machine learning models are very important in health care for clinical data analysis. The machine learning algorithms that generate predictive models often require pooling data from different sources to discover statistical patterns or correlations among different attributes of the input data. The primary challenge is to fulfill one major objective: preserving the privacy of individuals while discovering knowledge from data. Our objective was to develop a hybrid cryptographic framework for performing regression analysis over distributed data in a secure and efficient way. Existing secure computation schemes are not suitable for processing the large-scale data that are used in cutting-edge machine learning applications. We designed, developed, and evaluated a hybrid cryptographic framework, which can securely perform regression analysis, a fundamental machine learning algorithm using somewhat homomorphic encryption and a newly introduced secure hardware component of Intel Software Guard Extensions (Intel SGX) to ensure both privacy and efficiency at the same time. Experimental results demonstrate that our proposed method provides a better trade-off in terms of security and efficiency than solely secure hardware-based methods. Besides, there is no approximation error. Computed model parameters are exactly similar to plaintext results. To the best of our knowledge, this kind of secure computation model using a hybrid cryptographic framework, which leverages both somewhat homomorphic encryption and Intel SGX, is not proposed or evaluated to this date. Our proposed framework ensures data security and computational efficiency at the same time. ©Md Nazmus Sadat, Xiaoqian Jiang, Md Momin Al Aziz, Shuang Wang, Noman Mohammed. Originally published in JMIR Medical Informatics (http://medinform.jmir.org), 05.03.2018.

Application of visual cryptography for learning in optics and photonics

NASA Astrophysics Data System (ADS)

Mandal, Avikarsha; Wozniak, Peter; Vauderwange, Oliver; Curticapean, Dan

2016-09-01

In the age data digitalization, important applications of optics and photonics based sensors and technology lie in the field of biometrics and image processing. Protecting user data in a safe and secure way is an essential task in this area. However, traditional cryptographic protocols rely heavily on computer aided computation. Secure protocols which rely only on human interactions are usually simpler to understand. In many scenarios development of such protocols are also important for ease of implementation and deployment. Visual cryptography (VC) is an encryption technique on images (or text) in which decryption is done by human visual system. In this technique, an image is encrypted into number of pieces (known as shares). When the printed shares are physically superimposed together, the image can be decrypted with human vision. Modern digital watermarking technologies can be combined with VC for image copyright protection where the shares can be watermarks (small identification) embedded in the image. Similarly, VC can be used for improving security of biometric authentication. This paper presents about design and implementation of a practical laboratory experiment based on the concept of VC for a course in media engineering. Specifically, our contribution deals with integration of VC in different schemes for applications like digital watermarking and biometric authentication in the field of optics and photonics. We describe theoretical concepts and propose our infrastructure for the experiment. Finally, we will evaluate the learning outcome of the experiment, performed by the students.

Security of a sessional blind signature based on quantum cryptograph

NASA Astrophysics Data System (ADS)

Wang, Tian-Yin; Cai, Xiao-Qiu; Zhang, Rui-Ling

2014-08-01

We analyze the security of a sessional blind signature protocol based on quantum cryptograph and show that there are two security leaks in this protocol. One is that the legal user Alice can change the signed message after she gets a valid blind signature from the signatory Bob, and the other is that an external opponent Eve also can forge a valid blind message by a special attack, which are not permitted for blind signature. Therefore, this protocol is not secure in the sense that it does not satisfy the non-forgeability of blind signatures. We also discuss the methods to prevent the attack strategies in the end.

Cryptographically secure biometrics

NASA Astrophysics Data System (ADS)

Stoianov, A.

2010-04-01

Biometric systems usually do not possess a cryptographic level of security: it has been deemed impossible to perform a biometric authentication in the encrypted domain because of the natural variability of biometric samples and of the cryptographic intolerance even to a single bite error. Encrypted biometric data need to be decrypted on authentication, which creates privacy and security risks. On the other hand, the known solutions called "Biometric Encryption (BE)" or "Fuzzy Extractors" can be cracked by various attacks, for example, by running offline a database of images against the stored helper data in order to obtain a false match. In this paper, we present a novel approach which combines Biometric Encryption with classical Blum-Goldwasser cryptosystem. In the "Client - Service Provider (SP)" or in the "Client - Database - SP" architecture it is possible to keep the biometric data encrypted on all the stages of the storage and authentication, so that SP never has an access to unencrypted biometric data. It is shown that this approach is suitable for two of the most popular BE schemes, Fuzzy Commitment and Quantized Index Modulation (QIM). The approach has clear practical advantages over biometric systems using "homomorphic encryption". Future work will deal with the application of the proposed solution to one-to-many biometric systems.

Implementation of Rivest Shamir Adleman Algorithm (RSA) and Vigenere Cipher In Web Based Information System

NASA Astrophysics Data System (ADS)

Aryanti, Aryanti; Mekongga, Ikhthison

2018-02-01

Data security and confidentiality is one of the most important aspects of information systems at the moment. One attempt to secure data such as by using cryptography. In this study developed a data security system by implementing the cryptography algorithm Rivest, Shamir Adleman (RSA) and Vigenere Cipher. The research was done by combining Rivest, Shamir Adleman (RSA) and Vigenere Cipher cryptographic algorithms to document file either word, excel, and pdf. This application includes the process of encryption and decryption of data, which is created by using PHP software and my SQL. Data encryption is done on the transmit side through RSA cryptographic calculations using the public key, then proceed with Vigenere Cipher algorithm which also uses public key. As for the stage of the decryption side received by using the Vigenere Cipher algorithm still use public key and then the RSA cryptographic algorithm using a private key. Test results show that the system can encrypt files, decrypt files and transmit files. Tests performed on the process of encryption and decryption of files with different file sizes, file size affects the process of encryption and decryption. The larger the file size the longer the process of encryption and decryption.

A cryptographic hash function based on chaotic network automata

NASA Astrophysics Data System (ADS)

Machicao, Jeaneth; Bruno, Odemir M.

2017-12-01

Chaos theory has been used to develop several cryptographic methods relying on the pseudo-random properties extracted from simple nonlinear systems such as cellular automata (CA). Cryptographic hash functions (CHF) are commonly used to check data integrity. CHF “compress” arbitrary long messages (input) into much smaller representations called hash values or message digest (output), designed to prevent the ability to reverse the hash values into the original message. This paper proposes a chaos-based CHF inspired on an encryption method based on chaotic CA rule B1357-S2468. Here, we propose an hybrid model that combines CA and networks, called network automata (CNA), whose chaotic spatio-temporal outputs are used to compute a hash value. Following the Merkle and Damgård model of construction, a portion of the message is entered as the initial condition of the network automata, so that the rest parts of messages are iteratively entered to perturb the system. The chaotic network automata shuffles the message using flexible control parameters, so that the generated hash value is highly sensitive to the message. As demonstrated in our experiments, the proposed model has excellent pseudo-randomness and sensitivity properties with acceptable performance when compared to conventional hash functions.

Sequential Quantum Secret Sharing Using a Single Qudit

NASA Astrophysics Data System (ADS)

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

2018-05-01

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

Recent Works Share Mothers' Unique Experiences

PubMed Central

Shilling, Teri

2005-01-01

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

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

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

A novel algorithm for thermal image encryption.

PubMed

Hussain, Iqtadar; Anees, Amir; Algarni, Abdulmohsen

2018-04-16

Thermal images play a vital character at nuclear plants, Power stations, Forensic labs biological research, and petroleum products extraction. Safety of thermal images is very important. Image data has some unique features such as intensity, contrast, homogeneity, entropy and correlation among pixels that is why somehow image encryption is trickier as compare to other encryptions. With conventional image encryption schemes it is normally hard to handle these features. Therefore, cryptographers have paid attention to some attractive properties of the chaotic maps such as randomness and sensitivity to build up novel cryptosystems. That is why, recently proposed image encryption techniques progressively more depends on the application of chaotic maps. This paper proposed an image encryption algorithm based on Chebyshev chaotic map and S8 Symmetric group of permutation based substitution boxes. Primarily, parameters of chaotic Chebyshev map are chosen as a secret key to mystify the primary image. Then, the plaintext image is encrypted by the method generated from the substitution boxes and Chebyshev map. By this process, we can get a cipher text image that is perfectly twisted and dispersed. The outcomes of renowned experiments, key sensitivity tests and statistical analysis confirm that the proposed algorithm offers a safe and efficient approach for real-time image encryption.

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.

Deterrence of device counterfeiting, cloning, and subversion by substitution using hardware fingerprinting

DOEpatents

Hamlet, Jason R; Bauer, Todd M; Pierson, Lyndon G

2014-09-30

Deterrence of device subversion by substitution may be achieved by including a cryptographic fingerprint unit within a computing device for authenticating a hardware platform of the computing device. The cryptographic fingerprint unit includes a physically unclonable function ("PUF") circuit disposed in or on the hardware platform. The PUF circuit is used to generate a PUF value. A key generator is coupled to generate a private key and a public key based on the PUF value while a decryptor is coupled to receive an authentication challenge posed to the computing device and encrypted with the public key and coupled to output a response to the authentication challenge decrypted with the private key.

Defense frontier analysis of quantum cryptographic systems.

PubMed

Slutsky, B; Rao, R; Sun, P C; Tancevski, L; Fainman, S

1998-05-10

When a quantum cryptographic system operates in the presence of background noise, security of the key can be recovered by a procedure called key distillation. A key-distillation scheme effective against so-called individual (bitwise-independent) eavesdropping attacks involves sacrifice of some of the data through privacy amplification. We derive the amount of data sacrifice sufficient to defend against individual eavesdropping attacks in both BB84 and B92 protocols and show in what sense the communication becomes secure as a result. We also compare the secrecy capacity of various quantum cryptosystems, taking into account data sacrifice during key distillation, and conclude that the BB84 protocol may offer better performance characteristics than the B92.

On Various Nonlinearity Measures for Boolean Functions*

PubMed Central

Boyar, Joan; Find, Magnus Gausdal; Peralta, René

2016-01-01

A necessary condition for the security of cryptographic functions is to be “sufficiently distant” from linear, and cryptographers have proposed several measures for this distance. In this paper, we show that six common measures, nonlinearity, algebraic degree, annihilator immunity, algebraic thickness, normality, and multiplicative complexity, are incomparable in the sense that for each pair of measures, μ1, μ2, there exist functions f1, f2 with f1 being more nonlinear than f2 according to μ1, but less nonlinear according to μ2. We also present new connections between two of these measures. Additionally, we give a lower bound on the multiplicative complexity of collision-free functions. PMID:27458499

Local randomness: Examples and application

NASA Astrophysics Data System (ADS)

Fu, Honghao; Miller, Carl A.

2018-03-01

When two players achieve a superclassical score at a nonlocal game, their outputs must contain intrinsic randomness. This fact has many useful implications for quantum cryptography. Recently it has been observed [C. Miller and Y. Shi, Quantum Inf. Computat. 17, 0595 (2017)] that such scores also imply the existence of local randomness—that is, randomness known to one player but not to the other. This has potential implications for cryptographic tasks between two cooperating but mistrustful players. In the current paper we bring this notion toward practical realization, by offering near-optimal bounds on local randomness for the CHSH game, and also proving the security of a cryptographic application of local randomness (single-bit certified deletion).

A Scheme for Obtaining Secure S-Boxes Based on Chaotic Baker's Map

NASA Astrophysics Data System (ADS)

Gondal, Muhammad Asif; Abdul Raheem; Hussain, Iqtadar

2014-09-01

In this paper, a method for obtaining cryptographically strong 8 × 8 substitution boxes (S-boxes) is presented. The method is based on chaotic baker's map and a "mini version" of a new block cipher with block size 8 bits and can be easily and efficiently performed on a computer. The cryptographic strength of some 8 × 8 S-boxes randomly produced by the method is analyzed. The results show (1) all of them are bijective; (2) the nonlinearity of each output bit of them is usually about 100; (3) all of them approximately satisfy the strict avalanche criterion and output bits independence criterion; (4) they all have an almost equiprobable input/output XOR distribution.

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.

Designing and Operating Through Compromise: Architectural Analysis of CKMS for the Advanced Metering Infrastructure

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

Duren, Mike; Aldridge, Hal; Abercrombie, Robert K

2013-01-01

Compromises attributable to the Advanced Persistent Threat (APT) highlight the necessity for constant vigilance. The APT provides a new perspective on security metrics (e.g., statistics based cyber security) and quantitative risk assessments. We consider design principals and models/tools that provide high assurance for energy delivery systems (EDS) operations regardless of the state of compromise. Cryptographic keys must be securely exchanged, then held and protected on either end of a communications link. This is challenging for a utility with numerous substations that must secure the intelligent electronic devices (IEDs) that may comprise complex control system of systems. For example, distribution andmore » management of keys among the millions of intelligent meters within the Advanced Metering Infrastructure (AMI) is being implemented as part of the National Smart Grid initiative. Without a means for a secure cryptographic key management system (CKMS) no cryptographic solution can be widely deployed to protect the EDS infrastructure from cyber-attack. We consider 1) how security modeling is applied to key management and cyber security concerns on a continuous basis from design through operation, 2) how trusted models and key management architectures greatly impact failure scenarios, and 3) how hardware-enabled trust is a critical element to detecting, surviving, and recovering from attack.« less

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.

Quantum-secured blockchain

NASA Astrophysics Data System (ADS)

Kiktenko, E. O.; Pozhar, N. O.; Anufriev, M. N.; Trushechkin, A. S.; Yunusov, R. R.; Kurochkin, Y. V.; Lvovsky, A. I.; Fedorov, A. K.

2018-07-01

Blockchain is a distributed database which is cryptographically protected against malicious modifications. While promising for a wide range of applications, current blockchain platforms rely on digital signatures, which are vulnerable to attacks by means of quantum computers. The same, albeit to a lesser extent, applies to cryptographic hash functions that are used in preparing new blocks, so parties with access to quantum computation would have unfair advantage in procuring mining rewards. Here we propose a possible solution to the quantum era blockchain challenge and report an experimental realization of a quantum-safe blockchain platform that utilizes quantum key distribution across an urban fiber network for information-theoretically secure authentication. These results address important questions about realizability and scalability of quantum-safe blockchains for commercial and governmental applications.

Next generation DRM: cryptography or forensics?

NASA Astrophysics Data System (ADS)

Robert, Arnaud

2009-02-01

Current content protection systems rely primarily on applied cryptographic techniques but there is an increased use of forensic solutions in images, music and video distribution alike. The two approaches differ significantly, both in terms of technology and in terms of strategy, and thus it begs the question: will one approach take over in the long run, and if so which one? Discussing the evolution of both cryptographic and forensic solutions, we conclude that neither approach is ideal for all constituents, and that in the video space at least they will continue to co-exist for the foreseeable future - even if this may not be the case for other media types. We also analyze shortcomings of these approaches, and suggest that new solutions are necessary in this still emerging marketplace.

Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels

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

Deutsch, D.; Ekert, A.; Jozsa, R.

1996-09-01

Existing quantum cryptographic schemes are not, as they stand, operable in the presence of noise on the quantum communication channel. Although they become operable if they are supplemented by classical privacy-amplification techniques, the resulting schemes are difficult to analyze and have not been proved secure. We introduce the concept of quantum privacy amplification and a cryptographic scheme incorporating it which is provably secure over a noisy channel. The scheme uses an {open_quote}{open_quote}entanglement purification{close_quote}{close_quote} procedure which, because it requires only a few quantum controlled-not and single-qubit operations, could be implemented using technology that is currently being developed. {copyright} {ital 1996 Themore » American Physical Society.}« less

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.

Experimentally feasible security check for n-qubit quantum secret sharing

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

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

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

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

PubMed Central

Salomon, Dor

2016-01-01

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

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.

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.

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

Cryptographic Protocol for Comparing Sets without Leaking Them: Applications in Astronomy

NASA Astrophysics Data System (ADS)

McCullough, Peter R.

2011-09-01

We describe a cryptographic protocol for two or more persons to compare individual lists of astronomical objects of interest without leaking them. Cryptographers have long known such protocols; astronomers and other scientists may benefit from them also. We describe some latent opportunities that would be enabled by this protocol. Consider the following scenario: Alice has a set of stars that are candidate hosts of transiting planets. Bob has a similar set. Alice and Bob have a mutual desire to know the intersection of their two lists without revealing them to each other. Alice and Bob can recruit a trusted third party, Josephine, to make the comparison, report the results, and then destroy each list. Limitations of that approach are that 1) Josephine must devote time to make each comparison, 2) Alice and Bob may not know a Josephine that they both can trust, especially if Alice and Bob are from different communities, 3) Josephine may not indeed be trustworthy, 4) a fourth person may wittingly or unwittingly intercept one or both of the lists in Josephine's care, and 5) anticipating those limitations, Alice and Bob may elect not to recruit a Josephine and hence not compare their lists. We describe a variant that overcomes those limitations by A) encrypting the lists prior to transmitting them to Josephine, and B) replacing a human Josephine with a computer website.

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

Multi-factor authentication

DOEpatents

Hamlet, Jason R; Pierson, Lyndon G

2014-10-21

Detection and deterrence of spoofing of user authentication may be achieved by including a cryptographic fingerprint unit within a hardware device for authenticating a user of the hardware device. The cryptographic fingerprint unit includes an internal physically unclonable function ("PUF") circuit disposed in or on the hardware device, which generates a PUF value. Combining logic is coupled to receive the PUF value, combines the PUF value with one or more other authentication factors to generate a multi-factor authentication value. A key generator is coupled to generate a private key and a public key based on the multi-factor authentication value while a decryptor is coupled to receive an authentication challenge posed to the hardware device and encrypted with the public key and coupled to output a response to the authentication challenge decrypted with the private key.

Modular multiplication in GF(p) for public-key cryptography

NASA Astrophysics Data System (ADS)

Olszyna, Jakub

Modular multiplication forms the basis of modular exponentiation which is the core operation of the RSA cryptosystem. It is also present in many other cryptographic algorithms including those based on ECC and HECC. Hence, an efficient implementation of PKC relies on efficient implementation of modular multiplication. The paper presents a survey of most common algorithms for modular multiplication along with hardware architectures especially suitable for cryptographic applications in energy constrained environments. The motivation for studying low-power and areaefficient modular multiplication algorithms comes from enabling public-key security for ultra-low power devices that can perform under constrained environments like wireless sensor networks. Serial architectures for GF(p) are analyzed and presented. Finally proposed architectures are verified and compared according to the amount of power dissipated throughout the operation.

Cryptographic robustness of a quantum cryptography system using phase-time coding

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

Molotkov, S. N.

2008-01-15

A cryptographic analysis is presented of a new quantum key distribution protocol using phase-time coding. An upper bound is obtained for the error rate that guarantees secure key distribution. It is shown that the maximum tolerable error rate for this protocol depends on the counting rate in the control time slot. When no counts are detected in the control time slot, the protocol guarantees secure key distribution if the bit error rate in the sifted key does not exceed 50%. This protocol partially discriminates between errors due to system defects (e.g., imbalance of a fiber-optic interferometer) and eavesdropping. In themore » absence of eavesdropping, the counts detected in the control time slot are not caused by interferometer imbalance, which reduces the requirements for interferometer stability.« less

Cryptography and the Internet: lessons and challenges

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

McCurley, K.S.

1996-12-31

The popularization of the Internet has brought fundamental changes to the world, because it allows a universal method of communication between computers. This carries enormous benefits with it, but also raises many security considerations. Cryptography is a fundamental technology used to provide security of computer networks, and there is currently a widespread engineering effort to incorporate cryptography into various aspects of the Internet. The system-level engineering required to provide security services for the Internet carries some important lessons for researchers whose study is focused on narrowly defined problems. It also offers challenges to the cryptographic research community by raising newmore » questions not adequately addressed by the existing body of knowledge. This paper attempts to summarize some of these lessons and challenges for the cryptographic research community.« less

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.

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.

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

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.

Geospatial cryptography: enabling researchers to access private, spatially referenced, human subjects data for cancer control and prevention.

PubMed

Jacquez, Geoffrey M; Essex, Aleksander; Curtis, Andrew; Kohler, Betsy; Sherman, Recinda; Emam, Khaled El; Shi, Chen; Kaufmann, Andy; Beale, Linda; Cusick, Thomas; Goldberg, Daniel; Goovaerts, Pierre

2017-07-01

As the volume, accuracy and precision of digital geographic information have increased, concerns regarding individual privacy and confidentiality have come to the forefront. Not only do these challenge a basic tenet underlying the advancement of science by posing substantial obstacles to the sharing of data to validate research results, but they are obstacles to conducting certain research projects in the first place. Geospatial cryptography involves the specification, design, implementation and application of cryptographic techniques to address privacy, confidentiality and security concerns for geographically referenced data. This article defines geospatial cryptography and demonstrates its application in cancer control and surveillance. Four use cases are considered: (1) national-level de-duplication among state or province-based cancer registries; (2) sharing of confidential data across cancer registries to support case aggregation across administrative geographies; (3) secure data linkage; and (4) cancer cluster investigation and surveillance. A secure multi-party system for geospatial cryptography is developed. Solutions under geospatial cryptography are presented and computation time is calculated. As services provided by cancer registries to the research community, de-duplication, case aggregation across administrative geographies and secure data linkage are often time-consuming and in some instances precluded by confidentiality and security concerns. Geospatial cryptography provides secure solutions that hold significant promise for addressing these concerns and for accelerating the pace of research with human subjects data residing in our nation's cancer registries. Pursuit of the research directions posed herein conceivably would lead to a geospatially encrypted geographic information system (GEGIS) designed specifically to promote the sharing and spatial analysis of confidential data. Geospatial cryptography holds substantial promise for accelerating the pace of research with spatially referenced human subjects data.

Provably secure and high-rate quantum key distribution with time-bin qudits

DOE PAGES

Islam, Nurul T.; Lim, Charles Ci Wen; Cahall, Clinton; ...

2017-11-24

The security of conventional cryptography systems is threatened in the forthcoming era of quantum computers. Quantum key distribution (QKD) features fundamentally proven security and offers a promising option for quantum-proof cryptography solution. Although prototype QKD systems over optical fiber have been demonstrated over the years, the key generation rates remain several orders of magnitude lower than current classical communication systems. In an effort toward a commercially viable QKD system with improved key generation rates, we developed a discrete-variable QKD system based on time-bin quantum photonic states that can generate provably secure cryptographic keys at megabit-per-second rates over metropolitan distances. Wemore » use high-dimensional quantum states that transmit more than one secret bit per received photon, alleviating detector saturation effects in the superconducting nanowire single-photon detectors used in our system that feature very high detection efficiency (of more than 70%) and low timing jitter (of less than 40 ps). Our system is constructed using commercial off-the-shelf components, and the adopted protocol can be readily extended to free-space quantum channels. In conclusion, the security analysis adopted to distill the keys ensures that the demonstrated protocol is robust against coherent attacks, finite-size effects, and a broad class of experimental imperfections identified in our system.« less

Provably secure and high-rate quantum key distribution with time-bin qudits

PubMed Central

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

2017-01-01

The security of conventional cryptography systems is threatened in the forthcoming era of quantum computers. Quantum key distribution (QKD) features fundamentally proven security and offers a promising option for quantum-proof cryptography solution. Although prototype QKD systems over optical fiber have been demonstrated over the years, the key generation rates remain several orders of magnitude lower than current classical communication systems. In an effort toward a commercially viable QKD system with improved key generation rates, we developed a discrete-variable QKD system based on time-bin quantum photonic states that can generate provably secure cryptographic keys at megabit-per-second rates over metropolitan distances. We use high-dimensional quantum states that transmit more than one secret bit per received photon, alleviating detector saturation effects in the superconducting nanowire single-photon detectors used in our system that feature very high detection efficiency (of more than 70%) and low timing jitter (of less than 40 ps). Our system is constructed using commercial off-the-shelf components, and the adopted protocol can be readily extended to free-space quantum channels. The security analysis adopted to distill the keys ensures that the demonstrated protocol is robust against coherent attacks, finite-size effects, and a broad class of experimental imperfections identified in our system. PMID:29202028

Pre-Mrna Introns as a Model for Cryptographic Algorithm:. Theory and Experiments

NASA Astrophysics Data System (ADS)

Regoli, Massimo

2010-01-01

The RNA-Crypto System (shortly RCS) is a symmetric key algorithm to cipher data. The idea for this new algorithm starts from the observation of nature. In particular from the observation of RNA behavior and some of its properties. In particular the RNA sequences have some sections called Introns. Introns, derived from the term "intragenic regions", are non-coding sections of precursor mRNA (pre-mRNA) or other RNAs, that are removed (spliced out of the RNA) before the mature RNA is formed. Once the introns have been spliced out of a pre-mRNA, the resulting mRNA sequence is ready to be translated into a protein. The corresponding parts of a gene are known as introns as well. The nature and the role of Introns in the pre-mRNA is not clear and it is under ponderous researches by Biologists but, in our case, we will use the presence of Introns in the RNA-Crypto System output as a strong method to add chaotic non coding information and an unnecessary behaviour in the access to the secret key to code the messages. In the RNA-Crypto System algorithm the introns are sections of the ciphered message with non-coding information as well as in the precursor mRNA.

Combination of Rivest-Shamir-Adleman Algorithm and End of File Method for Data Security

NASA Astrophysics Data System (ADS)

Rachmawati, Dian; Amalia, Amalia; Elviwani

2018-03-01

Data security is one of the crucial issues in the delivery of information. One of the ways which used to secure the data is by encoding it into something else that is not comprehensible by human beings by using some crypto graphical techniques. The Rivest-Shamir-Adleman (RSA) cryptographic algorithm has been proven robust to secure messages. Since this algorithm uses two different keys (i.e., public key and private key) at the time of encryption and decryption, it is classified as asymmetric cryptography algorithm. Steganography is a method that is used to secure a message by inserting the bits of the message into a larger media such as an image. One of the known steganography methods is End of File (EoF). In this research, the cipher text resulted from the RSA algorithm is compiled into an array form and appended to the end of the image. The result of the EoF is the image which has a line with black gradations under it. This line contains the secret message. This combination of cryptography and steganography in securing the message is expected to increase the security of the message, since the message encryption technique (RSA) is mixed with the data hiding technique (EoF).

Provably secure and high-rate quantum key distribution with time-bin qudits.

PubMed

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

2017-11-01

The security of conventional cryptography systems is threatened in the forthcoming era of quantum computers. Quantum key distribution (QKD) features fundamentally proven security and offers a promising option for quantum-proof cryptography solution. Although prototype QKD systems over optical fiber have been demonstrated over the years, the key generation rates remain several orders of magnitude lower than current classical communication systems. In an effort toward a commercially viable QKD system with improved key generation rates, we developed a discrete-variable QKD system based on time-bin quantum photonic states that can generate provably secure cryptographic keys at megabit-per-second rates over metropolitan distances. We use high-dimensional quantum states that transmit more than one secret bit per received photon, alleviating detector saturation effects in the superconducting nanowire single-photon detectors used in our system that feature very high detection efficiency (of more than 70%) and low timing jitter (of less than 40 ps). Our system is constructed using commercial off-the-shelf components, and the adopted protocol can be readily extended to free-space quantum channels. The security analysis adopted to distill the keys ensures that the demonstrated protocol is robust against coherent attacks, finite-size effects, and a broad class of experimental imperfections identified in our system.

Enhancing Electromagnetic Side-Channel Analysis in an Operational Environment

NASA Astrophysics Data System (ADS)

Montminy, David P.

Side-channel attacks exploit the unintentional emissions from cryptographic devices to determine the secret encryption key. This research identifies methods to make attacks demonstrated in an academic environment more operationally relevant. Algebraic cryptanalysis is used to reconcile redundant information extracted from side-channel attacks on the AES key schedule. A novel thresholding technique is used to select key byte guesses for a satisfiability solver resulting in a 97.5% success rate despite failing for 100% of attacks using standard methods. Two techniques are developed to compensate for differences in emissions from training and test devices dramatically improving the effectiveness of cross device template attacks. Mean and variance normalization improves same part number attack success rates from 65.1% to 100%, and increases the number of locations an attack can be performed by 226%. When normalization is combined with a novel technique to identify and filter signals in collected traces not related to the encryption operation, the number of traces required to perform a successful attack is reduced by 85.8% on average. Finally, software-defined radios are shown to be an effective low-cost method for collecting side-channel emissions in real-time, eliminating the need to modify or profile the target encryption device to gain precise timing information.

Provably secure and high-rate quantum key distribution with time-bin qudits

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

Islam, Nurul T.; Lim, Charles Ci Wen; Cahall, Clinton

The security of conventional cryptography systems is threatened in the forthcoming era of quantum computers. Quantum key distribution (QKD) features fundamentally proven security and offers a promising option for quantum-proof cryptography solution. Although prototype QKD systems over optical fiber have been demonstrated over the years, the key generation rates remain several orders of magnitude lower than current classical communication systems. In an effort toward a commercially viable QKD system with improved key generation rates, we developed a discrete-variable QKD system based on time-bin quantum photonic states that can generate provably secure cryptographic keys at megabit-per-second rates over metropolitan distances. Wemore » use high-dimensional quantum states that transmit more than one secret bit per received photon, alleviating detector saturation effects in the superconducting nanowire single-photon detectors used in our system that feature very high detection efficiency (of more than 70%) and low timing jitter (of less than 40 ps). Our system is constructed using commercial off-the-shelf components, and the adopted protocol can be readily extended to free-space quantum channels. In conclusion, the security analysis adopted to distill the keys ensures that the demonstrated protocol is robust against coherent attacks, finite-size effects, and a broad class of experimental imperfections identified in our system.« 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.

Signal processing for smart cards

NASA Astrophysics Data System (ADS)

Quisquater, Jean-Jacques; Samyde, David

2003-06-01

In 1998, Paul Kocher showed that when a smart card computes cryptographic algorithms, for signatures or encryption, its consumption or its radiations leak information. The keys or the secrets hidden in the card can then be recovered using a differential measurement based on the intercorrelation function. A lot of silicon manufacturers use desynchronization countermeasures to defeat power analysis. In this article we detail a new resynchronization technic. This method can be used to facilitate the use of a neural network to do the code recognition. It becomes possible to reverse engineer a software code automatically. Using data and clock separation methods, we show how to optimize the synchronization using signal processing. Then we compare these methods with watermarking methods for 1D and 2D signal. The very last watermarking detection improvements can be applied to signal processing for smart cards with very few modifications. Bayesian processing is one of the best ways to do Differential Power Analysis, and it is possible to extract a PIN code from a smart card in very few samples. So this article shows the need to continue to set up effective countermeasures for cryptographic processors. Although the idea to use advanced signal processing operators has been commonly known for a long time, no publication explains that results can be obtained. The main idea of differential measurement is to use the cross-correlation of two random variables and to repeat consumption measurements on the processor to be analyzed. We use two processors clocked at the same external frequency and computing the same data. The applications of our design are numerous. Two measurements provide the inputs of a central operator. With the most accurate operator we can improve the signal noise ratio, re-synchronize the acquisition clock with the internal one, or remove jitter. The analysis based on consumption or electromagnetic measurements can be improved using our structure. At first sight the same results can be obtained with only one smart card, but this idea is not completely true because the statistical properties of the signal are not the same. As the two smart cards are submitted to the same external noise during the measurement, it is more easy to reduce the influence of perturbations. This paper shows the importance of accurate countermeasures against differential analysis.

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

Conventional Cryptography.

ERIC Educational Resources Information Center

Wright, Marie A.

1993-01-01

Cryptography is the science that renders data unintelligible to prevent its unauthorized disclosure or modification. Presents an application of matrices used in linear transformations to illustrate a cryptographic system. An example is provided. (17 references) (MDH)

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 .

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.

SecureMA: protecting participant privacy in genetic association meta-analysis.

PubMed

Xie, Wei; Kantarcioglu, Murat; Bush, William S; Crawford, Dana; Denny, Joshua C; Heatherly, Raymond; Malin, Bradley A

2014-12-01

Sharing genomic data is crucial to support scientific investigation such as genome-wide association studies. However, recent investigations suggest the privacy of the individual participants in these studies can be compromised, leading to serious concerns and consequences, such as overly restricted access to data. We introduce a novel cryptographic strategy to securely perform meta-analysis for genetic association studies in large consortia. Our methodology is useful for supporting joint studies among disparate data sites, where privacy or confidentiality is of concern. We validate our method using three multisite association studies. Our research shows that genetic associations can be analyzed efficiently and accurately across substudy sites, without leaking information on individual participants and site-level association summaries. Our software for secure meta-analysis of genetic association studies, SecureMA, is publicly available at http://github.com/XieConnect/SecureMA. Our customized secure computation framework is also publicly available at http://github.com/XieConnect/CircuitService. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Clinical records anonymisation and text extraction (CRATE): an open-source software system.

PubMed

Cardinal, Rudolf N

2017-04-26

Electronic medical records contain information of value for research, but contain identifiable and often highly sensitive confidential information. Patient-identifiable information cannot in general be shared outside clinical care teams without explicit consent, but anonymisation/de-identification allows research uses of clinical data without explicit consent. This article presents CRATE (Clinical Records Anonymisation and Text Extraction), an open-source software system with separable functions: (1) it anonymises or de-identifies arbitrary relational databases, with sensitivity and precision similar to previous comparable systems; (2) it uses public secure cryptographic methods to map patient identifiers to research identifiers (pseudonyms); (3) it connects relational databases to external tools for natural language processing; (4) it provides a web front end for research and administrative functions; and (5) it supports a specific model through which patients may consent to be contacted about research. Creation and management of a research database from sensitive clinical records with secure pseudonym generation, full-text indexing, and a consent-to-contact process is possible and practical using entirely free and open-source software.

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

Changes to Quantum Cryptography

NASA Astrophysics Data System (ADS)

Sakai, Yasuyuki; Tanaka, Hidema

Quantum cryptography has become a subject of widespread interest. In particular, quantum key distribution, which provides a secure key agreement by using quantum systems, is believed to be the most important application of quantum cryptography. Quantum key distribution has the potential to achieve the “unconditionally” secure infrastructure. We also have many cryptographic tools that are based on “modern cryptography” at the present time. They are being used in an effort to guarantee secure communication over open networks such as the Internet. Unfortunately, their ultimate efficacy is in doubt. Quantum key distribution systems are believed to be close to practical and commercial use. In this paper, we discuss what we should do to apply quantum cryptography to our communications. We also discuss how quantum key distribution can be combined with or used to replace cryptographic tools based on modern cryptography.

Protecting privacy in a clinical data warehouse.

PubMed

Kong, Guilan; Xiao, Zhichun

2015-06-01

Peking University has several prestigious teaching hospitals in China. To make secondary use of massive medical data for research purposes, construction of a clinical data warehouse is imperative in Peking University. However, a big concern for clinical data warehouse construction is how to protect patient privacy. In this project, we propose to use a combination of symmetric block ciphers, asymmetric ciphers, and cryptographic hashing algorithms to protect patient privacy information. The novelty of our privacy protection approach lies in message-level data encryption, the key caching system, and the cryptographic key management system. The proposed privacy protection approach is scalable to clinical data warehouse construction with any size of medical data. With the composite privacy protection approach, the clinical data warehouse can be secure enough to keep the confidential data from leaking to the outside world. © The Author(s) 2014.

Physical cryptographic verification of nuclear warheads

PubMed Central

Kemp, R. Scott; Danagoulian, Areg; Macdonald, Ruaridh R.; Vavrek, Jayson R.

2016-01-01

How does one prove a claim about a highly sensitive object such as a nuclear weapon without revealing information about the object? This paradox has challenged nuclear arms control for more than five decades. We present a mechanism in the form of an interactive proof system that can validate the structure and composition of an object, such as a nuclear warhead, to arbitrary precision without revealing either its structure or composition. We introduce a tomographic method that simultaneously resolves both the geometric and isotopic makeup of an object. We also introduce a method of protecting information using a provably secure cryptographic hash that does not rely on electronics or software. These techniques, when combined with a suitable protocol, constitute an interactive proof system that could reject hoax items and clear authentic warheads with excellent sensitivity in reasonably short measurement times. PMID:27432959

Formal Analysis of Key Integrity in PKCS#11

NASA Astrophysics Data System (ADS)

Falcone, Andrea; Focardi, Riccardo

PKCS#11 is a standard API to cryptographic devices such as smarcards, hardware security modules and usb crypto-tokens. Though widely adopted, this API has been shown to be prone to attacks in which a malicious user gains access to the sensitive keys stored in the devices. In 2008, Delaune, Kremer and Steel proposed a model to formally reason on this kind of attacks. We extend this model to also describe flaws that are based on integrity violations of the stored keys. In particular, we consider scenarios in which a malicious overwriting of keys might fool honest users into using attacker's own keys, while performing sensitive operations. We further enrich the model with a trusted key mechanism ensuring that only controlled, non-tampered keys are used in cryptographic operations, and we show how this modified API prevents the above mentioned key-replacement attacks.

A novel key management solution for reinforcing compliance with HIPAA privacy/security regulations.

PubMed

Lee, Chien-Ding; Ho, Kevin I-J; Lee, Wei-Bin

2011-07-01

Digitizing medical records facilitates the healthcare process. However, it can also cause serious security and privacy problems, which are the major concern in the Health Insurance Portability and Accountability Act (HIPAA). While various conventional encryption mechanisms can solve some aspects of these problems, they cannot address the illegal distribution of decrypted medical images, which violates the regulations defined in the HIPAA. To protect decrypted medical images from being illegally distributed by an authorized staff member, the model proposed in this paper provides a way to integrate several cryptographic mechanisms. In this model, the malicious staff member can be tracked by a watermarked clue. By combining several well-designed cryptographic mechanisms and developing a key management scheme to facilitate the interoperation among these mechanisms, the risk of illegal distribution can be reduced.

Practical quantum retrieval games

NASA Astrophysics Data System (ADS)

Arrazola, Juan Miguel; Karasamanis, Markos; Lütkenhaus, Norbert

2016-06-01

Complex cryptographic protocols are often constructed from simpler building blocks. In order to advance quantum cryptography, it is important to study practical building blocks that can be used to develop new protocols. An example is quantum retrieval games (QRGs), which have broad applicability and have already been used to construct quantum money schemes. In this work, we introduce a general construction of quantum retrieval games based on the hidden matching problem and show how they can be implemented in practice using available technology. More precisely, we provide a general method to construct (1-out-of-k ) QRGs, proving that their cheating probabilities decrease exponentially in k . In particular, we define QRGs based on coherent states of light, which can be implemented even in the presence of experimental imperfections. Our results constitute a tool in the arsenal of the practical quantum cryptographer.

Physical cryptographic verification of nuclear warheads

NASA Astrophysics Data System (ADS)

Kemp, R. Scott; Danagoulian, Areg; Macdonald, Ruaridh R.; Vavrek, Jayson R.

2016-08-01

How does one prove a claim about a highly sensitive object such as a nuclear weapon without revealing information about the object? This paradox has challenged nuclear arms control for more than five decades. We present a mechanism in the form of an interactive proof system that can validate the structure and composition of an object, such as a nuclear warhead, to arbitrary precision without revealing either its structure or composition. We introduce a tomographic method that simultaneously resolves both the geometric and isotopic makeup of an object. We also introduce a method of protecting information using a provably secure cryptographic hash that does not rely on electronics or software. These techniques, when combined with a suitable protocol, constitute an interactive proof system that could reject hoax items and clear authentic warheads with excellent sensitivity in reasonably short measurement times.

Physical cryptographic verification of nuclear warheads.

PubMed

Kemp, R Scott; Danagoulian, Areg; Macdonald, Ruaridh R; Vavrek, Jayson R

2016-08-02

How does one prove a claim about a highly sensitive object such as a nuclear weapon without revealing information about the object? This paradox has challenged nuclear arms control for more than five decades. We present a mechanism in the form of an interactive proof system that can validate the structure and composition of an object, such as a nuclear warhead, to arbitrary precision without revealing either its structure or composition. We introduce a tomographic method that simultaneously resolves both the geometric and isotopic makeup of an object. We also introduce a method of protecting information using a provably secure cryptographic hash that does not rely on electronics or software. These techniques, when combined with a suitable protocol, constitute an interactive proof system that could reject hoax items and clear authentic warheads with excellent sensitivity in reasonably short measurement times.

Efficient and anonymous two-factor user authentication in wireless sensor networks: achieving user anonymity with lightweight sensor computation.

PubMed

Nam, Junghyun; Choo, Kim-Kwang Raymond; Han, Sangchul; Kim, Moonseong; Paik, Juryon; Won, Dongho

2015-01-01

A smart-card-based user authentication scheme for wireless sensor networks (hereafter referred to as a SCA-WSN scheme) is designed to ensure that only users who possess both a smart card and the corresponding password are allowed to gain access to sensor data and their transmissions. Despite many research efforts in recent years, it remains a challenging task to design an efficient SCA-WSN scheme that achieves user anonymity. The majority of published SCA-WSN schemes use only lightweight cryptographic techniques (rather than public-key cryptographic techniques) for the sake of efficiency, and have been demonstrated to suffer from the inability to provide user anonymity. Some schemes employ elliptic curve cryptography for better security but require sensors with strict resource constraints to perform computationally expensive scalar-point multiplications; despite the increased computational requirements, these schemes do not provide user anonymity. In this paper, we present a new SCA-WSN scheme that not only achieves user anonymity but also is efficient in terms of the computation loads for sensors. Our scheme employs elliptic curve cryptography but restricts its use only to anonymous user-to-gateway authentication, thereby allowing sensors to perform only lightweight cryptographic operations. Our scheme also enjoys provable security in a formal model extended from the widely accepted Bellare-Pointcheval-Rogaway (2000) model to capture the user anonymity property and various SCA-WSN specific attacks (e.g., stolen smart card attacks, node capture attacks, privileged insider attacks, and stolen verifier attacks).

Efficient and Anonymous Two-Factor User Authentication in Wireless Sensor Networks: Achieving User Anonymity with Lightweight Sensor Computation

PubMed Central

Nam, Junghyun; Choo, Kim-Kwang Raymond; Han, Sangchul; Kim, Moonseong; Paik, Juryon; Won, Dongho

2015-01-01

A smart-card-based user authentication scheme for wireless sensor networks (hereafter referred to as a SCA-WSN scheme) is designed to ensure that only users who possess both a smart card and the corresponding password are allowed to gain access to sensor data and their transmissions. Despite many research efforts in recent years, it remains a challenging task to design an efficient SCA-WSN scheme that achieves user anonymity. The majority of published SCA-WSN schemes use only lightweight cryptographic techniques (rather than public-key cryptographic techniques) for the sake of efficiency, and have been demonstrated to suffer from the inability to provide user anonymity. Some schemes employ elliptic curve cryptography for better security but require sensors with strict resource constraints to perform computationally expensive scalar-point multiplications; despite the increased computational requirements, these schemes do not provide user anonymity. In this paper, we present a new SCA-WSN scheme that not only achieves user anonymity but also is efficient in terms of the computation loads for sensors. Our scheme employs elliptic curve cryptography but restricts its use only to anonymous user-to-gateway authentication, thereby allowing sensors to perform only lightweight cryptographic operations. Our scheme also enjoys provable security in a formal model extended from the widely accepted Bellare-Pointcheval-Rogaway (2000) model to capture the user anonymity property and various SCA-WSN specific attacks (e.g., stolen smart card attacks, node capture attacks, privileged insider attacks, and stolen verifier attacks). PMID:25849359

[Linking anonymous databases for national and international multicenter epidemiological studies: a cryptographic algorithm].

PubMed

Quantin, C; Fassa, M; Coatrieux, G; Riandey, B; Trouessin, G; Allaert, F A

2009-02-01

Compiling individual records which come from different sources remains very important for multicenter epidemiological studies, but at the same time European directives or other national legislation concerning nominal data processing have to be respected. These legal aspects can be satisfied by implementing mechanisms that allow anonymization of patient data (such as hashing techniques). Moreover, for security reasons, official recommendations suggest using different cryptographic keys in combination with a cryptographic hash function for each study. Unfortunately, such an anonymization procedure is in contradiction with the common requirement in public health and biomedical research as it becomes almost impossible to link records from separate data collections where the same entity is not referenced in the same way. Solving this paradox by using methodology based on the combination of hashing and enciphering techniques is the main aim of this article. The method relies on one of the best known hashing functions (the secure hash algorithm) to ensure the anonymity of personal information while providing greater resistance to dictionary attacks, combined with encryption techniques. The originality of the method relies on the way the combination of hashing and enciphering techniques is performed: like in asymmetric encryption, two keys are used but the private key depends on the patient's identity. The combination of hashing and enciphering techniques provides a great improvement in the overall security of the proposed scheme. This methodology makes the stored data available for use in the field of public health for the benefit of patients, while respecting legal security requirements.

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.

Solving data-at-rest for the storage and retrieval of files in ad hoc networks

NASA Astrophysics Data System (ADS)

Knobler, Ron; Scheffel, Peter; Williams, Jonathan; Gaj, Kris; Kaps, Jens-Peter

2013-05-01

Based on current trends for both military and commercial applications, the use of mobile devices (e.g. smartphones and tablets) is greatly increasing. Several military applications consist of secure peer to peer file sharing without a centralized authority. For these military applications, if one or more of these mobile devices are lost or compromised, sensitive files can be compromised by adversaries, since COTS devices and operating systems are used. Complete system files cannot be stored on a device, since after compromising a device, an adversary can attack the data at rest, and eventually obtain the original file. Also after a device is compromised, the existing peer to peer system devices must still be able to access all system files. McQ has teamed with the Cryptographic Engineering Research Group at George Mason University to develop a custom distributed file sharing system to provide a complete solution to the data at rest problem for resource constrained embedded systems and mobile devices. This innovative approach scales very well to a large number of network devices, without a single point of failure. We have implemented the approach on representative mobile devices as well as developed an extensive system simulator to benchmark expected system performance based on detailed modeling of the network/radio characteristics, CONOPS, and secure distributed file system functionality. The simulator is highly customizable for the purpose of determining expected system performance for other network topologies and CONOPS.

15 CFR Supplement No. 8 to Part 742 - Self-Classification Report for Encryption Items

Code of Federal Regulations, 2011 CFR

2011-01-01

... forensics (v) Cryptographic accelerator (vi) Data backup and recovery (vii) Database (viii) Disk/drive... (MAN) (xxii) Modem (xxiii) Network convergence or infrastructure n.e.s. (xxiv) Network forensics (xxv...

15 CFR Supplement No. 8 to Part 742 - Self-Classification Report for Encryption Items

Code of Federal Regulations, 2014 CFR

2014-01-01

... forensics (v) Cryptographic accelerator (vi) Data backup and recovery (vii) Database (viii) Disk/drive... (MAN) (xxii) Modem (xxiii) Network convergence or infrastructure n.e.s. (xxiv) Network forensics (xxv...

15 CFR Supplement No. 8 to Part 742 - Self-Classification Report for Encryption Items

Code of Federal Regulations, 2013 CFR

2013-01-01

... forensics (v) Cryptographic accelerator (vi) Data backup and recovery (vii) Database (viii) Disk/drive... (MAN) (xxii) Modem (xxiii) Network convergence or infrastructure n.e.s. (xxiv) Network forensics (xxv...

15 CFR Supplement No. 8 to Part 742 - Self-Classification Report for Encryption Items

Code of Federal Regulations, 2012 CFR

2012-01-01

... forensics (v) Cryptographic accelerator (vi) Data backup and recovery (vii) Database (viii) Disk/drive... (MAN) (xxii) Modem (xxiii) Network convergence or infrastructure n.e.s. (xxiv) Network forensics (xxv...

10 CFR 25.15 - Access permitted under “Q” or “L” access authorization.

Code of Federal Regulations, 2010 CFR

2010-01-01

... Confidential National Security Information including intelligence information, CRYPTO (i.e., cryptographic... official business when the employee has the appropriate level of NRC access authorization and need-to-know...

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.

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.

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

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

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.

SPOT: Optimization Tool for Network Adaptable Security

NASA Astrophysics Data System (ADS)

Ksiezopolski, Bogdan; Szalachowski, Pawel; Kotulski, Zbigniew

Recently we have observed the growth of the intelligent application especially with its mobile character, called e-anything. The implementation of these applications provides guarantee of security requirements of the cryptographic protocols which are used in the application. Traditionally the protocols have been configured with the strongest possible security mechanisms. Unfortunately, when the application is used by means of the mobile devices, the strongest protection can lead to the denial of services for them. The solution of this problem is introducing the quality of protection models which will scale the protection level depending on the actual threat level. In this article we would like to introduce the application which manages the protection level of the processes in the mobile environment. The Security Protocol Optimizing Tool (SPOT) optimizes the cryptographic protocol and defines the protocol version appropriate to the actual threat level. In this article the architecture of the SPOT is presented with a detailed description of the included modules.

Quantum random oracle model for quantum digital signature

NASA Astrophysics Data System (ADS)

Shang, Tao; Lei, Qi; Liu, Jianwei

2016-10-01

The goal of this work is to provide a general security analysis tool, namely, the quantum random oracle (QRO), for facilitating the security analysis of quantum cryptographic protocols, especially protocols based on quantum one-way function. QRO is used to model quantum one-way function and different queries to QRO are used to model quantum attacks. A typical application of quantum one-way function is the quantum digital signature, whose progress has been hampered by the slow pace of the experimental realization. Alternatively, we use the QRO model to analyze the provable security of a quantum digital signature scheme and elaborate the analysis procedure. The QRO model differs from the prior quantum-accessible random oracle in that it can output quantum states as public keys and give responses to different queries. This tool can be a test bed for the cryptanalysis of more quantum cryptographic protocols based on the quantum one-way function.

Authenticity techniques for PACS images and records

NASA Astrophysics Data System (ADS)

Wong, Stephen T. C.; Abundo, Marco; Huang, H. K.

1995-05-01

Along with the digital radiology environment supported by picture archiving and communication systems (PACS) comes a new problem: How to establish trust in multimedia medical data that exist only in the easily altered memory of a computer. Trust is characterized in terms of integrity and privacy of digital data. Two major self-enforcing techniques can be used to assure the authenticity of electronic images and text -- key-based cryptography and digital time stamping. Key-based cryptography associates the content of an image with the originator using one or two distinct keys and prevents alteration of the document by anyone other than the originator. A digital time stamping algorithm generates a characteristic `digital fingerprint' for the original document using a mathematical hash function, and checks that it has not been modified. This paper discusses these cryptographic algorithms and their appropriateness for a PACS environment. It also presents experimental results of cryptographic algorithms on several imaging modalities.

Network Security via Biometric Recognition of Patterns of Gene Expression

NASA Technical Reports Server (NTRS)

Shaw, Harry C.

2016-01-01

Molecular biology provides the ability to implement forms of information and network security completely outside the bounds of legacy security protocols and algorithms. This paper addresses an approach which instantiates the power of gene expression for security. Molecular biology provides a rich source of gene expression and regulation mechanisms, which can be adopted to use in the information and electronic communication domains. Conventional security protocols are becoming increasingly vulnerable due to more intensive, highly capable attacks on the underlying mathematics of cryptography. Security protocols are being undermined by social engineering and substandard implementations by IT (Information Technology) organizations. Molecular biology can provide countermeasures to these weak points with the current security approaches. Future advances in instruments for analyzing assays will also enable this protocol to advance from one of cryptographic algorithms to an integrated system of cryptographic algorithms and real-time assays of gene expression products.

Network Security via Biometric Recognition of Patterns of Gene Expression

NASA Technical Reports Server (NTRS)

Shaw, Harry C.

2016-01-01

Molecular biology provides the ability to implement forms of information and network security completely outside the bounds of legacy security protocols and algorithms. This paper addresses an approach which instantiates the power of gene expression for security. Molecular biology provides a rich source of gene expression and regulation mechanisms, which can be adopted to use in the information and electronic communication domains. Conventional security protocols are becoming increasingly vulnerable due to more intensive, highly capable attacks on the underlying mathematics of cryptography. Security protocols are being undermined by social engineering and substandard implementations by IT organizations. Molecular biology can provide countermeasures to these weak points with the current security approaches. Future advances in instruments for analyzing assays will also enable this protocol to advance from one of cryptographic algorithms to an integrated system of cryptographic algorithms and real-time expression and assay of gene expression products.

The model of encryption algorithm based on non-positional polynomial notations and constructed on an SP-network

NASA Astrophysics Data System (ADS)

Kapalova, N.; Haumen, A.

2018-05-01

This paper addresses to structures and properties of the cryptographic information protection algorithm model based on NPNs and constructed on an SP-network. The main task of the research is to increase the cryptostrength of the algorithm. In the paper, the transformation resulting in the improvement of the cryptographic strength of the algorithm is described in detail. The proposed model is based on an SP-network. The reasons for using the SP-network in this model are the conversion properties used in these networks. In the encryption process, transformations based on S-boxes and P-boxes are used. It is known that these transformations can withstand cryptanalysis. In addition, in the proposed model, transformations that satisfy the requirements of the "avalanche effect" are used. As a result of this work, a computer program that implements an encryption algorithm model based on the SP-network has been developed.

System of end-to-end symmetric database encryption

NASA Astrophysics Data System (ADS)

Galushka, V. V.; Aydinyan, A. R.; Tsvetkova, O. L.; Fathi, V. A.; Fathi, D. V.

2018-05-01

The article is devoted to the actual problem of protecting databases from information leakage, which is performed while bypassing access control mechanisms. To solve this problem, it is proposed to use end-to-end data encryption, implemented at the end nodes of an interaction of the information system components using one of the symmetric cryptographic algorithms. For this purpose, a key management method designed for use in a multi-user system based on the distributed key representation model, part of which is stored in the database, and the other part is obtained by converting the user's password, has been developed and described. In this case, the key is calculated immediately before the cryptographic transformations and is not stored in the memory after the completion of these transformations. Algorithms for registering and authorizing a user, as well as changing his password, have been described, and the methods for calculating parts of a key when performing these operations have been provided.

A survey of noninteractive zero knowledge proof system and its applications.

PubMed

Wu, Huixin; Wang, Feng

2014-01-01

Zero knowledge proof system which has received extensive attention since it was proposed is an important branch of cryptography and computational complexity theory. Thereinto, noninteractive zero knowledge proof system contains only one message sent by the prover to the verifier. It is widely used in the construction of various types of cryptographic protocols and cryptographic algorithms because of its good privacy, authentication, and lower interactive complexity. This paper reviews and analyzes the basic principles of noninteractive zero knowledge proof system, and summarizes the research progress achieved by noninteractive zero knowledge proof system on the following aspects: the definition and related models of noninteractive zero knowledge proof system, noninteractive zero knowledge proof system of NP problems, noninteractive statistical and perfect zero knowledge, the connection between noninteractive zero knowledge proof system, interactive zero knowledge proof system, and zap, and the specific applications of noninteractive zero knowledge proof system. This paper also points out the future research directions.

Quantum cryptographic system with reduced data loss

DOEpatents

Lo, H.K.; Chau, H.F.

1998-03-24

A secure method for distributing a random cryptographic key with reduced data loss is disclosed. Traditional quantum key distribution systems employ similar probabilities for the different communication modes and thus reject at least half of the transmitted data. The invention substantially reduces the amount of discarded data (those that are encoded and decoded in different communication modes e.g. using different operators) in quantum key distribution without compromising security by using significantly different probabilities for the different communication modes. Data is separated into various sets according to the actual operators used in the encoding and decoding process and the error rate for each set is determined individually. The invention increases the key distribution rate of the BB84 key distribution scheme proposed by Bennett and Brassard in 1984. Using the invention, the key distribution rate increases with the number of quantum signals transmitted and can be doubled asymptotically. 23 figs.

Physical cryptographic verification of nuclear warheads

DOE PAGES

Kemp, R. Scott; Danagoulian, Areg; Macdonald, Ruaridh R.; ...

2016-07-18

How does one prove a claim about a highly sensitive object such as a nuclear weapon without revealing information about the object? This paradox has challenged nuclear arms control for more than five decades. We present a mechanism in the form of an interactive proof system that can validate the structure and composition of an object, such as a nuclear warhead, to arbitrary precision without revealing either its structure or composition. We introduce a tomographic method that simultaneously resolves both the geometric and isotopic makeup of an object. We also introduce a method of protecting information using a provably securemore » cryptographic hash that does not rely on electronics or software. Finally, these techniques, when combined with a suitable protocol, constitute an interactive proof system that could reject hoax items and clear authentic warheads with excellent sensitivity in reasonably short measurement times.« less

Min-entropy uncertainty relation for finite-size cryptography

NASA Astrophysics Data System (ADS)

Ng, Nelly Huei Ying; Berta, Mario; Wehner, Stephanie

2012-10-01

Apart from their foundational significance, entropic uncertainty relations play a central role in proving the security of quantum cryptographic protocols. Of particular interest are therefore relations in terms of the smooth min-entropy for Bennett-Brassard 1984 (BB84) and six-state encodings. The smooth min-entropy Hminɛ(X/B) quantifies the negative logarithm of the probability for an attacker B to guess X, except with a small failure probability ɛ. Previously, strong uncertainty relations were obtained which are valid in the limit of large block lengths. Here, we prove an alternative uncertainty relation in terms of the smooth min-entropy that is only marginally less strong but has the crucial property that it can be applied to rather small block lengths. This paves the way for a practical implementation of many cryptographic protocols. As part of our proof we show tight uncertainty relations for a family of Rényi entropies that may be of independent interest.

Secure Cryptographic Key Management System (CKMS) Considerations for Smart Grid Devices

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

Abercrombie, Robert K; Sheldon, Frederick T; Aldridge, Hal

2011-01-01

In this paper, we examine some unique challenges associated with key management in the Smart Grid and concomitant research initiatives: 1) effectively model security requirements and their implementations, and 2) manage keys and key distribution for very large scale deployments such as Smart Meters over a long period of performance. This will set the stage to: 3) develop innovative, low cost methods to protect keying material, and 4) provide high assurance authentication services. We will present our perspective on key management and will discuss some key issues within the life cycle of a cryptographic key designed to achieve the following:more » 1) control systems designed, installed, operated, and maintained to survive an intentional cyber assault with no loss of critical function, and 2) widespread implementation of methods for secure communication between remote access devices and control centers that are scalable and cost-effective to deploy.« less

Method for exponentiating in cryptographic systems

DOEpatents

Brickell, Ernest F.; Gordon, Daniel M.; McCurley, Kevin S.

1994-01-01

An improved cryptographic method utilizing exponentiation is provided which has the advantage of reducing the number of multiplications required to determine the legitimacy of a message or user. The basic method comprises the steps of selecting a key from a preapproved group of integer keys g; exponentiating the key by an integer value e, where e represents a digital signature, to generate a value g.sup.e ; transmitting the value g.sup.e to a remote facility by a communications network; receiving the value g.sup.e at the remote facility; and verifying the digital signature as originating from the legitimate user. The exponentiating step comprises the steps of initializing a plurality of memory locations with a plurality of values g.sup.xi ; computi The United States Government has rights in this invention pursuant to Contract No. DE-AC04-76DP00789 between the Department of Energy and AT&T Company.

Security of subcarrier wave quantum key distribution against the collective beam-splitting attack.

PubMed

Miroshnichenko, G P; Kozubov, A V; Gaidash, A A; Gleim, A V; Horoshko, D B

2018-04-30

We consider a subcarrier wave quantum key distribution (QKD) system, where quantum encoding is carried out at weak sidebands generated around a coherent optical beam as a result of electro-optical phase modulation. We study security of two protocols, B92 and BB84, against one of the most powerful attacks for this class of systems, the collective beam-splitting attack. Our analysis includes the case of high modulation index, where the sidebands are essentially multimode. We demonstrate numerically and experimentally that a subcarrier wave QKD system with realistic parameters is capable of distributing cryptographic keys over large distances in presence of collective attacks. We also show that BB84 protocol modification with discrimination of only one state in each basis performs not worse than the original BB84 protocol in this class of QKD systems, thus significantly simplifying the development of cryptographic networks using the considered QKD technique.

Pseudonyms for cancer registries.

PubMed

Pommerening, K; Miller, M; Schmidtmann, I; Michaelis, J

1996-06-01

In order to conform to the rigid German legislation on data privacy and security we developed a new concept of data flow and data storage for population-based cancer registries. A special trusted office generates a pseudonym for each case by a cryptographic procedure. This office also handles the notification of cases and communicates with the reporting physicians. It passes pseudonymous records to the registration office for permanent storage. The registration office links the records according to the pseudonyms. Starting from a requirements analysis we show how to construct the pseudonyms; we then show that they meet the requirements. We discuss how the pseudonyms have to be protected by cryptographic and organizational means. A pilot study showed that the proposed procedure gives acceptable synonym and homonym error rates. The methods described are not restricted to cancer registration and may serve as a model for comparable applications in medical informatics.

Continuous-variable protocol for oblivious transfer in the noisy-storage model.

PubMed

Furrer, Fabian; Gehring, Tobias; Schaffner, Christian; Pacher, Christoph; Schnabel, Roman; Wehner, Stephanie

2018-04-13

Cryptographic protocols are the backbone of our information society. This includes two-party protocols which offer protection against distrustful players. Such protocols can be built from a basic primitive called oblivious transfer. We present and experimentally demonstrate here a quantum protocol for oblivious transfer for optical continuous-variable systems, and prove its security in the noisy-storage model. This model allows us to establish security by sending more quantum signals than an attacker can reliably store during the protocol. The security proof is based on uncertainty relations which we derive for continuous-variable systems, that differ from the ones used in quantum key distribution. We experimentally demonstrate in a proof-of-principle experiment the proposed oblivious transfer protocol for various channel losses by using entangled two-mode squeezed states measured with balanced homodyne detection. Our work enables the implementation of arbitrary two-party quantum cryptographic protocols with continuous-variable communication systems.

Security analysis of quadratic phase based cryptography

NASA Astrophysics Data System (ADS)

Muniraj, Inbarasan; Guo, Changliang; Malallah, Ra'ed; Healy, John J.; Sheridan, John T.

2016-09-01

The linear canonical transform (LCT) is essential in modeling a coherent light field propagation through first-order optical systems. Recently, a generic optical system, known as a Quadratic Phase Encoding System (QPES), for encrypting a two-dimensional (2D) image has been reported. It has been reported together with two phase keys the individual LCT parameters serve as keys of the cryptosystem. However, it is important that such the encryption systems also satisfies some dynamic security properties. Therefore, in this work, we examine some cryptographic evaluation methods, such as Avalanche Criterion and Bit Independence, which indicates the degree of security of the cryptographic algorithms on QPES. We compare our simulation results with the conventional Fourier and the Fresnel transform based DRPE systems. The results show that the LCT based DRPE has an excellent avalanche and bit independence characteristics than that of using the conventional Fourier and Fresnel based encryption systems.

Quantum cryptographic system with reduced data loss

DOEpatents

Lo, Hoi-Kwong; Chau, Hoi Fung

1998-01-01

A secure method for distributing a random cryptographic key with reduced data loss. Traditional quantum key distribution systems employ similar probabilities for the different communication modes and thus reject at least half of the transmitted data. The invention substantially reduces the amount of discarded data (those that are encoded and decoded in different communication modes e.g. using different operators) in quantum key distribution without compromising security by using significantly different probabilities for the different communication modes. Data is separated into various sets according to the actual operators used in the encoding and decoding process and the error rate for each set is determined individually. The invention increases the key distribution rate of the BB84 key distribution scheme proposed by Bennett and Brassard in 1984. Using the invention, the key distribution rate increases with the number of quantum signals transmitted and can be doubled asymptotically.

Joint Remote State Preparation of a Single-Atom Qubit State via a GHZ Entangled State

NASA Astrophysics Data System (ADS)

Xiao, Xiao-Qi; Yao, Fengwei; Lin, Xiaochen; Gong, Lihua

2018-04-01

We proposed a physical protocol for the joint remote preparation of a single-atom qubit state via a three-atom entangled GHZ-type state previously shared by the two senders and one receiver. Only rotation operations of single-atom, which can be achieved though the resonant interaction between the two-level atom and the classical field, are required in the scheme. It shows that the splitting way of the classical information of the secret qubit not only determines the success of reconstruction of the secret qubit, but also influences the operations of the senders.

Deconstructing The Bomb: Confessions of a Nuclear Archeologist

NASA Astrophysics Data System (ADS)

Coster-Mullen, John

2017-01-01

I am the author of the groundbreaking book Atom Bombs: The Top Secret Inside Story of Little Boy and Fat Man. I will be sharing some of my quarter century of research and methodology that has allowed me to be the first researcher ever to unravel with an unprecedented level of accuracy, the most closely-guarded secrets of the first two Atomic Bombs (``Little Boy'' and ``Fat Man'') created by the Manhattan Project that were used to end WWII. I refer to this methodology as ``Nuclear Archeology'' and will demonstrate that this was done using entirely ``Open Sources'' of information.

Molecular Cloning of Secreted Luciferases from Marine Planktonic Copepods.

PubMed

Takenaka, Yasuhiro; Ikeo, Kazuho; Shigeri, Yasushi

2016-01-01

Secreted luciferases isolated from copepod crustaceans are frequently used for nondisruptive reporter-gene assays, such as the continuous, automated and/or high-throughput monitoring of gene expression in living cells. All known copepod luciferases share highly conserved amino acid residues in two similar, repeated domains in the sequence. The similarity in the domains are ideal nature for designing PCR primers to amplify cDNA fragments of unidentified copepod luciferases from bioluminescent copepod crustaceans. Here, we introduce how to establish a cDNA encoding novel copepod luciferases from a copepod specimen by PCR with degenerated primers.

Evaluating privacy-preserving record linkage using cryptographic long-term keys and multibit trees on large medical datasets.

PubMed

Brown, Adrian P; Borgs, Christian; Randall, Sean M; Schnell, Rainer

2017-06-08

Integrating medical data using databases from different sources by record linkage is a powerful technique increasingly used in medical research. Under many jurisdictions, unique personal identifiers needed for linking the records are unavailable. Since sensitive attributes, such as names, have to be used instead, privacy regulations usually demand encrypting these identifiers. The corresponding set of techniques for privacy-preserving record linkage (PPRL) has received widespread attention. One recent method is based on Bloom filters. Due to superior resilience against cryptographic attacks, composite Bloom filters (cryptographic long-term keys, CLKs) are considered best practice for privacy in PPRL. Real-world performance of these techniques using large-scale data is unknown up to now. Using a large subset of Australian hospital admission data, we tested the performance of an innovative PPRL technique (CLKs using multibit trees) against a gold-standard derived from clear-text probabilistic record linkage. Linkage time and linkage quality (recall, precision and F-measure) were evaluated. Clear text probabilistic linkage resulted in marginally higher precision and recall than CLKs. PPRL required more computing time but 5 million records could still be de-duplicated within one day. However, the PPRL approach required fine tuning of parameters. We argue that increased privacy of PPRL comes with the price of small losses in precision and recall and a large increase in computational burden and setup time. These costs seem to be acceptable in most applied settings, but they have to be considered in the decision to apply PPRL. Further research on the optimal automatic choice of parameters is needed.

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

Number Theory and Public-Key Cryptography.

ERIC Educational Resources Information Center

Lefton, Phyllis

1991-01-01

Described are activities in the study of techniques used to conceal the meanings of messages and data. Some background information and two BASIC programs that illustrate the algorithms used in a new cryptographic system called "public-key cryptography" are included. (CW)

Shannon: Theory and cryptography

NASA Astrophysics Data System (ADS)

Roefs, H. F. A.

1982-11-01

The ideas of Shannon as a theoretical basis for cryptography are discussed. The notion of mutual information is introduced to provide a deeper understanding of the functioning of cryptographic systems. Shannon's absolute secure cryptosystem and his notion of unicity distance are explained.

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

Privacy protection schemes for fingerprint recognition systems

NASA Astrophysics Data System (ADS)

Marasco, Emanuela; Cukic, Bojan

2015-05-01

The deployment of fingerprint recognition systems has always raised concerns related to personal privacy. A fingerprint is permanently associated with an individual and, generally, it cannot be reset if compromised in one application. Given that fingerprints are not a secret, potential misuses besides personal recognition represent privacy threats and may lead to public distrust. Privacy mechanisms control access to personal information and limit the likelihood of intrusions. In this paper, image- and feature-level schemes for privacy protection in fingerprint recognition systems are reviewed. Storing only key features of a biometric signature can reduce the likelihood of biometric data being used for unintended purposes. In biometric cryptosystems and biometric-based key release, the biometric component verifies the identity of the user, while the cryptographic key protects the communication channel. Transformation-based approaches only a transformed version of the original biometric signature is stored. Different applications can use different transforms. Matching is performed in the transformed domain which enable the preservation of low error rates. Since such templates do not reveal information about individuals, they are referred to as cancelable templates. A compromised template can be re-issued using a different transform. At image-level, de-identification schemes can remove identifiers disclosed for objectives unrelated to the original purpose, while permitting other authorized uses of personal information. Fingerprint images can be de-identified by, for example, mixing fingerprints or removing gender signature. In both cases, degradation of matching performance is minimized.

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.

21 CFR 1311.08 - Incorporation by reference.

Code of Federal Regulations, 2010 CFR

2010-04-01

... of Standards and Technology, Computer Security Division, Information Technology Laboratory, National... standards are available from the National Institute of Standards and Technology, Computer Security Division... 140-2, Security Requirements for Cryptographic Modules, May 25, 2001, as amended by Change Notices 2...

Case Study: OpenSSL 2012 Validation

DTIC Science & Technology

2013-08-01

there are probably millions of users who are impacted directly, and hundreds of millions who are indirectly affected. Cryptographic libraries are...UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESSES 8. PERFORMING ORGANIZATION REPORT NUMBER D-4991 H13 -001174 Institute for Defense

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.

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.

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.

New public key cryptosystem based on quaternions

NASA Astrophysics Data System (ADS)

Durcheva, Mariana; Karailiev, Kristian

2017-12-01

Quaternions are not commonly used in cryptography. Nevertheless, the noncommutativity of their multiplication makes them suitable for cryptographic purposes. In this paper we suggest a Diffie-Hellman like cryptosystem based on the the quaternions. Additionally, a computer realization of the protocol is given.

Introducing keytagging, a novel technique for the protection of medical image-based tests.

PubMed

Rubio, Óscar J; Alesanco, Álvaro; García, José

2015-08-01

This paper introduces keytagging, a novel technique to protect medical image-based tests by implementing image authentication, integrity control and location of tampered areas, private captioning with role-based access control, traceability and copyright protection. It relies on the association of tags (binary data strings) to stable, semistable or volatile features of the image, whose access keys (called keytags) depend on both the image and the tag content. Unlike watermarking, this technique can associate information to the most stable features of the image without distortion. Thus, this method preserves the clinical content of the image without the need for assessment, prevents eavesdropping and collusion attacks, and obtains a substantial capacity-robustness tradeoff with simple operations. The evaluation of this technique, involving images of different sizes from various acquisition modalities and image modifications that are typical in the medical context, demonstrates that all the aforementioned security measures can be implemented simultaneously and that the algorithm presents good scalability. In addition to this, keytags can be protected with standard Cryptographic Message Syntax and the keytagging process can be easily combined with JPEG2000 compression since both share the same wavelet transform. This reduces the delays for associating keytags and retrieving the corresponding tags to implement the aforementioned measures to only ≃30 and ≃90ms respectively. As a result, keytags can be seamlessly integrated within DICOM, reducing delays and bandwidth when the image test is updated and shared in secure architectures where different users cooperate, e.g. physicians who interpret the test, clinicians caring for the patient and researchers. Copyright © 2015 Elsevier Inc. All rights reserved.

Protecting genomic data analytics in the cloud: state of the art and opportunities.

PubMed

Tang, Haixu; Jiang, Xiaoqian; Wang, Xiaofeng; Wang, Shuang; Sofia, Heidi; Fox, Dov; Lauter, Kristin; Malin, Bradley; Telenti, Amalio; Xiong, Li; Ohno-Machado, Lucila

2016-10-13

The outsourcing of genomic data into public cloud computing settings raises concerns over privacy and security. Significant advancements in secure computation methods have emerged over the past several years, but such techniques need to be rigorously evaluated for their ability to support the analysis of human genomic data in an efficient and cost-effective manner. With respect to public cloud environments, there are concerns about the inadvertent exposure of human genomic data to unauthorized users. In analyses involving multiple institutions, there is additional concern about data being used beyond agreed research scope and being prcoessed in untrused computational environments, which may not satisfy institutional policies. To systematically investigate these issues, the NIH-funded National Center for Biomedical Computing iDASH (integrating Data for Analysis, 'anonymization' and SHaring) hosted the second Critical Assessment of Data Privacy and Protection competition to assess the capacity of cryptographic technologies for protecting computation over human genomes in the cloud and promoting cross-institutional collaboration. Data scientists were challenged to design and engineer practical algorithms for secure outsourcing of genome computation tasks in working software, whereby analyses are performed only on encrypted data. They were also challenged to develop approaches to enable secure collaboration on data from genomic studies generated by multiple organizations (e.g., medical centers) to jointly compute aggregate statistics without sharing individual-level records. The results of the competition indicated that secure computation techniques can enable comparative analysis of human genomes, but greater efficiency (in terms of compute time and memory utilization) are needed before they are sufficiently practical for real world environments.

Self-adaptive trust based ABR protocol for MANETs using Q-learning.

PubMed

Kumar, Anitha Vijaya; Jeyapal, Akilandeswari

2014-01-01

Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed. Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques, Q-learning achieves optimal results. Our work focuses on computing a score using Q-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show that Q-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation.

Self-Adaptive Trust Based ABR Protocol for MANETs Using Q-Learning

PubMed Central

Jeyapal, Akilandeswari

2014-01-01

Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed. Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques, Q-learning achieves optimal results. Our work focuses on computing a score using Q-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show that Q-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation. PMID:25254243

Autonomous Byte Stream Randomizer

NASA Technical Reports Server (NTRS)

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

2013-01-01

Net-centric networking environments are often faced with limited resources and must utilize bandwidth as efficiently as possible. In networking environments that span wide areas, the data transmission has to be efficient without any redundant or exuberant metadata. The Autonomous Byte Stream Randomizer software provides an extra level of security on top of existing data encryption methods. Randomizing the data s byte stream adds an extra layer to existing data protection methods, thus making it harder for an attacker to decrypt protected data. Based on a generated crypto-graphically secure random seed, a random sequence of numbers is used to intelligently and efficiently swap the organization of bytes in data using the unbiased and memory-efficient in-place Fisher-Yates shuffle method. Swapping bytes and reorganizing the crucial structure of the byte data renders the data file unreadable and leaves the data in a deconstructed state. This deconstruction adds an extra level of security requiring the byte stream to be reconstructed with the random seed in order to be readable. Once the data byte stream has been randomized, the software enables the data to be distributed to N nodes in an environment. Each piece of the data in randomized and distributed form is a separate entity unreadable on its own right, but when combined with all N pieces, is able to be reconstructed back to one. Reconstruction requires possession of the key used for randomizing the bytes, leading to the generation of the same cryptographically secure random sequence of numbers used to randomize the data. This software is a cornerstone capability possessing the ability to generate the same cryptographically secure sequence on different machines and time intervals, thus allowing this software to be used more heavily in net-centric environments where data transfer bandwidth is limited.

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

Security in Wireless Sensor Networks Employing MACGSP6

ERIC Educational Resources Information Center

Nitipaichit, Yuttasart

2010-01-01

Wireless Sensor Networks (WSNs) have unique characteristics which constrain them; including small energy stores, limited computation, and short range communication capability. Most traditional security algorithms use cryptographic primitives such as Public-key cryptography and are not optimized for energy usage. Employing these algorithms for the…

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

Draelos, Timothy John; Dautenhahn, Nathan; Schroeppel, Richard Crabtree

The security of the widely-used cryptographic hash function SHA1 has been impugned. We have developed two replacement hash functions. The first, SHA1X, is a drop-in replacement for SHA1. The second, SANDstorm, has been submitted as a candidate to the NIST-sponsored SHA3 Hash Function competition.

76 FR 11433 - Federal Transition To Secure Hash Algorithm (SHA)-256

Federal Register 2010, 2011, 2012, 2013, 2014

2011-03-02

... generating digital signatures. Current information systems, Web servers, applications and workstation operating systems were designed to process, and use SHA-1 generated signatures. National Institute of... cryptographic keys, and more robust algorithms by December 2013. Government systems may begin to encounter...

A Multi-Threaded Cryptographic Pseudorandom Number Generator Test Suite

DTIC Science & Technology

2016-09-01

bitcoin thieves, Google releases patch. (2013, Aug. 16). SiliconANGLE. [Online]. Available: http://siliconangle.com/blog/2013/ 08/16/android-crypto-prng...flaw-aided- bitcoin -thieves-google-releases-patch/ [5] M. Gondree. (2014, Sep. 28). NPS POSIX thread pool library. [Online]. Available: https

48 CFR 352.239-71 - Standard for encryption language.

Code of Federal Regulations, 2011 CFR

2011-10-01

... language. 352.239-71 Section 352.239-71 Federal Acquisition Regulations System HEALTH AND HUMAN SERVICES... Information Processing Standard (FIPS) 140-2-compliant encryption (Security Requirements for Cryptographic Module, as amended) to protect all instances of HHS sensitive information during storage and transmission...

48 CFR 352.239-71 - Standard for encryption language.

Code of Federal Regulations, 2013 CFR

2013-10-01

... product has been validated under the Cryptographic Module Validation Program (see http://csrc.nist.gov... of the validation documentation to the Contracting Officer and the Contracting Officer's Technical... computers, desktop computers, and other mobile devices and portable media that store or process sensitive...

48 CFR 352.239-71 - Standard for encryption language.

Code of Federal Regulations, 2012 CFR

2012-10-01

... product has been validated under the Cryptographic Module Validation Program (see http://csrc.nist.gov... of the validation documentation to the Contracting Officer and the Contracting Officer's Technical... computers, desktop computers, and other mobile devices and portable media that store or process sensitive...

48 CFR 352.239-71 - Standard for encryption language.

Code of Federal Regulations, 2014 CFR

2014-10-01

... product has been validated under the Cryptographic Module Validation Program (see http://csrc.nist.gov... of the validation documentation to the Contracting Officer and the Contracting Officer's Technical... computers, desktop computers, and other mobile devices and portable media that store or process sensitive...

An effective biometric discretization approach to extract highly discriminative, informative, and privacy-protective binary representation

NASA Astrophysics Data System (ADS)

Lim, Meng-Hui; Teoh, Andrew Beng Jin

2011-12-01

Biometric discretization derives a binary string for each user based on an ordered set of biometric features. This representative string ought to be discriminative, informative, and privacy protective when it is employed as a cryptographic key in various security applications upon error correction. However, it is commonly believed that satisfying the first and the second criteria simultaneously is not feasible, and a tradeoff between them is always definite. In this article, we propose an effective fixed bit allocation-based discretization approach which involves discriminative feature extraction, discriminative feature selection, unsupervised quantization (quantization that does not utilize class information), and linearly separable subcode (LSSC)-based encoding to fulfill all the ideal properties of a binary representation extracted for cryptographic applications. In addition, we examine a number of discriminative feature-selection measures for discretization and identify the proper way of setting an important feature-selection parameter. Encouraging experimental results vindicate the feasibility of our approach.

Too good to be true: when overwhelming evidence fails to convince.

PubMed

Gunn, Lachlan J; Chapeau-Blondeau, François; McDonnell, Mark D; Davis, Bruce R; Allison, Andrew; Abbott, Derek

2016-03-01

Is it possible for a large sequence of measurements or observations, which support a hypothesis, to counterintuitively decrease our confidence? Can unanimous support be too good to be true? The assumption of independence is often made in good faith; however, rarely is consideration given to whether a systemic failure has occurred. Taking this into account can cause certainty in a hypothesis to decrease as the evidence for it becomes apparently stronger. We perform a probabilistic Bayesian analysis of this effect with examples based on (i) archaeological evidence, (ii) weighing of legal evidence and (iii) cryptographic primality testing. In this paper, we investigate the effects of small error rates in a set of measurements or observations. We find that even with very low systemic failure rates, high confidence is surprisingly difficult to achieve; in particular, we find that certain analyses of cryptographically important numerical tests are highly optimistic, underestimating their false-negative rate by as much as a factor of 2 80 .

Geometric Data Perturbation-Based Personal Health Record Transactions in Cloud Computing

PubMed Central

Balasubramaniam, S.; Kavitha, V.

2015-01-01

Cloud computing is a new delivery model for information technology services and it typically involves the provision of dynamically scalable and often virtualized resources over the Internet. However, cloud computing raises concerns on how cloud service providers, user organizations, and governments should handle such information and interactions. Personal health records represent an emerging patient-centric model for health information exchange, and they are outsourced for storage by third parties, such as cloud providers. With these records, it is necessary for each patient to encrypt their own personal health data before uploading them to cloud servers. Current techniques for encryption primarily rely on conventional cryptographic approaches. However, key management issues remain largely unsolved with these cryptographic-based encryption techniques. We propose that personal health record transactions be managed using geometric data perturbation in cloud computing. In our proposed scheme, the personal health record database is perturbed using geometric data perturbation and outsourced to the Amazon EC2 cloud. PMID:25767826

Geometric data perturbation-based personal health record transactions in cloud computing.

PubMed

Balasubramaniam, S; Kavitha, V

2015-01-01

Cloud computing is a new delivery model for information technology services and it typically involves the provision of dynamically scalable and often virtualized resources over the Internet. However, cloud computing raises concerns on how cloud service providers, user organizations, and governments should handle such information and interactions. Personal health records represent an emerging patient-centric model for health information exchange, and they are outsourced for storage by third parties, such as cloud providers. With these records, it is necessary for each patient to encrypt their own personal health data before uploading them to cloud servers. Current techniques for encryption primarily rely on conventional cryptographic approaches. However, key management issues remain largely unsolved with these cryptographic-based encryption techniques. We propose that personal health record transactions be managed using geometric data perturbation in cloud computing. In our proposed scheme, the personal health record database is perturbed using geometric data perturbation and outsourced to the Amazon EC2 cloud.

Provably Secure Heterogeneous Access Control Scheme for Wireless Body Area Network.

PubMed

Omala, Anyembe Andrew; Mbandu, Angolo Shem; Mutiria, Kamenyi Domenic; Jin, Chunhua; Li, Fagen

2018-04-28

Wireless body area network (WBAN) provides a medium through which physiological information could be harvested and transmitted to application provider (AP) in real time. Integrating WBAN in a heterogeneous Internet of Things (IoT) ecosystem would enable an AP to monitor patients from anywhere and at anytime. However, the IoT roadmap of interconnected 'Things' is still faced with many challenges. One of the challenges in healthcare is security and privacy of streamed medical data from heterogeneously networked devices. In this paper, we first propose a heterogeneous signcryption scheme where a sender is in a certificateless cryptographic (CLC) environment while a receiver is in identity-based cryptographic (IBC) environment. We then use this scheme to design a heterogeneous access control protocol. Formal security proof for indistinguishability against adaptive chosen ciphertext attack and unforgeability against adaptive chosen message attack in random oracle model is presented. In comparison with some of the existing access control schemes, our scheme has lower computation and communication cost.

Semi-quantum Secure Direct Communication Scheme Based on Bell States

NASA Astrophysics Data System (ADS)

Xie, Chen; Li, Lvzhou; Situ, Haozhen; He, Jianhao

2018-06-01

Recently, the idea of semi-quantumness has been often used in designing quantum cryptographic schemes, which allows some of the participants of a quantum cryptographic scheme to remain classical. One of the reasons why this idea is popular is that it allows a quantum information processing task to be accomplished by using quantum resources as few as possible. In this paper, we extend the idea to quantum secure direct communication(QSDC) by proposing a semi-quantum secure direct communication scheme. In the scheme, the message sender, Alice, encodes each bit into a Bell state |φ+> = 1/{√2}(|00> +|11> ) or |{Ψ }+> = 1/{√ 2}(|01> +|10> ), and the message receiver, Bob, who is classical in the sense that he can either let the qubit he received reflect undisturbed, or measure the qubit in the computational basis |0>, |1> and then resend it in the state he found. Moreover, the security analysis of our scheme is also given.

A Survey of Noninteractive Zero Knowledge Proof System and Its Applications

PubMed Central

Wu, Huixin; Wang, Feng

2014-01-01

Zero knowledge proof system which has received extensive attention since it was proposed is an important branch of cryptography and computational complexity theory. Thereinto, noninteractive zero knowledge proof system contains only one message sent by the prover to the verifier. It is widely used in the construction of various types of cryptographic protocols and cryptographic algorithms because of its good privacy, authentication, and lower interactive complexity. This paper reviews and analyzes the basic principles of noninteractive zero knowledge proof system, and summarizes the research progress achieved by noninteractive zero knowledge proof system on the following aspects: the definition and related models of noninteractive zero knowledge proof system, noninteractive zero knowledge proof system of NP problems, noninteractive statistical and perfect zero knowledge, the connection between noninteractive zero knowledge proof system, interactive zero knowledge proof system, and zap, and the specific applications of noninteractive zero knowledge proof system. This paper also points out the future research directions. PMID:24883407

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.

User Authentication and Authorization Challenges in a Networked Library Environment.

ERIC Educational Resources Information Center

Machovec, George S.

1997-01-01

Discusses computer user authentication and authorization issues when libraries need to let valid users access databases and information services without making the process too difficult for either party. Common solutions are explained, including filtering, passwords, and kerberos (cryptographic authentication scheme for secure use over public…

Reduced insulin secretion and glucose intolerance are involved in the fasting susceptibility of common vampire bats.

PubMed

Freitas, Mariella B; Queiroz, Joicy F; Dias Gomes, Carolinne I; Collares-Buzato, Carla B; Barbosa, Helena C; Boschero, Antonio C; Gonçalves, Carlos A; Pinheiro, Eliana C

2013-03-01

Susceptibility during fasting has been reported for the common vampire bat (Desmodus rotundus), to the point of untimely deaths after only 2-3 nights of fasting. To investigate the underlying physiology of this critical metabolic condition, we analyzed serum insulin levels, pancreatic islets morphometry and immunocytochemistry (ICC), static insulin secretion in pancreas fragments, and insulin signaling mechanism in male vampire bats. A glucose tolerance test (ipGTT) was also performed. Serum insulin was found to be lower in fed vampires compared to other mammals, and was significantly reduced after 24h fasting. Morphometrical analyses revealed small irregular pancreatic islets with reduced percentage of β-cell mass compared to other bats. Static insulin secretion analysis showed that glucose-stimulated insulin secretion was impaired, as insulin levels did not reach significance under high glucose concentrations, whereas the response to the amino acid leucin was preserved. Results from ipGTT showed a failure on glucose clearance, indicating glucose intolerance due to diminished pancreatic insulin secretion and/or decreased β-cell response to glucose. In conclusion, data presented here indicate lower insulinemia and impaired insulin secretion in D. rotundus, which is consistent with the limited ability to store body energy reserves, previously reported in these animals. Whether these metabolic and hormonal features are associated with their blood diet remains to be determined. The peculiar food sharing through blood regurgitation, reported to this species, might be an adaptive mechanism overcoming this metabolic susceptibility. Copyright © 2012 Elsevier Inc. All rights reserved.

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.

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

PubMed Central

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

2012-01-01

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

Awakening Brilliance in the Writer's Workshop: Using Notebooks, Mentor Texts, and the Writing Process

ERIC Educational Resources Information Center

Morris, Lisa

2012-01-01

Master teacher Lisa Morris invites you to share her secrets of success with writer's workshops. After years of experimenting with the workshop model, she has developed the most effective ways to apply it in the classroom, yielding higher test scores and increased student engagement. Through practical, step-by-step instruction, Morris demonstrates…

Notes from the Delivery Room

ERIC Educational Resources Information Center

Wasburn-Moses, Leah

2009-01-01

In this article, the author offers some success secrets of the stars for fitting into one's research again after the baby. The author has some experience to share, having had her first child as a high school teacher, her second as an ABD (all-but-dissertation) graduate student, and now her third as an assistant professor at a research-intensive…

The Rosenberg Trial: Uncovering the Layers of History

ERIC Educational Resources Information Center

Ragsdale, Bruce A.

2013-01-01

The trial of Julius and Ethel Rosenberg on charges of conspiring to spy for the Soviet Union remains one of the defining moments of the Cold War era. The dramatic allegations of stolen atomic secrets and networks of Communist spies riveted the public's attention. The determination of government prosecutors reflected a widely shared belief that the…

Co-evolution of chitinases from maize and other cereals with secreted proteases from Pleosporineae fungi

USDA-ARS?s Scientific Manuscript database

Plant class IV chitinases are composed of a carboxy-terminal chitinase domain that is attached, through a linker sequence, to a small amino-terminal domain that can be thought of as a structured peptide. While both the peptide-like domain and the chitinase domain share sequence homology throughout m...

Probability Distributions over Cryptographic Protocols

DTIC Science & Technology

2009-06-01

Artificial Immune Algorithm . . . . . . . . . . . . . . . . . . . 9 3 Design Decisions 11 3.1 Common Ground...creation algorithm for unbounded distribution . . . . . . . 24 4.2 Message creation algorithm for unbounded naive distribution . . . . 24 4.3 Protocol...creation algorithm for intended-run distributions . . . . . . 26 4.4 Protocol and message creation algorithm for realistic distribution . . 32 ix THIS

22 CFR 124.14 - Exports to warehouses or distribution points outside the United States.

Code of Federal Regulations, 2010 CFR

2010-04-01

... distribution, end-use and reporting. Licenses for exports pursuant to such agreements must be obtained prior to... country, either in their original form or after being incorporated through an intermediate process into...., sporting firearms for commercial resale, cryptographic devices and software for financial and business...

Cryptographic Research and NSA: Report of the Public Cryptography Study Group.

ERIC Educational Resources Information Center

Davida, George I.

1981-01-01

The Public Cryptography Study Group accepted the claim made by the National Security Agency that some information in some publications concerning cryptology could be inimical to national security, and is allowing the establishment of a voluntary mechanism, on an experimental basis, for NSA to review cryptology manuscripts. (MLW)

Security Protocol Verification and Optimization by Epistemic Model Checking

DTIC Science & Technology

2010-11-05

Three cryptographers are sitting down to dinner at their favourite restau- rant. Their waiter informs them that arrangements have been made with the...Unfortunately, the protocol cannot be expected to satisfy this: suppose that all agents manage to broadcast their mes- sage and all messages have the

Parallel Processable Cryptographic Methods with Unbounded Practical Security.

ERIC Educational Resources Information Center

Rothstein, Jerome

Addressing the problem of protecting confidential information and data stored in computer databases from access by unauthorized parties, this paper details coding schemes which present such astronomical work factors to potential code breakers that security breaches are hopeless in any practical sense. Two procedures which can be used to encode for…

49 CFR 236.1033 - Communications and security requirements.

Code of Federal Regulations, 2011 CFR

2011-10-01

... shall: (1) Use an algorithm approved by the National Institute of Standards (NIST) or a similarly...; or (ii) When the key algorithm reaches its lifespan as defined by the standards body responsible for approval of the algorithm. (c) The cleartext form of the cryptographic keys shall be protected from...

49 CFR 236.1033 - Communications and security requirements.

Code of Federal Regulations, 2014 CFR

2014-10-01

... shall: (1) Use an algorithm approved by the National Institute of Standards (NIST) or a similarly...; or (ii) When the key algorithm reaches its lifespan as defined by the standards body responsible for approval of the algorithm. (c) The cleartext form of the cryptographic keys shall be protected from...

49 CFR 236.1033 - Communications and security requirements.

Code of Federal Regulations, 2013 CFR

2013-10-01

... shall: (1) Use an algorithm approved by the National Institute of Standards (NIST) or a similarly...; or (ii) When the key algorithm reaches its lifespan as defined by the standards body responsible for approval of the algorithm. (c) The cleartext form of the cryptographic keys shall be protected from...

49 CFR 236.1033 - Communications and security requirements.

Code of Federal Regulations, 2012 CFR

2012-10-01

... shall: (1) Use an algorithm approved by the National Institute of Standards (NIST) or a similarly...; or (ii) When the key algorithm reaches its lifespan as defined by the standards body responsible for approval of the algorithm. (c) The cleartext form of the cryptographic keys shall be protected from...

Exploitation of Unintentional Information Leakage from Integrated Circuits

ERIC Educational Resources Information Center

Cobb, William E.

2011-01-01

The information leakage of electronic devices, especially those used in cryptographic or other vital applications, represents a serious practical threat to secure systems. While physical implementation attacks have evolved rapidly over the last decade, relatively little work has been done to allow system designers to effectively counter the…

49 CFR 236.1033 - Communications and security requirements.

Code of Federal Regulations, 2010 CFR

2010-10-01

... shall: (1) Use an algorithm approved by the National Institute of Standards (NIST) or a similarly...; or (ii) When the key algorithm reaches its lifespan as defined by the standards body responsible for approval of the algorithm. (c) The cleartext form of the cryptographic keys shall be protected from...

21 CFR 1311.08 - Incorporation by reference.

Code of Federal Regulations, 2014 CFR

2014-04-01

... the National Institute of Standards and Technology, Computer Security Division, Information Technology... Publication (FIPS PUB) 140-2, Change Notices (12-03-2002), Security Requirements for Cryptographic Modules... §§ 1311.30(b), 1311.55(b), 1311.115(b), 1311.120(b), 1311.205(b). (i) Annex A: Approved Security Functions...

Cryptographic Properties of the Hidden Weighted Bit Function

DTIC Science & Technology

2013-12-23

valid OMB control number. 1. REPORT DATE 23 DEC 2013 2. REPORT TYPE 3. DATES COVERED 00-00-2013 to 00-00-2013 4. TITLE AND SUBTITLE...K. Feng, An Infinite Class of Balanced Vectorial Boolean Functions with Optimum Algebraic Immunity and Good Nonlinearity, in: IWCC 2009, In: LNCS

Genetic Architecture Promotes the Evolution and Maintenance of Cooperation

PubMed Central

Frénoy, Antoine; Taddei, François; Misevic, Dusan

2013-01-01

When cooperation has a direct cost and an indirect benefit, a selfish behavior is more likely to be selected for than an altruistic one. Kin and group selection do provide evolutionary explanations for the stability of cooperation in nature, but we still lack the full understanding of the genomic mechanisms that can prevent cheater invasion. In our study we used Aevol, an agent-based, in silico genomic platform to evolve populations of digital organisms that compete, reproduce, and cooperate by secreting a public good for tens of thousands of generations. We found that cooperating individuals may share a phenotype, defined as the amount of public good produced, but have very different abilities to resist cheater invasion. To understand the underlying genetic differences between cooperator types, we performed bio-inspired genomics analyses of our digital organisms by recording and comparing the locations of metabolic and secretion genes, as well as the relevant promoters and terminators. Association between metabolic and secretion genes (promoter sharing, overlap via frame shift or sense-antisense encoding) was characteristic for populations with robust cooperation and was more likely to evolve when secretion was costly. In mutational analysis experiments, we demonstrated the potential evolutionary consequences of the genetic association by performing a large number of mutations and measuring their phenotypic and fitness effects. The non-cooperating mutants arising from the individuals with genetic association were more likely to have metabolic deleterious mutations that eventually lead to selection eliminating such mutants from the population due to the accompanying fitness decrease. Effectively, cooperation evolved to be protected and robust to mutations through entangled genetic architecture. Our results confirm the importance of second-order selection on evolutionary outcomes, uncover an important genetic mechanism for the evolution and maintenance of cooperation, and suggest promising methods for preventing gene loss in synthetically engineered organisms. PMID:24278000

Suppression of allo-human leucocyte antigen (HLA) antibodies secreted by B memory cells in vitro: intravenous immunoglobulin (IVIg) versus a monoclonal anti-HLA-E IgG that mimics HLA-I reactivities of IVIg.

PubMed

Zhu, D; Ravindranath, M H; Terasaki, P I; Miyazaki, T; Pham, T; Jucaud, V

2014-08-01

B memory cells remain in circulation and secrete alloantibodies without antigen exposure > 20 years after alloimmunization postpartum or by transplantation. These long-lived B cells are resistant to cytostatic drugs. Therapeutically, intravenous immunoglobulin (IVIg) is administered to reduce allo-human leucocyte antigen (HLA) antibodies pre- and post-transplantation, but the mechanism of reduction remains unclear. Recently, we reported that IVIg reacts with several HLA-I alleles and the HLA reactivity of IVIg is lost after its HLA-E reactivity is adsorbed out. Therefore, we have generated an anti-HLA-E monoclonal antibody that mimics the HLA-reactivity of IVIg to investigate whether this antibody suppresses IgG secretion, as does IVIg. B cells were purified from the blood of a woman in whose blood the B memory cells remained without antigen exposure > 20 years after postpartum alloimmunization. The B cells were stimulated with cytokines using a well-defined culture system. The anti-HLA-E monoclonal antibody (mAb) significantly suppressed the allo-HLA class-II IgG produced by the B cells, and that this suppression was far superior to that by IVIg. These findings were confirmed with HLA-I antibody secreted by the immortalized B cell line, developed from the blood of another alloimmunized woman. The binding affinity of the anti-HLA-E mAb for peptide sequences shared (i.e. shared epitopes) between HLA-E and other β2-microglobulin-free HLA heavy chains (open conformers) on the cell surface of B cells may act as a ligand and signal suppression of IgG production of activated B memory cells. We propose that anti-HLA-E monoclonal antibody may also be useful to suppress allo-HLA IgG production in vivo. © 2014 British Society for Immunology.

The Vector-Ballot Approach for Online Voting Procedures

NASA Astrophysics Data System (ADS)

Kiayias, Aggelos; Yung, Moti

Looking at current cryptographic-based e-voting protocols, one can distinguish three basic design paradigms (or approaches): (a) Mix-Networks based, (b) Homomorphic Encryption based, and (c) Blind Signatures based. Each of the three possesses different advantages and disadvantages w.r.t. the basic properties of (i) efficient tallying, (ii) universal verifiability, and (iii) allowing write-in ballot capability (in addition to predetermined candidates). In fact, none of the approaches results in a scheme that simultaneously achieves all three. This is unfortunate, since the three basic properties are crucial for efficiency, integrity and versatility (flexibility), respectively. Further, one can argue that a serious business offering of voting technology should offer a flexible technology that achieves various election goals with a single user interface. This motivates our goal, which is to suggest a new "vector-ballot" based approach for secret-ballot e-voting that is based on three new notions: Provably Consistent Vector Ballot Encodings, Shrink-and-Mix Networks and Punch-Hole-Vector-Ballots. At the heart of our approach is the combination of mix networks and homomorphic encryption under a single user interface; given this, it is rather surprising that it achieves much more than any of the previous approaches for e-voting achieved in terms of the basic properties. Our approach is presented in two generic designs called "homomorphic vector-ballots with write-in votes" and "multi-candidate punch-hole vector-ballots"; both of our designs can be instantiated over any homomorphic encryption function.

Watermarking protocols for authentication and ownership protection based on timestamps and holograms

NASA Astrophysics Data System (ADS)

Dittmann, Jana; Steinebach, Martin; Croce Ferri, Lucilla

2002-04-01

Digital watermarking has become an accepted technology for enabling multimedia protection schemes. One problem here is the security of these schemes. Without a suitable framework, watermarks can be replaced and manipulated. We discuss different protocols providing security against rightful ownership attacks and other fraud attempts. We compare the characteristics of existing protocols for different media like direct embedding or seed based and required attributes of the watermarking technology like robustness or payload. We introduce two new media independent protocol schemes for rightful ownership authentication. With the first scheme we ensure security of digital watermarks used for ownership protection with a combination of two watermarks: first watermark of the copyright holder and a second watermark from a Trusted Third Party (TTP). It is based on hologram embedding and the watermark consists of e.g. a company logo. As an example we use digital images and specify the properties of the embedded additional security information. We identify components necessary for the security protocol like timestamp, PKI and cryptographic algorithms. The second scheme is used for authentication. It is designed for invertible watermarking applications which require high data integrity. We combine digital signature schemes and digital watermarking to provide a public verifiable integrity. The original data can only be reproduced with a secret key. Both approaches provide solutions for copyright and authentication watermarking and are introduced for image data but can be easily adopted for video and audio data as well.

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

PubMed

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

2016-03-01

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

Secrets and disclosure in donor conception.

PubMed

Frith, Lucy; Blyth, Eric; Crawshaw, Marilyn; van den Akker, Olga

2018-01-01

This article considers the disclosure, sharing and exchange of information on being donor conceived within families, drawing on data from a study undertaken with donor-conceived adults registered with UK Donor Link (a voluntary DNA-linking register). This paper considers the narratives of how respondents found out they were donor-conceived and what events triggered disclosure of this information. This paper then goes on to examine the role secrecy played in their family life and uses the concept of 'display' to explore how secrecy affected their relationships with their immediate and extended family. Secrets are notoriously 'leaky' and we found complex patterns of knowing and uncertainty about whom in the family knew that the person was donor-conceived. We argue that what is kept secret and from whom provides insights into the multifaceted web of social relationships that can be created by donor-conception, and how knowledge can be managed and controlled in attempts to display and maintain family narratives of biogenetic connection. © 2017 Foundation for the Sociology of Health & Illness.

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

Profiling Synaptic Proteins Identifies Regulators of Insulin Secretion and Lifespan

PubMed Central

Kaplan, Joshua M.

2008-01-01

Cells are organized into distinct compartments to perform specific tasks with spatial precision. In neurons, presynaptic specializations are biochemically complex subcellular structures dedicated to neurotransmitter secretion. Activity-dependent changes in the abundance of presynaptic proteins are thought to endow synapses with different functional states; however, relatively little is known about the rules that govern changes in the composition of presynaptic terminals. We describe a genetic strategy to systematically analyze protein localization at Caenorhabditis elegans presynaptic specializations. Nine presynaptic proteins were GFP-tagged, allowing visualization of multiple presynaptic structures. Changes in the distribution and abundance of these proteins were quantified in 25 mutants that alter different aspects of neurotransmission. Global analysis of these data identified novel relationships between particular presynaptic components and provides a new method to compare gene functions by identifying shared protein localization phenotypes. Using this strategy, we identified several genes that regulate secretion of insulin-like growth factors (IGFs) and influence lifespan in a manner dependent on insulin/IGF signaling. PMID:19043554

It is the “starting over” part that is so hard

PubMed Central

Washington, Karla; Oliver, Debra Parker; Shaunfield, Sara; Gage, L. Ashley; Mooney, Megan; Lewis, Alexandria

2013-01-01

Although hospices are required to provide caregivers with formal bereavement support when their loved one passes, most bereavement interventions lack standardization and remain untested. The Dual Processing Model of Bereavement was used as a theoretical framework for assessing the potential of a Secret Facebook Group for bereaved hospice caregivers. Online communication was analyzed and reported outcome measures were compared pre and post intervention. Bereaved caregivers shared abrupt and anticipated triggers resulting in loss-orientation and shared restoration through storytelling, advising, and encouragement. Caregiver anxiety and depression were lower post intervention. This study highlights the promise of Facebook for hospice bereavement support. PMID:24559689

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

PubMed

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

2016-09-20

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

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.

HIE sustainability secrets. NeHC report shares HIE success stories of alternate revenue streams and payer buy-in.

PubMed

Prestigiacomo, Jennifer

2011-11-01

Getting effective stakeholder engagement, including that of payers, and creating innovative value-added services that provide alternate revenue streams beyond basic subscription services, are just a couple of the common traits of the flourishing health information exchanges profiled in the sustainability report released in August by the National eHealth Collaborative.

A strategic plan for forest research and development in the south

Treesearch

Richard A. Harper; Cassandra Johnson; H. Michael Rauscher; Carol Whitlock

2007-01-01

In many ways, the southern region of the United States is our nation's best kept secret. Although each is unique, the 13 southern States from Virginia to Texas share several important attributes: long growing seasons and plentiful water, close-knit communities with strong ties to the land, terrains ranging from lush wetlands to rolling hills to sheltering...

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.

Shared Genetic Control of Brain Activity During Sleep and Insulin Secretion: A Laboratory-Based Family Study.

PubMed

Morselli, Lisa L; Gamazon, Eric R; Tasali, Esra; Cox, Nancy J; Van Cauter, Eve; Davis, Lea K

2018-01-01

Over the past 20 years, a large body of experimental and epidemiologic evidence has linked sleep duration and quality to glucose homeostasis, although the mechanistic pathways remain unclear. The aim of the current study was to determine whether genetic variation influencing both sleep and glucose regulation could underlie their functional relationship. We hypothesized that the genetic regulation of electroencephalographic (EEG) activity during non-rapid eye movement sleep, a highly heritable trait with fingerprint reproducibility, is correlated with the genetic control of metabolic traits including insulin sensitivity and β-cell function. We tested our hypotheses through univariate and bivariate heritability analyses in a three-generation pedigree with in-depth phenotyping of both sleep EEG and metabolic traits in 48 family members. Our analyses accounted for age, sex, adiposity, and the use of psychoactive medications. In univariate analyses, we found significant heritability for measures of fasting insulin sensitivity and β-cell function, for time spent in slow-wave sleep, and for EEG spectral power in the delta, theta, and sigma ranges. Bivariate heritability analyses provided the first evidence for a shared genetic control of brain activity during deep sleep and fasting insulin secretion rate. © 2017 by the American Diabetes Association.

Quantum-secret-sharing scheme based on local distinguishability of orthogonal multiqudit entangled states

NASA Astrophysics Data System (ADS)

Wang, Jingtao; Li, Lixiang; Peng, Haipeng; Yang, Yixian

2017-02-01

In this study, we propose the concept of judgment space to investigate the quantum-secret-sharing scheme based on local distinguishability (called LOCC-QSS). Because of the proposing of this conception, the property of orthogonal mutiqudit entangled states under restricted local operation and classical communication (LOCC) can be described more clearly. According to these properties, we reveal that, in the previous (k ,n )-threshold LOCC-QSS scheme, there are two required conditions for the selected quantum states to resist the unambiguous attack: (i) their k -level judgment spaces are orthogonal, and (ii) their (k -1 )-level judgment spaces are equal. Practically, if k

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

PubMed Central

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

2011-01-01

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

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

PubMed

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

2011-12-01

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

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

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

Software and Critical Technology Protection Against Side-Channel Analysis Through Dynamic Hardware Obfuscation

DTIC Science & Technology

2011-03-01

resampling a second time . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82 70 Plot of RSA bitgroup exponentiation with DAILMOM after a...14 DVFS Dynamic Voltage and Frequency Switching . . . . . . . . . . . . . . . . . . . 14 MDPL Masked Dual-Rail...algorithms to prevent whole-sale discovery of PINs and other simple methods to prevent employee tampering [5]. In time , cryptographic systems have

Occupational Field 66 (Avionics) Less MOS’s 6682, 6683 and 6689 Task Analysis.

DTIC Science & Technology

1979-04-01

EQUIPMENT ( SACE ) TECH 011 ACFT CRYPTOGRAPHIC SYS TECI-, IMA 018 ACFT INERTIAL NAVIGATION SYSTEM (INS) SACE TECH 019 ACFT SEARCH/TRACK (SIT) SACE TECH...020 SACE SYS TECH 021 ACFT DECEPTIVE ELECTRONIC COUNTERMEASURES IDECM) TECH 022 ELECTRONIC COUNTERMEASURES (ECM) MODULE REPAIR TECH 023 ACFT ECM TECH

Fundamental problems in provable security and cryptography.

PubMed

Dent, Alexander W

2006-12-15

This paper examines methods for formally proving the security of cryptographic schemes. We show that, despite many years of active research and dozens of significant results, there are fundamental problems which have yet to be solved. We also present a new approach to one of the more controversial aspects of provable security, the random oracle model.

Improved Algorithm For Finite-Field Normal-Basis Multipliers

NASA Technical Reports Server (NTRS)

Wang, C. C.

1989-01-01

Improved algorithm reduces complexity of calculations that must precede design of Massey-Omura finite-field normal-basis multipliers, used in error-correcting-code equipment and cryptographic devices. Algorithm represents an extension of development reported in "Algorithm To Design Finite-Field Normal-Basis Multipliers" (NPO-17109), NASA Tech Briefs, Vol. 12, No. 5, page 82.

The Zimmermann Telegram. Teaching with Documents.

ERIC Educational Resources Information Center

National Archives and Records Administration, Washington, DC.

Between 1914 and the spring of 1917, Europe engaged in the conflict known as World War I. The United States remained neutral. In January of 1917, British cryptographers deciphered a telegram from German Foreign Minister Arthur Zimmerman to the German Minister to Mexico, Heinrich J. F. von Eckhardt, offering U.S. territory to Mexico in return for…

Quantum cryptography with 3-state systems.

PubMed

Bechmann-Pasquinucci, H; Peres, A

2000-10-09

We consider quantum cryptographic schemes where the carriers of information are 3-state particles. One protocol uses four mutually unbiased bases and appears to provide better security than obtainable with 2-state carriers. Another possible method allows quantum states to belong to more than one basis. Security is not better, but many curious features arise.

Applying Trustworthy Computing to End-to-End Electronic Voting

ERIC Educational Resources Information Center

Fink, Russell A.

2010-01-01

"End-to-End (E2E)" voting systems provide cryptographic proof that the voter's intention is captured, cast, and tallied correctly. While E2E systems guarantee integrity independent of software, most E2E systems rely on software to provide confidentiality, availability, authentication, and access control; thus, end-to-end integrity is not…

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

Jason L. Wright

Finding and identifying Cryptography is a growing concern in the malware analysis community. In this paper, a heuristic method for determining the likelihood that a given function contains a cryptographic algorithm is discussed and the results of applying this method in various environments is shown. The algorithm is based on frequency analysis of opcodes that make up each function within a binary.

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

Hamlet, Jason; Pierson, Lyndon; Bauer, Todd

Supply chain security to detect, deter, and prevent the counterfeiting of networked and stand-alone integrated circuits (ICs) is critical to cyber security. Sandia National Laboratory researchers have developed IC ID to leverage Physically Unclonable Functions (PUFs) and strong cryptographic authentication to create a unique fingerprint for each integrated circuit. IC ID assures the authenticity of ICs to prevent tampering or malicious substitution.

Concatenations of the Hidden Weighted Bit Function and Their Cryptographic Properties

DTIC Science & Technology

2014-01-01

a collection of information if it does not display a currently valid OMB control number. 1. REPORT DATE 2014 2. REPORT TYPE 3. DATES COVERED 00...nonlinearity, in Advances in Cryptology – ASIACRYPT 2008 , Springer-Verlag, 2008, 425–440. [6] C. Carlet and K. Feng, An infinite class of balanced vectorial

A Construction of Boolean Functions with Good Cryptographic Properties

DTIC Science & Technology

2014-01-01

be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. 1. REPORT...2008, LNCS 5350, Springer–Verlag, 2008, pp. 425–440. [10] C. Carlet and K. Feng, “An Infinite Class of Balanced Vectorial Boolean Functions with Optimum

A Foundational Proof Framework for Cryptography

DTIC Science & Technology

2015-05-01

uniformly-distributed natural numbers in [0, ) is shown in Listing 7. RndNat_h is a helper function that samples a natural number with the appro...expect that a skilled Coq developer could complete such a proof in a matter of days (though he may require the help of a cryptographer to develop the

Super-Encryption Implementation Using Monoalphabetic Algorithm and XOR Algorithm for Data Security

NASA Astrophysics Data System (ADS)

Rachmawati, Dian; Andri Budiman, Mohammad; Aulia, Indra

2018-03-01

The exchange of data that occurs offline and online is very vulnerable to the threat of data theft. In general, cryptography is a science and art to maintain data secrecy. An encryption is a cryptography algorithm in which data is transformed into cipher text, which is something that is unreadable and meaningless so it cannot be read or understood by other parties. In super-encryption, two or more encryption algorithms are combined to make it more secure. In this work, Monoalphabetic algorithm and XOR algorithm are combined to form a super- encryption. Monoalphabetic algorithm works by changing a particular letter into a new letter based on existing keywords while the XOR algorithm works by using logic operation XOR Since Monoalphabetic algorithm is a classical cryptographic algorithm and XOR algorithm is a modern cryptographic algorithm, this scheme is expected to be both easy-to-implement and more secure. The combination of the two algorithms is capable of securing the data and restoring it back to its original form (plaintext), so the data integrity is still ensured.

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

No, author

This report summarizes the outcome of U.S. Department of Energy (DOE) contract DE-OE0000543, requesting the design of a Cryptographic Key Management System (CKMS) for the secure management of cryptographic keys for the energy sector infrastructure. Prime contractor Sypris Electronics, in collaboration with Oak Ridge National Laboratories (ORNL), Electric Power Research Institute (EPRI), Valicore Technologies, and Purdue University's Center for Education and Research in Information Assurance and Security (CERIAS) and Smart Meter Integration Laboratory (SMIL), has designed, developed and evaluated the CKMS solution. We provide an overview of the project in Section 3, review the core contributions of all contractors inmore » Section 4, and discuss bene ts to the DOE in Section 5. In Section 6 we describe the technical construction of the CKMS solution, and review its key contributions in Section 6.9. Section 7 describes the evaluation and demonstration of the CKMS solution in different environments. We summarize the key project objectives in Section 8, list publications resulting from the project in Section 9, and conclude with a discussion on commercialization in Section 10 and future work in Section 11.« less

Random ambience using high fidelity images

NASA Astrophysics Data System (ADS)

Abu, Nur Azman; Sahib, Shahrin

2011-06-01

Most of the secure communication nowadays mandates true random keys as an input. These operations are mostly designed and taken care of by the developers of the cryptosystem. Due to the nature of confidential crypto development today, pseudorandom keys are typically designed and still preferred by the developers of the cryptosystem. However, these pseudorandom keys are predictable, periodic and repeatable, hence they carry minimal entropy. True random keys are believed to be generated only via hardware random number generators. Careful statistical analysis is still required to have any confidence the process and apparatus generates numbers that are sufficiently random to suit the cryptographic use. In this underlying research, each moment in life is considered unique in itself. The random key is unique for the given moment generated by the user whenever he or she needs the random keys in practical secure communication. An ambience of high fidelity digital image shall be tested for its randomness according to the NIST Statistical Test Suite. Recommendation on generating a simple 4 megabits per second random cryptographic keys live shall be reported.

Reasoning about Probabilistic Security Using Task-PIOAs

NASA Astrophysics Data System (ADS)

Jaggard, Aaron D.; Meadows, Catherine; Mislove, Michael; Segala, Roberto

Task-structured probabilistic input/output automata (Task-PIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framework for the universal composability paradigms of protocol security. One of their advantages is that that they allow one to distinguish high-level nondeterminism that can affect the outcome of the protocol, from low-level choices, which can't. We present an alternative approach to analyzing the structure of Task-PIOAs that relies on ordered sets. We focus on two of the components that are required to define and apply Task-PIOAs: discrete probability theory and automata theory. We believe our development gives insight into the structure of Task-PIOAs and how they can be utilized to model crypto-protocols. We illustrate our approach with an example from anonymity, an area that has not previously been addressed using Task-PIOAs. We model Chaum's Dining Cryptographers Protocol at a level that does not require cryptographic primitives in the analysis. We show via this example how our approach can leverage a proof of security in the case a principal behaves deterministically to prove security when that principal behaves probabilistically.

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

Solis, John Hector

In this paper, we present a modular framework for constructing a secure and efficient program obfuscation scheme. Our approach, inspired by the obfuscation with respect to oracle machines model of [4], retains an interactive online protocol with an oracle, but relaxes the original computational and storage restrictions. We argue this is reasonable given the computational resources of modern personal devices. Furthermore, we relax the information-theoretic security requirement for computational security to utilize established cryptographic primitives. With this additional flexibility we are free to explore different cryptographic buildingblocks. Our approach combines authenticated encryption with private information retrieval to construct a securemore » program obfuscation framework. We give a formal specification of our framework, based on desired functionality and security properties, and provide an example instantiation. In particular, we implement AES in Galois/Counter Mode for authenticated encryption and the Gentry-Ramzan [13]constant communication-rate private information retrieval scheme. We present our implementation results and show that non-trivial sized programs can be realized, but scalability is quickly limited by computational overhead. Finally, we include a discussion on security considerations when instantiating specific modules.« less

Design and Analysis of Optimization Algorithms to Minimize Cryptographic Processing in BGP Security Protocols.

PubMed

Sriram, Vinay K; Montgomery, Doug

2017-07-01

The Internet is subject to attacks due to vulnerabilities in its routing protocols. One proposed approach to attain greater security is to cryptographically protect network reachability announcements exchanged between Border Gateway Protocol (BGP) routers. This study proposes and evaluates the performance and efficiency of various optimization algorithms for validation of digitally signed BGP updates. In particular, this investigation focuses on the BGPSEC (BGP with SECurity extensions) protocol, currently under consideration for standardization in the Internet Engineering Task Force. We analyze three basic BGPSEC update processing algorithms: Unoptimized, Cache Common Segments (CCS) optimization, and Best Path Only (BPO) optimization. We further propose and study cache management schemes to be used in conjunction with the CCS and BPO algorithms. The performance metrics used in the analyses are: (1) routing table convergence time after BGPSEC peering reset or router reboot events and (2) peak-second signature verification workload. Both analytical modeling and detailed trace-driven simulation were performed. Results show that the BPO algorithm is 330% to 628% faster than the unoptimized algorithm for routing table convergence in a typical Internet core-facing provider edge router.

An Authentication and Key Management Mechanism for Resource Constrained Devices in IEEE 802.11-based IoT Access Networks.

PubMed

Kim, Ki-Wook; Han, Youn-Hee; Min, Sung-Gi

2017-09-21

Many Internet of Things (IoT) services utilize an IoT access network to connect small devices with remote servers. They can share an access network with standard communication technology, such as IEEE 802.11ah. However, an authentication and key management (AKM) mechanism for resource constrained IoT devices using IEEE 802.11ah has not been proposed as yet. We therefore propose a new AKM mechanism for an IoT access network, which is based on IEEE 802.11 key management with the IEEE 802.1X authentication mechanism. The proposed AKM mechanism does not require any pre-configured security information between the access network domain and the IoT service domain. It considers the resource constraints of IoT devices, allowing IoT devices to delegate the burden of AKM processes to a powerful agent. The agent has sufficient power to support various authentication methods for the access point, and it performs cryptographic functions for the IoT devices. Performance analysis shows that the proposed mechanism greatly reduces computation costs, network costs, and memory usage of the resource-constrained IoT device as compared to the existing IEEE 802.11 Key Management with the IEEE 802.1X authentication mechanism.

An Authentication and Key Management Mechanism for Resource Constrained Devices in IEEE 802.11-based IoT Access Networks

PubMed Central

Han, Youn-Hee; Min, Sung-Gi

2017-01-01

Many Internet of Things (IoT) services utilize an IoT access network to connect small devices with remote servers. They can share an access network with standard communication technology, such as IEEE 802.11ah. However, an authentication and key management (AKM) mechanism for resource constrained IoT devices using IEEE 802.11ah has not been proposed as yet. We therefore propose a new AKM mechanism for an IoT access network, which is based on IEEE 802.11 key management with the IEEE 802.1X authentication mechanism. The proposed AKM mechanism does not require any pre-configured security information between the access network domain and the IoT service domain. It considers the resource constraints of IoT devices, allowing IoT devices to delegate the burden of AKM processes to a powerful agent. The agent has sufficient power to support various authentication methods for the access point, and it performs cryptographic functions for the IoT devices. Performance analysis shows that the proposed mechanism greatly reduces computation costs, network costs, and memory usage of the resource-constrained IoT device as compared to the existing IEEE 802.11 Key Management with the IEEE 802.1X authentication mechanism. PMID:28934152

Centralized Cryptographic Key Management and Critical Risk Assessment - CRADA Final Report For CRADA Number NFE-11-03562

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

Abercrombie, R. K.; Peters, Scott

The Department of Energy Office of Electricity Delivery and Energy Reliability (DOE-OE) Cyber Security for Energy Delivery Systems (CSEDS) industry led program (DE-FOA-0000359) entitled "Innovation for Increasing Cyber Security for Energy Delivery Systems (12CSEDS)," awarded a contract to Sypris Electronics LLC to develop a Cryptographic Key Management System for the smart grid (Scalable Key Management Solutions for Critical Infrastructure Protection). Oak Ridge National Laboratory (ORNL) and Sypris Electronics, LLC as a result of that award entered into a CRADA (NFE-11-03562) between ORNL and Sypris Electronics, LLC. ORNL provided its Cyber Security Econometrics System (CSES) as a tool to be modifiedmore » and used as a metric to address risks and vulnerabilities in the management of cryptographic keys within the Advanced Metering Infrastructure (AMI) domain of the electric sector. ORNL concentrated our analysis on the AMI domain of which the National Electric Sector Cyber security Organization Resource (NESCOR) Working Group 1 (WG1) has documented 29 failure scenarios. The computational infrastructure of this metric involves system stakeholders, security requirements, system components and security threats. To compute this metric, we estimated the stakes that each stakeholder associates with each security requirement, as well as stochastic matrices that represent the probability of a threat to cause a component failure and the probability of a component failure to cause a security requirement violation. We applied this model to estimate the security of the AMI, by leveraging the recently established National Institute of Standards and Technology Interagency Report (NISTIR) 7628 guidelines for smart grid security and the International Electrotechnical Commission (IEC) 63351, Part 9 to identify the life cycle for cryptographic key management, resulting in a vector that assigned to each stakeholder an estimate of their average loss in terms of dollars per day of system operation. To further address probabilities of threats, information security analysis can be performed using game theory implemented in dynamic Agent Based Game Theoretic (ABGT) simulations. Such simulations can be verified with the results from game theory analysis and further used to explore larger scale, real world scenarios involving multiple attackers, defenders, and information assets. The strategy for the game was developed by analyzing five electric sector representative failure scenarios contained in the AMI functional domain from NESCOR WG1. From these five selected scenarios, we characterized them into three specific threat categories affecting confidentiality, integrity and availability (CIA). The analysis using our ABGT simulation demonstrated how to model the AMI functional domain using a set of rationalized game theoretic rules decomposed from the failure scenarios in terms of how those scenarios might impact the AMI network with respect to CIA.« less

Cryptographic Key Management and Critical Risk Assessment

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

Abercrombie, Robert K

The Department of Energy Office of Electricity Delivery and Energy Reliability (DOE-OE) CyberSecurity for Energy Delivery Systems (CSEDS) industry led program (DE-FOA-0000359) entitled "Innovation for Increasing CyberSecurity for Energy Delivery Systems (12CSEDS)," awarded a contract to Sypris Electronics LLC to develop a Cryptographic Key Management System for the smart grid (Scalable Key Management Solutions for Critical Infrastructure Protection). Oak Ridge National Laboratory (ORNL) and Sypris Electronics, LLC as a result of that award entered into a CRADA (NFE-11-03562) between ORNL and Sypris Electronics, LLC. ORNL provided its Cyber Security Econometrics System (CSES) as a tool to be modified and usedmore » as a metric to address risks and vulnerabilities in the management of cryptographic keys within the Advanced Metering Infrastructure (AMI) domain of the electric sector. ORNL concentrated our analysis on the AMI domain of which the National Electric Sector Cyber security Organization Resource (NESCOR) Working Group 1 (WG1) has documented 29 failure scenarios. The computational infrastructure of this metric involves system stakeholders, security requirements, system components and security threats. To compute this metric, we estimated the stakes that each stakeholder associates with each security requirement, as well as stochastic matrices that represent the probability of a threat to cause a component failure and the probability of a component failure to cause a security requirement violation. We applied this model to estimate the security of the AMI, by leveraging the recently established National Institute of Standards and Technology Interagency Report (NISTIR) 7628 guidelines for smart grid security and the International Electrotechnical Commission (IEC) 63351, Part 9 to identify the life cycle for cryptographic key management, resulting in a vector that assigned to each stakeholder an estimate of their average loss in terms of dollars per day of system operation. To further address probabilities of threats, information security analysis can be performed using game theory implemented in dynamic Agent Based Game Theoretic (ABGT) simulations. Such simulations can be verified with the results from game theory analysis and further used to explore larger scale, real world scenarios involving multiple attackers, defenders, and information assets. The strategy for the game was developed by analyzing five electric sector representative failure scenarios contained in the AMI functional domain from NESCOR WG1. From these five selected scenarios, we characterized them into three specific threat categories affecting confidentiality, integrity and availability (CIA). The analysis using our ABGT simulation demonstrated how to model the AMI functional domain using a set of rationalized game theoretic rules decomposed from the failure scenarios in terms of how those scenarios might impact the AMI network with respect to CIA.« less

The Secret to Great Coaching: Inquiry Method Helps Teachers Take Ownership of Their Learning

ERIC Educational Resources Information Center

Foltos, Les

2014-01-01

A common question raised by new coaches is: When can I share my experience and expertise with teachers I am coaching to help them improve? It is a logical question. Many coaches know that they were chosen for the role in part because their peers respect them as a teacher. They know the instructional strategies they have used give them credibility…

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

PubMed Central

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

2017-01-01

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

Immune Modulation by Human Secreted RNases at the Extracellular Space.

PubMed

Lu, Lu; Li, Jiarui; Moussaoui, Mohammed; Boix, Ester

2018-01-01

The ribonuclease A superfamily is a vertebrate-specific family of proteins that encompasses eight functional members in humans. The proteins are secreted by diverse innate immune cells, from blood cells to epithelial cells and their levels in our body fluids correlate with infection and inflammation processes. Recent studies ascribe a prominent role to secretory RNases in the extracellular space. Extracellular RNases endowed with immuno-modulatory and antimicrobial properties can participate in a wide variety of host defense tasks, from performing cellular housekeeping to maintaining body fluid sterility. Their expression and secretion are induced in response to a variety of injury stimuli. The secreted proteins can target damaged cells and facilitate their removal from the focus of infection or inflammation. Following tissue damage, RNases can participate in clearing RNA from cellular debris or work as signaling molecules to regulate the host response and contribute to tissue remodeling and repair. We provide here an overall perspective on the current knowledge of human RNases' biological properties and their role in health and disease. The review also includes a brief description of other vertebrate family members and unrelated extracellular RNases that share common mechanisms of action. A better knowledge of RNase mechanism of actions and an understanding of their physiological roles should facilitate the development of novel therapeutics.