Sciweavers

983 search results - page 103 / 197
» Continuous Queries in Oracle
Sort
View
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Loka...
CRYPTO
2010
Springer
162views Cryptology» more  CRYPTO 2010»
14 years 10 months ago
On Strong Simulation and Composable Point Obfuscation
The Virtual Black Box (VBB) property for program obfuscators provides a strong guarantee: Anything computable by an efficient adversary given the obfuscated program can also be co...
Nir Bitansky, Ran Canetti
IJISEC
2007
61views more  IJISEC 2007»
14 years 9 months ago
Identity-based key agreement protocols from pairings
In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, the security of this ty...
Liqun Chen, Zhaohui Cheng, Nigel P. Smart
MST
2010
101views more  MST 2010»
14 years 8 months ago
Non-Uniform Reductions
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
Harry Buhrman, Benjamin J. Hescott, Steven Homer, ...
PODS
2004
ACM
147views Database» more  PODS 2004»
15 years 10 months ago
Flexible Time Management in Data Stream Systems
Continuous queries in a Data Stream Management System (DSMS) rely on time as a basis for windows on streams and for defining a consistent semantics for multiple streams and updata...
Utkarsh Srivastava, Jennifer Widom