Sciweavers

21 search results - page 4 / 5
» Cryptanalysis of Some Group-Oriented Proxy Signature Schemes
Sort
View
IJACT
2008
158views more  IJACT 2008»
13 years 5 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...
CRYPTO
1998
Springer
106views Cryptology» more  CRYPTO 1998»
13 years 9 months ago
New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications
Verifiable Signature Sharing (VS ) enables the recipient of a digital signature, who is not necessarily the original signer, to share such signature among n proxies so that a subse...
Dario Catalano, Rosario Gennaro
ETRICS
2006
13 years 9 months ago
Revocable Anonymity
Anonymity services in the EU may be forced by the new EU data retention directive to collect connection data and deanonymise some of their users in case of serious crimes. For this...
Stefan Köpsell, Rolf Wendolsky, Hannes Federr...
CRYPTO
1994
Springer
98views Cryptology» more  CRYPTO 1994»
13 years 9 months ago
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
Ronald Cramer, Ivan Damgård, Berry Schoenmak...
ASIACRYPT
2001
Springer
13 years 9 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
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...
Nicolas Courtois