Quantum-dot saturable absorber and Kerr lens mode-locked Yb:KGW laser with >300 kW of peak power

Dual action of quantum-dot saturable absorber and Kerr lens mode locking of a diode-pumped Yb:KGW laser was demonstrated. The laser delivered 105 fs pulses with 2.5 W of average power and >300 kW of peak power.

Experimenting with an intrusion detection system for encrypted networks

Network-based Intrusion Detection Systems (NIDSs) analyse network traffic to detect instances of malicious activity. Typically, this is only possible when the network traffic is accessible for analysis. With the growing use of Virtual Private Networks (VPNs) that encrypt network traffic, the NIDS can no longer access this crucial audit data. In this paper, we present an implementation and evaluation of our approach proposed in Goh et al. (2009). It is based on Shamir's secret-sharing scheme and allows a NIDS to function normally in a VPN without any modifications and without compromising the confidentiality afforded by the VPN.

Intrusion detection framework for encrypted networks

Network-based Intrusion Detection Systems (NIDSs) monitor network traffic for signs of malicious activities that have the potential to disrupt entire network infrastructures and services. NIDS can only operate when the network traffic is available and can be extracted for analysis. However, with the growing use of encrypted networks such as Virtual Private Networks (VPNs) that encrypt and conceal network traffic, a traditional NIDS can no longer access network traffic for analysis. The goal of this research is to address this problem by proposing a detection framework that allows a commercial off-the-shelf NIDS to function normally in a VPN without any modification. One of the features of the proposed framework is that it does not compromise on the confidentiality afforded by the VPN. Our work uses a combination of Shamir’s secret-sharing scheme and randomised network proxies to securely route network traffic to the NIDS for analysis. The detection framework is effective against two general classes of attacks – attacks targeted at the network hosts or attacks targeted at framework itself. We implement the detection framework as a prototype program and evaluate it. Our evaluation shows that the framework does indeed detect these classes of attacks and does not introduce any additional false positives. Despite the increase in network overhead in doing so, the proposed detection framework is able to consistently detect intrusions through encrypted networks.

Unconditionally secure disjointness tests for private datasets

We present two unconditional secure protocols for private set disjointness tests. In order to provide intuition of our protocols, we give a naive example that applies Sylvester matrices. Unfortunately, this simple construction is insecure as it reveals information about the intersection cardinality. More specifically, it discloses its lower bound. By using the Lagrange interpolation, we provide a protocol for the honest-but-curious case without revealing any additional information. Finally, we describe a protocol that is secure against malicious adversaries. In this protocol, a verification test is applied to detect misbehaving participants. Both protocols require O(1) rounds of communication. Our protocols are more efficient than the previous protocols in terms of communication and computation overhead. Unlike previous protocols whose security relies on computational assumptions, our protocols provide information theoretic security. To our knowledge, our protocols are the first ones that have been designed without a generic secure function evaluation. More important, they are the most efficient protocols for private disjointness tests in the malicious adversary case.

Active security in multiparty computation over black-box groups

Most previous work on unconditionally secure multiparty computation has focused on computing over a finite field (or ring). Multiparty computation over other algebraic structures has not received much attention, but is an interesting topic whose study may provide new and improved tools for certain applications. At CRYPTO 2007, Desmedt et al introduced a construction for a passive-secure multiparty multiplication protocol for black-box groups, reducing it to a certain graph coloring problem, leaving as an open problem to achieve security against active attacks. We present the first n-party protocol for unconditionally secure multiparty computation over a black-box group which is secure under an active attack model, tolerating any adversary structure Δ satisfying the Q 3 property (in which no union of three subsets from Δ covers the whole player set), which is known to be necessary for achieving security in the active setting. Our protocol uses Maurer’s Verifiable Secret Sharing (VSS) but preserves the essential simplicity of the graph-based approach of Desmedt et al, which avoids each shareholder having to rerun the full VSS protocol after each local computation. A corollary of our result is a new active-secure protocol for general multiparty computation of an arbitrary Boolean circuit.

Efficient fuzzy matching and intersection on private datasets

At Eurocrypt’04, Freedman, Nissim and Pinkas introduced a fuzzy private matching problem. The problem is defined as follows. Given two parties, each of them having a set of vectors where each vector has T integer components, the fuzzy private matching is to securely test if each vector of one set matches any vector of another set for at least t components where t < T. In the conclusion of their paper, they asked whether it was possible to design a fuzzy private matching protocol without incurring a communication complexity with the factor (T t ) . We answer their question in the affirmative by presenting a protocol based on homomorphic encryption, combined with the novel notion of a share-hiding error-correcting secret sharing scheme, which we show how to implement with efficient decoding using interleaved Reed-Solomon codes. This scheme may be of independent interest. Our protocol is provably secure against passive adversaries, and has better efficiency than previous protocols for certain parameter values.

Multi-party computation with omnipresent adversary

Secure multi-party computation (MPC) protocols enable a set of n mutually distrusting participants P 1, ..., P n , each with their own private input x i , to compute a function Y = F(x 1, ..., x n ), such that at the end of the protocol, all participants learn the correct value of Y, while secrecy of the private inputs is maintained. Classical results in the unconditionally secure MPC indicate that in the presence of an active adversary, every function can be computed if and only if the number of corrupted participants, t a , is smaller than n/3. Relaxing the requirement of perfect secrecy and utilizing broadcast channels, one can improve this bound to t a  < n/2. All existing MPC protocols assume that uncorrupted participants are truly honest, i.e., they are not even curious in learning other participant secret inputs. Based on this assumption, some MPC protocols are designed in such a way that after elimination of all misbehaving participants, the remaining ones learn all information in the system. This is not consistent with maintaining privacy of the participant inputs. Furthermore, an improvement of the classical results given by Fitzi, Hirt, and Maurer indicates that in addition to t a actively corrupted participants, the adversary may simultaneously corrupt some participants passively. This is in contrast to the assumption that participants who are not corrupted by an active adversary are truly honest. This paper examines the privacy of MPC protocols, and introduces the notion of an omnipresent adversary, which cannot be eliminated from the protocol. The omnipresent adversary can be either a passive, an active or a mixed one. We assume that up to a minority of participants who are not corrupted by an active adversary can be corrupted passively, with the restriction that at any time, the number of corrupted participants does not exceed a predetermined threshold. We will also show that the existence of a t-resilient protocol for a group of n participants, implies the existence of a t’-private protocol for a group of n′ participants. That is, the elimination of misbehaving participants from a t-resilient protocol leads to the decomposition of the protocol. Our adversary model stipulates that a MPC protocol never operates with a set of truly honest participants (which is a more realistic scenario). Therefore, privacy of all participants who properly follow the protocol will be maintained. We present a novel disqualification protocol to avoid a loss of privacy of participants who properly follow the protocol.

Distributed private matching and set operations

Motivated by the need of private set operations in a distributed environment, we extend the two-party private matching problem proposed by Freedman, Nissim and Pinkas (FNP) at Eurocrypt’04 to the distributed setting. By using a secret sharing scheme, we provide a distributed solution of the FNP private matching called the distributed private matching. In our distributed private matching scheme, we use a polynomial to represent one party’s dataset as in FNP and then distribute the polynomial to multiple servers. We extend our solution to the distributed set intersection and the cardinality of the intersection, and further we show how to apply the distributed private matching in order to compute distributed subset relation. Our work extends the primitives of private matching and set intersection by Freedman et al. Our distributed construction might be of great value when the dataset is outsourced and its privacy is the main concern. In such cases, our distributed solutions keep the utility of those set operations while the dataset privacy is not compromised. Comparing with previous works, we achieve a more efficient solution in terms of computation. All protocols constructed in this paper are provably secure against a semi-honest adversary under the Decisional Diffie-Hellman assumption.

Threshold MACs

The power of sharing computation in a cryptosystem is crucial in several real-life applications of cryptography. Cryptographic primitives and tasks to which threshold cryptosystems have been applied include variants of digital signature, identification, public-key encryption and block ciphers etc. It is desirable to extend the domain of cryptographic primitives which threshold cryptography can be applied to. This paper studies threshold message authentication codes (threshold MACs). Threshold cryptosystems usually use algebraically homomorphic properties of the underlying cryptographic primitives. A typical approach to construct a threshold cryptographic scheme is to combine a (linear) secret sharing scheme with an algebraically homomorphic cryptographic primitive. The lack of algebraic properties of MACs rules out such an approach to share MACs. In this paper, we propose a method of obtaining a threshold MAC using a combinatorial approach. Our method is generic in the sense that it is applicable to any secure conventional MAC by making use of certain combinatorial objects, such as cover-free families and their variants. We discuss the issues of anonymity in threshold cryptography, a subject that has not been addressed previously in the literature in the field, and we show that there are trade-offis between the anonymity and efficiency of threshold MACs.

Information Theoretic Results for Three-User Cognitive Channels

In this paper, we introduce the three-user cognitive radio channels with asymmetric transmitter cooperation, and derive achievable rate regions under several scenarios depending on the type of cooperation and decoding capability at the receivers. Two of the most natural cooperation mechanisms for the three-user channel are considered here: cumulative message sharing (CMS) and primary-only message sharing (PMS). In addition to the message sharing mechanism, the achievable rate region is critically dependent on the decoding capability at the receivers. Here, we consider two scenarios for the decoding capability, and derive an achievable rate region for each one of them by employing a combination of superposition and Gel'fand-Pinsker coding techniques. Finally, to provide a numerical example, we consider the Gaussian channel model to plot the rate regions. In terms of achievable rates, CMS turns out to be a better scheme than PMS. However, the practical aspects of implementing such message-sharing schemes remain to be investigated.

QM/MM and Classical Molecular Dynamics Simulation of Histidine-Tagged Peptide Immobilization on Nickel Surface

The hybrid quantum mechanics (QM) and molecular mechanics (MM) method is employed to simulate the His-tagged peptide adsorption to ionized region of nickel surface. Based on the previous experiments, the peptide interaction with one Ni ion is considered. In the QM/MM calculation, the imidazoles on the side chain of the peptide and the metal ion with several neighboring water molecules are treated as QM part calculated by “GAMESS”, and the rest atoms are treated as MM part calculated by “TINKER”. The integrated molecular orbital/molecular mechanics (IMOMM) method is used to deal with theQMpart with the transitional metal. By using the QM/MM method, we optimize the structure of the synthetic peptide chelating with a Ni ion. Different chelate structures are considered. The geometry parameters of the QM subsystem we obtained by QM/MM calculation are consistent with the available experimental results. We also perform a classical molecular dynamics (MD) simulation with the experimental parameters for the synthetic peptide adsorption on a neutral Ni(1 0 0) surface. We find that half of the His-tags are almost parallel with the substrate, which enhance the binding strength. Peeling of the peptide from the Ni substrate is simulated in the aqueous solvent and in vacuum, respectively. The critical peeling forces in the two environments are obtained. The results show that the imidazole rings are attached to the substrate more tightly than other bases in this peptide.

QM/MM and Classical Molecular Dynamics Simulation of Histidine-Tagged Peptide Immobilization on Nickel Surface

The hybrid quantum mechanics (QM) and molecular mechanics (MM) method is employed to simulate the His-tagged peptide adsorption to ionized region of nickel surface. Based on the previous experiments, the peptide interaction with one Ni ion is considered. In the QM/MM calculation, the imidazoles on the side chain of the peptide and the metal ion with several neighboring water molecules are treated as QM part calculated by "GAMESS", and the rest atoms are treated as MM part calculated by "TINKER". The integrated molecular orbital/molecular mechanics (IMOMM) method is used to deal with the QM part with the transitional metal. By using the QM/MM method, we optimize the structure of the synthetic peptide chelating with a Ni ion. Different chelate structures are considered. The geometry parameters of the QM subsystem we obtained by QM/MM calculation are consistent with the available experimental results. We also perform a classical molecular dynamics (MD) simulation with the experimental parameters for the synthetic peptide adsorption on a neutral Ni(100) surface. We find that half of the His-tags are almost parallel with the substrate, which enhance the binding strength. Peeling of the peptide from the Ni substrate is simulated in the aqueous solvent and in vacuum, respectively. The critical peeling forces in the two environments are obtained. The results show that the in-tidazole rings are attached to the substrate more tightly than other bases in this peptide.

Evaluating boundary dependent errors in QM/MM simulations.

Hybrid quantum mechanics/molecular mechanics (QM/MM) simulations provide a powerful tool for studying chemical reactions, especially in complex biochemical systems. In most works to date, the quantum region is kept fixed throughout the simulation and is defined in an ad hoc way based on chemical intuition and available computational resources. The simulation errors associated with a given choice of the quantum region are, however, rarely assessed in a systematic manner. Here we study the dependence of two relevant quantities on the QM region size: the force error at the center of the QM region and the free energy of a proton transfer reaction. Taking lysozyme as our model system, we find that in an apolar region the average force error rapidly decreases with increasing QM region size. In contrast, the average force error at the polar active site is considerably higher, exhibits large oscillations and decreases more slowly, and may not fall below acceptable limits even for a quantum region radius of 9.0 A. Although computation of free energies could only be afforded until 6.0 A, results were found to change considerably within these limits. These errors demonstrate that the results of QM/MM calculations are heavily affected by the definition of the QM region (not only its size), and a convergence test is proposed to be a part of setting up QM/MM simulations.