Sciweavers

75 search results - page 15 / 15
» Efficient Revocation in Group Signatures
Sort
View
CRYPTO
1994
Springer
98views Cryptology» more  CRYPTO 1994»
14 years 1 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...
CCS
2008
ACM
13 years 11 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
BMCBI
2002
100views more  BMCBI 2002»
13 years 9 months ago
An algorithm and program for finding sequence specific oligo-nucleotide probes for species identification
Background: The identification of species or species groups with specific oligo-nucleotides as molecular signatures is becoming increasingly popular for bacterial samples. However...
Alexander E. Pozhitkov, Diethard Tautz
DAWAK
2003
Springer
14 years 3 months ago
Performance Tests in Data Warehousing ETLM Process for Detection of Changes in Data Origin
In a data warehouse (DW) environment, when the operational environment does not posses or does not want to inform the data about the changes that occurred, controls have to be impl...
Rosana L. de B. A. Rocha, Leonardo Figueiredo Card...
IJSNET
2008
118views more  IJSNET 2008»
13 years 9 months ago
Public key cryptography empowered smart dust is affordable
: Public key cryptography (PKC) has been considered for a long time to be computationally too expensive for small battery powered devices. However, PKC turned out to be very benefi...
Steffen Peter, Peter Langendörfer, Krzysztof ...