94 search results - page 14 / 19 » On the complexity of verifiable secret sharing and multipart... |
CCR
2000
14 years 9 months ago
2000
We propose a zero-knowledge interactive proof based identification and signature scheme. The protocol is based on Euler's totient function and discrete logarithms over the ri...
ALENEX
2010
14 years 11 months ago
2010
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
105
Voted
USS
2010
2010
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
14 years 7 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 ...
85
Voted
EUROCRYPT
2009
Springer
15 years 10 months ago
2009
Springer
A group key agreement (GKA) protocol allows a set of users to establish a common secret via open networks. Observing that a major goal of GKAs for most applications is to establish...
111
click to vote
IH
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A physically unclonable function (PUF) is a multiple-input, multipleoutput, large entropy physical system that is unreproducible due to its structural complexity. A publi...