Sciweavers

105 search results - page 17 / 21
» Simple, Black-Box Constructions of Adaptively Secure Protoco...
Sort
View
IJISEC
2010
159views more  IJISEC 2010»
14 years 7 months ago
A generalization of Paillier's public-key system with applications to electronic voting
We propose a generalization of Paillier's probabilistic public key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme e...
Ivan Damgård, Mads Jurik, Jesper Buus Nielse...
ASIACRYPT
2009
Springer
15 years 4 months ago
A Framework for Universally Composable Non-committing Blind Signatures
A universally composable (UC) blind signature functionality requres users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. Th...
Masayuki Abe, Miyako Ohkubo
CRYPTO
2009
Springer
145views Cryptology» more  CRYPTO 2009»
15 years 4 months ago
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
CRYPTO
2006
Springer
106views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
On Robust Combiners for Private Information Retrieval and Other Primitives
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...
Remo Meier, Bartosz Przydatek
68
Voted
WISA
2004
Springer
15 years 3 months ago
Onions Based on Universal Re-encryption - Anonymous Communication Immune Against Repetitive Attack
Abstract. Encapsulating messages in onions is one of the major techniques providing anonymous communication in computer networks. To some extent, it provides security against trafï...
Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kut...