250 search results - page 4 / 50 » A Round and Communication Efficient Secure Ranking Protocol |
TCC
2007
Springer
14 years 1 months ago
2007
Springer
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
ISW
2005
Springer
14 years 1 months ago
2005
Springer
We present a fully symmetric constant round authenticated group key agreement protocol in dynamic scenario. Our proposed scheme achieves forward secrecy and is provably secure und...
WECWIS
2005
IEEE
14 years 1 months ago
2005
IEEE
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...