446 search results - page 71 / 90 » On Anonymity of Group Signatures |
PERCOM
2004
ACM
15 years 11 months ago
2004
ACM
There is generally no a priori trust relationship among entities interacting in pervasive computing environments which makes it necessary to establish trust from scratch. This tas...
103
click to vote
PODC
2003
ACM
15 years 5 months ago
2003
ACM
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of pa...
102
click to vote
ASIACRYPT
2000
Springer
15 years 4 months ago
2000
Springer
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
EUROCRYPT
2000
Springer
15 years 3 months ago
2000
Springer
Alice wants to prove that she is young enough to borrow money from her bank, without revealing her age. She therefore needs a tool for proving that a committed number lies in a spe...
104
click to vote
CAINE
2008
15 years 1 months ago
2008
Assembly is an NP-Hard problem, which involves comparing fragments that have a time complexity of O(n2 ). This paper presents a parallel approach for sequence assembly. The parall...