Sciweavers

186 search results - page 7 / 38
» Signature Schemes Based on the Strong RSA Assumption
Sort
View
PODC
2003
ACM
15 years 4 months ago
An asynchronous protocol for distributed computation of RSA inverses and its applications
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of pa...
Christian Cachin
CCS
2004
ACM
15 years 5 months ago
Direct anonymous attestation
This paper describes the direct anonymous attestation scheme (DAA). This scheme was adopted by the Trusted Computing Group as the method for remote authentication of a hardware mo...
Ernest F. Brickell, Jan Camenisch, Liqun Chen
CCS
2001
ACM
15 years 4 months ago
Practical forward secure group signature schemes
A group signature scheme allows a group member to sign messages anonymously on behalf of the group, while in case of a dispute, a designated entity can reveal the identity of a si...
Dawn Xiaodong Song
ICICS
2004
Springer
15 years 5 months ago
On the Minimal Assumptions of Group Signature Schemes
Abstract. One of the central lines of cryptographic research is identifying the weakest assumptions required for the construction of secure primitives. In the context of group sign...
Michel Abdalla, Bogdan Warinschi
IACR
2011
129views more  IACR 2011»
13 years 11 months ago
Bounded Vector Signatures and their Applications
Although malleability is undesirable in traditional digital signatures, schemes with limited malleability properties enable interesting functionalities that may be impossible to o...
Lei Wei, Scott E. Coull, Michael K. Reiter