78 search results - page 15 / 16 » (Convertible) Undeniable Signatures Without Random Oracles |
AFRICACRYPT
2010
Springer
14 years 2 days ago
2010
Springer
Abstract. Proxy re-encryption (PRE) allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into one encrypting the same plaintext for Bob. The proxy only...
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
ACNS
2007
Springer
14 years 3 months ago
2007
Springer
In a proxy re-encryption scheme a semi-trusted proxy converts a ciphertext for Alice into a ciphertext for Bob without seeing the underlying plaintext. A number of solutions have ...
PODC
2003
ACM
14 years 2 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...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...