Sciweavers

266 search results - page 25 / 54
» Tracing-by-Linking Group Signatures
Sort
View
CTRSA
2012
Springer
285views Cryptology» more  CTRSA 2012»
12 years 6 months ago
Plaintext-Checkable Encryption
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
Sébastien Canard, Georg Fuchsbauer, Aline G...
CANS
2009
Springer
121views Cryptology» more  CANS 2009»
14 years 5 months ago
On Cryptographic Schemes Based on Discrete Logarithms and Factoring
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
Marc Joye
FC
2007
Springer
125views Cryptology» more  FC 2007»
14 years 5 months ago
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
Yvo Desmedt, Tanja Lange, Mike Burmester
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
14 years 3 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson
ICASSP
2008
IEEE
14 years 5 months ago
Performance and robustness: A trade-off in dynamic signature verification
A performance and robustness study for on-line signature veri cation is presented. Experiments are carried out on the MCYT database comprising 16,500 signatures from 330 subjects,...
Javier Galbally, Julian Fiérrez, Javier Ort...