621 search results - page 53 / 125 » Efficient Secure Multi-party Computation |
ACNS
2007
Springer
15 years 4 months ago
2007
Springer
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
115
click to vote
ICISC
2004
15 years 1 months ago
2004
We propose a new broadcast encryption scheme based on polynomial interpolations. Our scheme, obtained from the Naor-Pinkas scheme by partitioning the user set and interpolating mul...
132
click to vote
USS
2010
2010
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
14 years 10 months ago
In this paper we introduce a framework for privacypreserving distributed computation that is practical for many real-world applications. The framework is called Peers for Privacy ...
80
Voted
ACSC
2008
IEEE
15 years 7 months ago
2008
IEEE
While mobile computing provides a potentially vast business opportunity for many industry participants, it also raises issues such as security and performance. This paper proposes...
151
Voted
CTRSA
2006
Springer
15 years 4 months ago
2006
Springer
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on ...