Sciweavers

32 search results - page 5 / 7
» Constructing Committed Signatures from Strong-RSA Assumption...
Sort
View
BIRTHDAY
2012
Springer
12 years 3 months ago
Deniable RSA Signature - The Raise and Fall of Ali Baba
The 40 thieves realize that the fortune in their cave is vanishing. A rumor says that Ali Baba has been granted access (in the form of a certificate) to the cave but they need evi...
Serge Vaudenay
PKC
2005
Springer
110views Cryptology» more  PKC 2005»
14 years 28 days ago
From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
Julien Cathalo, Jean-Sébastien Coron, David...
CTRSA
2006
Springer
156views Cryptology» more  CTRSA 2006»
13 years 11 months ago
Universally Composable Oblivious Transfer in the Multi-party Setting
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
Marc Fischlin
CCS
2008
ACM
13 years 9 months ago
Multi-use unidirectional proxy re-signatures
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...
Benoît Libert, Damien Vergnaud
TIT
2011
125views more  TIT 2011»
13 years 2 months ago
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption
Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called proxy re-encryption, in which a proxy transforms – without seeing the corresponding plain...
Benoît Libert, Damien Vergnaud