Sciweavers

24 search results - page 5 / 5
» Hardness Preserving Constructions of Pseudorandom Functions
Sort
View
IEICET
2006
108views more  IEICET 2006»
13 years 5 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 5 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
OOPSLA
2007
Springer
13 years 11 months ago
Living in the comfort zone
A comfort zone is a tested region of a system’s input space within which it has been observed to behave acceptably. To keep systems operating within their comfort zones, we advo...
Martin C. Rinard
PODS
2012
ACM
281views Database» more  PODS 2012»
11 years 8 months ago
Mergeable summaries
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang,...