Sciweavers

876 search results - page 8 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
ISCI
2008
74views more  ISCI 2008»
13 years 10 months ago
Strong limit theorems for random sets and fuzzy random sets with slowly varying weights
Theories of random sets and fuzzy random sets are useful concepts which are frequently applied in scientific areas including information science, probability and statistics. In th...
Ke-ang Fu, Li-xin Zhang
IACR
2011
129views more  IACR 2011»
12 years 10 months ago
Bounded Vector Signatures and their Applications
Although malleability is undesirable in traditional digital signatures, schemes with limited malleability properties enable interesting functionalities that may be impossible to o...
Lei Wei, Scott E. Coull, Michael K. Reiter
COCO
1998
Springer
109views Algorithms» more  COCO 1998»
14 years 2 months ago
Complexity Limitations on Quantum Computation
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
Lance Fortnow, John D. Rogers
JSYML
2008
108views more  JSYML 2008»
13 years 10 months ago
Randomness, lowness and degrees
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
George Barmpalias, Andrew E. M. Lewis, Mariya Ivan...
IJNSEC
2008
103views more  IJNSEC 2008»
13 years 10 months ago
General Group Oriented ID-based Cryptosystems with Chosen Plaintext Security
A scheme for general group oriented ID-based cryptosystems is proposed. This scheme allows an authorized subset in the general access structure to cooperatively decrypt the cipher...
Chunxiang Xu, Junhui Zhou, Guozhen Xiao