32 search results - page 6 / 7 » Security Remarks on a Convertible Nominative Signature Schem... |
CTRSA
2007
Springer
14 years 1 months ago
2007
Springer
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
TPDS
1998
13 years 6 months ago
1998
—We suggest a method of controlling the access to a secure database via quorum systems. A quorum system is a collection of sets (quorums) every two of which have a nonempty inter...
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other, in such a way that ...
ASIACRYPT
2001
Springer
13 years 10 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
CCS
2006
ACM
13 years 10 months ago
2006
ACM
We extend the definitional work of Dwork, Naor and Sahai from deniable authentication to deniable key-exchange protocols. We then use these definitions to prove the deniability fe...