Sciweavers

186 search results - page 19 / 38
» Signature Schemes Based on the Strong RSA Assumption
Sort
View
ICICS
2004
Springer
15 years 5 months ago
Factorization-Based Fail-Stop Signatures Revisited
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even i...
Katja Schmidt-Samoa
IJNSEC
2008
154views more  IJNSEC 2008»
14 years 11 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao
PKC
2007
Springer
135views Cryptology» more  PKC 2007»
15 years 5 months ago
A Direct Anonymous Attestation Scheme for Embedded Devices
Abstract. Direct anonymous attestation (DAA) is an anonymous authentication scheme adopted by the Trusted Computing Group in its specifications for trusted computing platforms. Th...
He Ge, Stephen R. Tate
PKC
2005
Springer
93views Cryptology» more  PKC 2005»
15 years 5 months ago
Optimizing Robustness While Generating Shared Secret Safe Primes
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
Emil Ong, John Kubiatowicz
CRYPTO
2011
Springer
232views Cryptology» more  CRYPTO 2011»
13 years 11 months ago
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, M...