Sciweavers

346 search results - page 61 / 70
» The Secret Santa Problem
Sort
View
CCS
2008
ACM
13 years 11 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
IFIP
2010
Springer
13 years 4 months ago
Bounded Memory Dolev-Yao Adversaries in Collaborative Systems
Abstract. This paper extends existing models for collaborative systems. We investigate how much damage can be done by insiders alone, without collusion with an outside adversary. I...
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, ...
JUCS
2010
114views more  JUCS 2010»
13 years 4 months ago
On Reliable Platform Configuration Change Reporting Mechanisms for Trusted Computing Enabled Platforms
: One of the most important use-cases of Trusted Computing is Remote Attestation. It allows platforms to get a trustworthy proof of the loaded software and current configuration of...
Kurt Dietrich
IACR
2011
111views more  IACR 2011»
12 years 9 months ago
Secure Multi-Party Sorting and Applications
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
Kristján Valur Jónsson, Gunnar Kreit...
ICDE
2009
IEEE
255views Database» more  ICDE 2009»
14 years 11 months ago
Database Management as a Service: Challenges and Opportunities
Data outsourcing or database as a service is a new paradigm for data management in which a third party service provider hosts a database as a service. The service provides data man...
Ahmed Metwally, Amr El Abbadi, Divyakant Agrawal, ...