Security and composition of multiparty cryptographic protocols

R Canetti - Journal of CRYPTOLOGY, 2000 - Springer
We present general definitions of security for multiparty cryptographic protocols, with focus
on the task of evaluating a probabilistic function of the parties' inputs. We show that, with …

[LLIBRE][B] Data mining and machine learning in cybersecurity

S Dua, X Du - 2016 - books.google.com
From basic concepts in machine learning and data mining to advanced problems in the
machine learning domain, this book provides a unified reference for specific machine …

Method and apparatus for the secure distributed storage and retrieval of information

JA Garay, R Gennaro, CS Jutla, TD Rabin - US Patent 5,991,414, 1999 - Google Patents
Retrieval of Information (SSRI) guarantees that also the process of Storing the information is
correct even when Some processorS fail. A user interacts with the Storage System by …

Method and apparatus for the secure distributed storage and retrieval of information

JA Garay, R Gennaro, CS Jutla, TD Rabin - US Patent 6,192,472, 2001 - Google Patents
Retrieval of Information (SSRI) guarantees that also the process of Storing the information is
correct even when Some processorS fail. A user interacts with the Storage System by …

Multicast security: A taxonomy and some efficient constructions

R Canetti, J Garay, G Itkis, D Micciancio… - IEEE INFOCOM'99 …, 1999 - ieeexplore.ieee.org
Multicast communication is becoming the basis for a growing number of applications. It is
therefore critical to provide sound security mechanisms for multicast communication. Yet …

Distributed pseudo-random functions and KDCs

M Naor, B Pinkas, O Reingold - International conference on the theory and …, 1999 - Springer
This work describes schemes for distributing between n servers the evaluation of a function f
which is an approximation to a random function, such that only authorized subsets of servers …

Asynchronous verifiable secret sharing and proactive cryptosystems

C Cachin, K Kursawe, A Lysyanskaya… - Proceedings of the 9th …, 2002 - dl.acm.org
Verifiable secret sharing is an important primitive in distributed cryptography. With the
growing interest in the deployment of threshold cryptosystems in practice, the traditional …

A simplified approach to threshold and proactive RSA

T Rabin - Advances in Cryptology—CRYPTO'98: 18th Annual …, 1998 - Springer
We present a solution to both the robust threshold RSA and proactive RSA problems. Our
solutions are conceptually simple, and allow for an easy design of the system. The signing …

Intrusion-tolerant architectures: Concepts and design

PE Veríssimo, NF Neves, MP Correia - Architecting dependable systems, 2007 - Springer
There is a significant body of research on distributed computing architectures,
methodologies and algorithms, both in the fields of fault tolerance and security. Whilst they …

Secret Key Recovery in a {Global-Scale}{End-to-End} Encryption System

G Connell, V Fang, R Schmidt, E Dauterman… - … USENIX Symposium on …, 2024 - usenix.org
End-to-end encrypted messaging applications ensure that an attacker cannot read a user's
message history without their decryption keys. While this provides strong privacy, it creates a …