590 search results - page 30 / 118 » Short Group Signatures |
ASIACRYPT
2010
Springer
14 years 9 months ago
2010
Springer
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
SIGSOFT
2007
ACM
16 years 16 days ago
2007
ACM
In this paper, we propose a technique for leveraging historical field failure records in conjunction with automated static analysis alerts to determine which alerts or sets of ale...
114
click to vote
ACNS
2007
Springer
15 years 6 months ago
2007
Springer
In 1990, Boyar, Chaum, Damg˚ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted b...
105
click to vote
CCS
2004
ACM
15 years 5 months ago
2004
ACM
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...
ASIACRYPT
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signatu...