209 search results - page 22 / 42 » Secure Hash-and-Sign Signatures Without the Random Oracle |
163
click to vote
ASIACRYPT
2009
Springer
16 years 14 days ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
158
click to vote
ACNS
2004
Springer
15 years 9 months ago
2004
Springer
Motivated by the conflict between authenticity and privacy in the digital signature, the notion of limited verifier signature was introduced [1]. The signature can be verified by a...
176
click to vote
SCN
2008
Springer
15 years 5 months ago
2008
Springer
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
151
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
169
click to vote
AINA
2006
IEEE
15 years 9 months ago
2006
IEEE
Ad hoc networks are dynamic networks formed "on the fly" by a set of nodes. Achieving secure routing in such networks is a big challenge. Asymmetric signature schemes pr...