307 research outputs found
Coarse-grained simulations of flow-induced nucleation in semi-crystalline polymers
We perform kinetic Monte Carlo simulations of flow-induced nucleation in
polymer melts with an algorithm that is tractable even at low undercooling. The
configuration of the non-crystallized chains under flow is computed with a
recent non-linear tube model. Our simulations predict both enhanced nucleation
and the growth of shish-like elongated nuclei for sufficiently fast flows. The
simulations predict several experimental phenomena and theoretically justify a
previously empirical result for the flow-enhanced nucleation rate. The
simulations are highly pertinent to both the fundamental understanding and
process modeling of flow-induced crystallization in polymer melts.Comment: 17 pages, 6 eps figure
A path integral approach to the dynamics of a random chain with rigid constraints
In this work the dynamics of a freely jointed random chain which fluctuates
at constant temperature in some viscous medium is studied. The chain is
regarded as a system of small particles which perform a brownian motion and are
subjected to rigid constraints which forbid the breaking of the chain. For
simplicity, all interactions among the particles have been switched off and the
number of dimensions has been limited to two. The problem of describing the
fluctuations of the chain in the limit in which it becomes a continuous system
is solved using a path integral approach, in which the constraints are imposed
with the insertion in the path integral of suitable Dirac delta functions. It
is shown that the probability distribution of the possible conformations in
which the fluctuating chain can be found during its evolution in time coincides
with the partition function of a field theory which is a generalization of the
nonlinear sigma model in two dimensions. Both the probability distribution and
the generating functional of the correlation functions of the positions of the
beads are computed explicitly in a semiclassical approximation for a
ring-shaped chain.Comment: 36 pages, 2 figures, LaTeX + REVTeX4 + graphicx, minor changes in the
text, reference adde
Blind Password Registration for Two-Server Password Authenticated Key Exchange and Secret Sharing Protocols
Many organisations enforce policies on the length and formation of passwords to encourage selection of strong passwords and protect their multi-user systems. For Two-Server Password Authenticated Key Exchange (2PAKE) and Two-Server Password Authenticated Secret Sharing (2PASS) protocols, where the password chosen by the client is secretly shared between the two servers, the initial remote registration of policy-compliant passwords represents a major problem because none of the servers is supposed to know the password in clear. We solve this problem by introducing Two-Server Blind Password Registration (2BPR) protocols that can be executed between a client and the two servers as part of the remote registration procedure. 2BPR protocols guarantee that secret shares sent to the servers belong to a password that matches their combined password policy and that the plain password remains hidden from any attacker that is in control of at most one server. We propose a security model for 2BPR protocols capturing the requirements of policy compliance for client passwords and their blindness against the servers. Our model extends the adversarial setting of 2PAKE/2PASS protocols to the registration phase and hence closes the gap in the formal treatment of such protocols. We construct an efficient 2BPR protocol for ASCII-based password policies, prove its security in the standard model, give a proof of concept implementation, and discuss its performance
TMPS: Ticket-Mediated Password Strengthening
We introduce the notion of Ticket-Mediated Password Strengthening (TMPS), a technique for allowing users to derive keys from passwords while imposing a strict limit on the number of guesses of their password any attacker can make, and strongly protecting the users\u27 privacy. We describe the security requirements of TMPS, and then a set of efficient and practical protocols to implement a TMPS scheme, requiring only hash functions, CCA2-secure encryption, and blind signatures. We provide several variant protocols, including an offline symmetric-only protocol that uses a local trusted computing environment, and online variants that use group signatures or stronger trust assumptions instead of blind signatures. We formalize the security of our scheme by defining an ideal functionality in the Universal Composability (UC) framework, and by providing game-based definitions of security. We prove that our protocol realizes the ideal functionality in the random oracle model (ROM) under adaptive corruptions with erasures, and prove that security with respect to the ideal/real definition implies security with respect to the game-based definitions
Recommended from our members
Release-etch modeling for complex surface micromachined structures
A release etch model for etching sacrificial oxides in aqueous HF solutions is presented. This model is an extension of work done by Monk et al. and Liu et al. The model is inherently one dimensional, but can be used to model the etching of complex three dimensional parts. Solutions and boundary conditions are presented for a number of geometries. Knowledge of release-etch kinetics is essential for designing manufacturing processes for large surface micromachined structures such as sealed diaphragms and cavities and flow channels
Recommended from our members
Prediction of release-etch times for surface-micromachined structures
A one-dimensional model is presented which describes the release-etch behavior of sacrificial oxides in aqueous HF. Starting from first principles and an empirical rate law, release etch kinetics are derived for primitive geometries. The behavior of complex three-dimensional structures is described by joining the solutions of constituent primitives and applying appropriate boundary conditions.The two fitting parameters, k{sub 1} and k{sub 2}, are determined from the simplest structure and describe the more complex structures well. Experimental validation of the model is presented with data for all of the geometries and four types of sacrificial oxides
Security and Efficiency Analysis of the Hamming Distance Computation Protocol Based on Oblivious Transfer
open access articleBringer et al. proposed two cryptographic protocols for the computation of Hamming distance. Their first scheme uses Oblivious Transfer and provides security in the semi-honest model. The other scheme uses Committed Oblivious Transfer and is claimed to provide full security in the malicious case. The proposed protocols have direct implications to biometric authentication schemes between a prover and a verifier where the verifier has biometric data of the users in plain form.
In this paper, we show that their protocol is not actually fully secure against malicious adversaries. More precisely, our attack breaks the soundness property of their protocol where a malicious user can compute a Hamming distance which is different from the actual value. For biometric authentication systems, this attack allows a malicious adversary to pass the authentication without knowledge of the honest user's input with at most complexity instead of , where is the input length. We propose an enhanced version of their protocol where this attack is eliminated. The security of our modified protocol is proven using the simulation-based paradigm. Furthermore, as for efficiency concerns, the modified protocol utilizes Verifiable Oblivious Transfer which does not require the commitments to outputs which improves its efficiency significantly
HoneyPAKEs
We combine two security mechanisms: using a Password-based Authenticated Key Establishment (PAKE) protocol to protect the password for access control and the Honeywords construction of Juels and Rivest to detect loss of password files. The resulting construction combines the properties of both mechanisms: ensuring that the password is intrinsically protected by the PAKE protocol during transmission and the Honeywords mechanisms for detecting attempts to exploit a compromised password file. Our constructions lead very naturally to two factor type protocols. An enhanced version of our protocol further provides protection against a compromised login server by ensuring that it does not learn the index to the true password
- …