-
Chapter and Conference Paper
Sustainable Pseudo-random Number Generator
Barak and Halevi (BH) have proposed an efficient architecture for robust pseudorandom generators that ensure resilience in the presence of attackers with partial knowledge or partial controls of the generators...
-
Chapter and Conference Paper
Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures
In this paper, we first demonstrate a gap between the security of verifiably committed signatures in the two-party setting and the security of verifiably committed signatures in the multi-party setting. We the...
-
Chapter and Conference Paper
Computing of Trust in Ad-Hoc Networks
Although, the notion of trust has been considered as a primitive for establishing relationships among nodes in ad-hoc networks, syntax and metrics of trust are not well defined. This paper studies computing of...
-
Chapter and Conference Paper
Finding Compact Reliable Broadcast in Unknown Fixed-Identity Networks (Short Paper)
At PODC’05, Subramanian, Katz, Roth, Shenker and Stoica (SKRSS) introduced and formulated a new theoretical problem called reliable broadcast problems in unknown fixed-identity networks [3] and further propose...
-
Chapter and Conference Paper
Compact Stimulation Mechanism for Routing Discovery Protocols in Civilian Ad-Hoc Networks
In this paper, a refined sequential aggregate signature scheme from RSA that works for any modulus is presented, then a compact stimulation mechanism without a central, trusted authority for routing discovery ...
-
Chapter and Conference Paper
Multi-Source Stream Authentication Framework in Case of Composite MPEG-4 Stream
Multimedia community is moving from monolithic applications to more flexible and scalable integrated solutions. Stream authentication is more complex since a stream may consist of multiple sources and be trans...
-
Chapter and Conference Paper
Augmented Oblivious Polynomial Evaluation Protocol and Its Applications
In this paper, we first introduce a new notion called augmented oblivious polynomial evaluation (AOPE), a useful notion to deal with the general oblivious polynomial evaluation protocol. And then we propose a ...
-
Chapter and Conference Paper
Sequential Aggregate Signatures Working over Independent Homomorphic Trapdoor One-Way Permutation Domains
The contribution of this paper has two folds. In the first fold, we propose a generic construction of sequential aggregate signatures from families of certificated trapdoor one-way permutations. We show that o...
-
Chapter and Conference Paper
Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model
In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construction is that given any valid partial sig...