Sciweavers

334 search results - page 60 / 67
» Public Key Encryption for the Forgetful
Sort
View
CCS
2007
ACM
14 years 1 months ago
Split-ballot voting: everlasting privacy with distributed trust
In this paper we propose a new voting protocol with desirable security properties. The voting stage of the protocol can be performed by humans without computers; it provides every...
Tal Moran, Moni Naor
EUROCRYPT
2003
Springer
14 years 18 days ago
Why Provable Security Matters?
Abstract. Recently, methods from provable security, that had been developped for the last twenty years within the research community, have been extensively used to support emerging...
Jacques Stern
ICALP
2009
Springer
14 years 7 months ago
Secure Function Collection with Sublinear Storage
Consider a center possessing a trusted (tamper proof) device that wishes to securely compute a public function over private inputs that are contributed by some network nodes. In ne...
Maged H. Ibrahim, Aggelos Kiayias, Moti Yung, Hong...
PKC
2009
Springer
172views Cryptology» more  PKC 2009»
14 years 8 months ago
CCA-Secure Proxy Re-encryption without Pairings
ded abstract of this paper appears in PKC 2009, S. Jarecki, G. Tsudik (Eds.), volume 5443 of LNCS, pp. 357-376, Sringer-Verlag, 2009. CCA-Secure Proxy Re-Encryption without Pairing...
Jun Shao, Zhenfu Cao
ASIACRYPT
2001
Springer
13 years 12 months ago
How to Leak a Secret
In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signatu...
Ronald L. Rivest, Adi Shamir, Yael Tauman