2601 search results - page 86 / 521 » Secure Rewarding Schemes |
127
click to vote
EUROCRYPT
2003
Springer
15 years 8 months ago
2003
Springer
A variant of Schnorr’s signature scheme called RDSA has been proposed by I. Biehl, J. Buchmann, S. Hamdy and A. Meyer in order to be used in finite abelian groups of unknown ord...
136
click to vote
SCN
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. This paper shows some efficient and provably-secure convertible undeniable signature schemes (with both selective conversion and all conversion), in the standard model an...
109
click to vote
COMPSEC
2010
15 years 1 months ago
2010
Making backup is so cumbersome and expensive that individuals hardly ever backup their data and companies usually duplicate their data into a secondary server. This paper proposes...
PROVSEC
2009
Springer
15 years 9 months ago
2009
Springer
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
Chosen-ciphertext security is by now a standard security property for asymmetric encryption. Many generic constructions for building secure cryptosystems from primitives with lower...