Sciweavers

61 search results - page 7 / 13
» Repairing Efficient Threshold Group Signature Scheme
Sort
View
ASIACRYPT
2000
Springer
15 years 1 months ago
Improved Methods to Perform Threshold RSA
Abstract. A t out of n threshold scheme is such that shares are distributed to n participants so that any set of t participants can compute the secret, whereas any set of less than...
Brian King
ACISP
2006
Springer
15 years 1 months ago
Efficient Identity-Based Signatures Secure in the Standard Model
The only known construction of identity-based signatures that can be proven secure in the standard model is based on the approach of attaching certificates to non-identity-based si...
Kenneth G. Paterson, Jacob C. N. Schuldt
ASIACRYPT
2006
Springer
15 years 1 months ago
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Jens Groth
CRYPTO
1998
Springer
106views Cryptology» more  CRYPTO 1998»
15 years 1 months ago
New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications
Verifiable Signature Sharing (VS ) enables the recipient of a digital signature, who is not necessarily the original signer, to share such signature among n proxies so that a subse...
Dario Catalano, Rosario Gennaro
NETWORKING
2004
14 years 11 months ago
Efficient, Authenticated, and Fault-Tolerant Key Agreement for Dynamic Peer Groups
We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key ...
Li Zhou, Chinya V. Ravishankar