Sciweavers

610 search results - page 31 / 122
» Information-theoretically secure protocols and security unde...
Sort
View
ASIACRYPT
2007
Springer
15 years 8 months ago
Simple and Efficient Perfectly-Secure Asynchronous MPC
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
Zuzana Beerliová-Trubíniová, ...
ICPADS
2007
IEEE
15 years 10 months ago
S/Kademlia: A practicable approach towards secure key-based routing
Security is a common problem in completely decentralized peer-to-peer systems. Although several suggestions exist on how to create a secure key-based routing protocol, a practicab...
Ingmar Baumgart, Sebastian Mies
ACNS
2010
Springer
134views Cryptology» more  ACNS 2010»
15 years 5 months ago
Efficient and Secure Evaluation of Multivariate Polynomials and Applications
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...
Matthew K. Franklin, Payman Mohassel
FSTTCS
2010
Springer
15 years 2 months ago
Lower bounds for Quantum Oblivious Transfer
Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the disho...
André Chailloux, Iordanis Kerenidis, Jamie ...
ICALP
2010
Springer
15 years 9 months ago
Compositional Closure for Bayes Risk in Probabilistic Noninterference
We give a quantitative sequential model for noninterference security with probability (but not demonic choice), and a novel refinement order that we prove to be the greatest compo...
Annabelle McIver, Larissa Meinicke, Carroll Morgan