In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...

Fuzzy extractors are used to generate reliably reproducible randomness from a biased, noisy source. Known constructions of fuzzy extractors are built from a strong extractor, and a secure sketch, a function that transforms a biased noisy secret value into a public value, simultaneously hiding the secret and allowing for error correction. A robust sketch is secure against adversarial modificatio...

Mobile platforms use biometrics for authentication. Unfortunately, biometrics exhibit noise between repeated readings. Due to the noise, biometrics are stored in plaintext, so device compromise completely reveals the user’s biometric value. To limit privacy violations, one can use fuzzy extractors to derive a stable cryptographic key from biometrics (Dodis et al., Eurocrypt 2004). Unfortunately...

We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W , W ′ to agree on a secret key R in the presence of an active adversary. Robust fuzzy extractors were defined by Dodis et al. in Crypto 2006 [6] to be noninteractive, i.e., only one message P , which can be modified by an unbounded adversary, can pass from one party to the oth...

We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W , W ′ to agree on a secret key R in the presence of an active adversary. Robust fuzzy extractors were defined by Dodis et al. in Crypto 2006 [6] to be noninteractive, i.e., only one message P , which can be modified by an unbounded adversary, can pass from one party to the oth...

Modern security problems focus on sensibly allocating resources to decrease the magnitude of potential hazards, decrease the chances of adversary success given an attempt, or minimize loss following a successful attack. The focus of this paper is on developing a simple, yet analytically sound tool that facilitates rapid assessments of security system nonperformance in terms of probability of ad...

The wireless sensor node, being a micro electronic device, can only be equipped with a limited power source ( < 0.5 Ahm 1.2 V). In some application scenarios (which is like military area), replenishment of power resources might be impossible. Sensor node lifetime, therefore, shows a strong dependence on battery lifetime. An adversary may compromise some sensor nodes and use them to inject false...

Nodes in sensor networks can be easily compromised by an adversary due to hostile environments in which compromised nodes could be used to inject false reports into the network. The dynamic en-route scheme can detect and drop such false reports during the forwarding phase. In this scheme, choosing a threshold value is important as this gives a trade off between security of power and energy cons...

Dolev-Dwork-Waarts-Yung linked research on reliable point-to-point networks with privacy and authenticity. In their threat model the adversary can only take over a number of nodes bounded by a threshold k. Hirt-Maurer introduced the concept of an adversary structure (i.e. the complement of an access structure). KumarGoundan-Srinathan-Rangan and Desmedt-Wang-Burmester generalized Dolev-DworkWaar...