Sciweavers

ACNS
2005
Springer
84views Cryptology» more  ACNS 2005»
14 years 1 months ago
Non-interactive Zero-Knowledge Arguments for Voting
Abstract. In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally the votes. If voters can send in arbitrary ...
Jens Groth
ACNS
2005
Springer
97views Cryptology» more  ACNS 2005»
14 years 1 months ago
Thompson's Group and Public Key Cryptography
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...
Vladimir Shpilrain, Alexander Ushakov
ACNS
2005
Springer
93views Cryptology» more  ACNS 2005»
14 years 1 months ago
Messin' with Texas Deriving Mother's Maiden Names Using Public Records
We have developed techniques to automatically infer mother's maiden names from public records. We demonstrate our techniques using publicly available records from the state o...
Virgil Griffith, Markus Jakobsson
ACNS
2005
Springer
138views Cryptology» more  ACNS 2005»
14 years 1 months ago
Indexing Information for Data Forensics
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values speci...
Michael T. Goodrich, Mikhail J. Atallah, Roberto T...
ACNS
2005
Springer
124views Cryptology» more  ACNS 2005»
14 years 1 months ago
Building Reliable Mix Networks with Fair Exchange
In this paper we present techniques by which each mix in a mix network can be paid for its services by message senders, in a way that ensures fairness and without sacrificing anon...
Michael K. Reiter, XiaoFeng Wang, Matthew Wright
ACNS
2005
Springer
111views Cryptology» more  ACNS 2005»
14 years 1 months ago
Digital Signatures Do Not Guarantee Exclusive Ownership
Digital signature systems provide a way to transfer trust from the public key to the signed data; this is used extensively within PKIs. However, some applications need a transfer o...
Thomas Pornin, Julien P. Stern
ACNS
2005
Springer
81views Cryptology» more  ACNS 2005»
14 years 1 months ago
Searching for High-Value Rare Events with Uncheatable Grid Computing
Abstract. High-value rare-event searching is arguably the most natural application of grid computing, where computational tasks are distributed to a large collection of clients (wh...
Wenliang Du, Michael T. Goodrich
ACNS
2005
Springer
94views Cryptology» more  ACNS 2005»
14 years 1 months ago
Optimal Asymmetric Encryption and Signature Paddings
Strong security notions often introduce strong constraints on the construction of cryptographic schemes: semantic security implies probabilistic encryption, while the resistance to...
Benoît Chevallier-Mames, Duong Hieu Phan, Da...
ACNS
2005
Springer
85views Cryptology» more  ACNS 2005»
14 years 1 months ago
New Signature Schemes with Coupons and Tight Reduction
Amongst provably secure signature schemes, two distinct classes are of particular interest: the ones with tight reduction (e.g., RSA-PSS), and those which support the use of coupon...
Benoît Chevallier-Mames
ACNS
2005
Springer
134views Cryptology» more  ACNS 2005»
14 years 1 months ago
Dynamic k-Times Anonymous Authentication
k-times anonymous authentication (k-TAA) schemes allow members of a group to be anonymously authenticated by application providers for a bounded number of times. k-TAA has applicat...
Lan Nguyen, Reihaneh Safavi-Naini