Sciweavers

530 search results - page 59 / 106
» Practical Threshold Signatures
Sort
View
82
Voted
ICALP
2005
Springer
15 years 6 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
106
Voted
IACR
2011
136views more  IACR 2011»
14 years 5 days ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
SPW
2004
Springer
15 years 5 months ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson
91
Voted
JCP
2006
135views more  JCP 2006»
15 years 15 days ago
Improved Double Auction Protocol based on a Hybrid Trust Model
Recently, Wang et al. proposed a set of double auction protocols with full privacy protection based on distributed ElGamal encryption. Unfortunately, their protocols are expensive ...
JungHoon Ha, Jianying Zhou, Sang-Jae Moon
JCS
2007
103views more  JCS 2007»
15 years 12 days ago
Risk management for distributed authorization
Distributed authorization takes into account several elements, including certificates that may be provided by non-local actors. While most trust management systems treat all asse...
Christian Skalka, Xiaoyang Sean Wang, Peter C. Cha...