65 Result(s)
within
Hua** Zhu
Computer Science
Computer Communication Networks
-
Chapter and Conference Paper
Design and Security Analysis of Anonymous Group Identification Protocols
Two provably secure group identification schemes are presented in this report: 1) we extend De Santis, Crescenzo and Persiano’s (SCP) anonymous group identification scheme to the discrete logarithm based case;...
-
Chapter and Conference Paper
A Novel Two-Level Trust Model for Grid
Trust is hard to establish in a service-oriented grid architecture because of the need to support end user single sign-on and dynamic transient service. In order to enhance the security by the Grid Security In...
-
Chapter and Conference Paper
Variations of Diffie-Hellman Problem
This paper studies various computational and decisional Diffie-Hellman problems by providing reductions among them in the high granularity setting. We show that all three variations of computational Diffie-Hel...
-
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...
-
Chapter and Conference Paper
Trust Establishment in Large Scale Grid Settings
Trust establishment is hard in grid architecture by the ad hoc nature. To set up trust in large scale of network is more difficult. In this paper, we propose an automatic key management (AKM) model and correspond...
-
Chapter and Conference Paper
Analysis and Improvement of Micali’s Fair Contract Signing Protocol
In PODC 2003, Micali presented a fair electronic exchange protocol for contract signing with an invisible trusted party [17]. The protocol was filed as a US patent No 5666420 in 1997 [16]. In the protocol, two...
-
Chapter and Conference Paper
Flexible Verification of MPEG-4 Stream in Peer-to-Peer CDN
The current packet based stream authentication schemes provide effective and efficient authentication over a group of packets transmitted on erasure channels. However, by fixing the packets in transmission, an...
-
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
A Novel Construction of Two-Party Private Bidding Protocols from Yao’s Millionaires Problem
In this paper, a new bidding protocol (in essence, it is Yao’s millionaires problem) is implemented. We show that our implementation is provably secure in the common reference string model assuming that a stat...
-
Chapter and Conference Paper
Efficient Group Signatures from Bilinear Pairing
This paper presents two types of group signature schemes from bilinear pairings: the mini type and the improved type. The size of the group public keys and the length of the signatures in both schemes are constan...
-
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
More on Shared-Scalar-Product Protocols
Secure scalar product protocols provide fundamental security components for distributed data mining with privacy concerns. This paper makes two contributions in the shared-scalar-product protocols. In the firs...
-
Chapter and Conference Paper
Improving Handoff Performance by Using Distance-Based Dynamic Hysteresis Value
In this study, an adaptive handoff algorithm with a dynamic hysteresis value, based on the distance between the mobile station and the serving base station, is proposed for cellular communications. Handoff pro...
-
Chapter and Conference Paper
Performance Analysis of an Adaptive Soft Handoff Algorithm for Mobile Cellular Systems
In this paper, an adaptive soft handoff algorithm, which dynamically calculates the threshold values for soft handoff based on the received signal strength, is proposed for mobile cellular communication system...
-
Chapter and Conference Paper
Stand-Alone and Setup-Free Verifiably Committed Signatures
In this paper, a novel construction of stand-alone and setup-free verifiably committed signatures from RSA – an open problem advertised by Dodis and Reyzin in their speech [16] is presented. The methodology us...
-
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
Oblivious Scalar-Product Protocols
In this paper, a new notion which we call oblivious scalar-product protocols is introduced and formalized. We then propose an efficient implementation of oblivious scalar-product protocols based on homomorphic...
