2735 search results - page 44 / 547 » Comparing notions of randomness |
164
click to vote
AML
2011
14 years 10 months ago
2011
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...
121
Voted
JOC
2011
14 years 10 months ago
2011
In this paper we introduce a new primitive called identity-based encryption with wildcards, or WIBE for short. It allows a sender to encrypt messages to a whole range of receivers ...
105
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Let X be a discrete random variable with support S and f : S S be a bijection. Then it is wellknown that the entropy of X is the same as the entropy of f(X). This entropy preserva...
125
click to vote
FSTTCS
2006
Springer
15 years 6 months ago
2006
Springer
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
125
click to vote
QEST
2010
IEEE
15 years 1 months ago
2010
IEEE
Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are exa...