566 search results - page 61 / 114 » Array Abstractions from Proofs |
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart's deterministic enco...
NETWORKS
2011
13 years 2 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We provide a new characterization of certain zero-knowledge protocols as non-interactive instance-dependent commitment-schemes (NIC). To obtain this result we consider th...