101 search results - page 8 / 21 » Extended visual cryptography schemes |
73
Voted
ACNS
2005
Springer
15 years 3 months ago
2005
Springer
k-times anonymous authentication (k-TAA) schemes allow members of a group to be anonymously authenticated by application providers for a bounded number of times. k-TAA has applicat...
WCC
2005
Springer
15 years 3 months ago
2005
Springer
We present constructions of polyphase sequences suitable for the use as codewords in orthogonal frequency-division multiplexing (OFDM) with strictly bounded peak-to-mean envelope p...
CTRSA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, we give a first example of identity based undeniable signature using pairings over elliptic curves. We extend to the identity based setting the security m...
PKC
2004
Springer
15 years 3 months ago
2004
Springer
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
ESORICS
2003
Springer
15 years 2 months ago
2003
Springer
Recently, David Chaum proposed an electronic voting scheme that combines visual cryptography and digital processing. It was designed to meet not only mathematical security standard...