Sciweavers

876 search results - page 89 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
159
Voted
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 1 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
97
Voted
IJISEC
2008
69views more  IJISEC 2008»
15 years 24 days ago
A survey of certificateless encryption schemes and security models
Abstract This paper surveys the literature on certificateless encryption schemes. In particular, we examine the large number of security models that have been proposed to prove the...
Alexander W. Dent
104
Voted
IEICET
2006
108views more  IEICET 2006»
15 years 24 days 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
114
Voted
SIAMCOMP
2010
147views more  SIAMCOMP 2010»
14 years 11 months ago
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
130
Voted
ACISP
2006
Springer
15 years 4 months ago
Online/Offline Signatures and Multisignatures for AODV and DSR Routing Security
Efficient authentication is one of important security requirements in mobile ad hoc network (MANET) routing systems. The techniques of digital signatures are generally considered a...
Shidi Xu, Yi Mu, Willy Susilo