278 search results - page 2 / 56 » The one-way function based on computational uncertainty prin... |
COCO
2009
Springer
13 years 11 months ago
2009
Springer
—The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the result of [3] and show that all NP-comple...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
SECPERU
2006
IEEE
13 years 11 months ago
2006
IEEE
The objective of this paper is to propose a cryptographic protocol which provides authenticity in the exchange of information between two entities without using any shared secret ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
ISIPTA
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper shows that a "principle of complete ignorance" plays a central role in decisions based on Dempster belief functions. Such belief functions occur when, in a fi...