Sciweavers

24 search results - page 5 / 5
» On Codes, Matroids, and Secure Multiparty Computation From L...
Sort
View
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
12 years 7 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 5 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
EUROPKI
2009
Springer
13 years 2 months ago
Automatic Generation of Sigma-Protocols
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
Endre Bangerter, Thomas Briner, Wilko Henecka, Ste...
ATAL
2005
Springer
13 years 10 months ago
Decentralized voting with unconditional privacy
The aggregation of conflicting preferences is a key issue in multiagent systems. Due to its universality, voting has a central role among preference aggregation mechanisms. Votin...
Felix Brandt, Tuomas Sandholm