13383 search results - page 115 / 2677 » Abstractions from proofs |
159
click to vote
CRYPTO
1989
Springer
15 years 10 months ago
1989
Springer
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
163
click to vote
CIE
2006
Springer
15 years 9 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...
161
click to vote
CRYPTO
2010
Springer
15 years 7 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...
176
click to vote
NETWORKS
2011
15 years 1 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...
115
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Merging operators aim at defining the beliefs/goals of a group of agents from the beliefs/goals of each member of the group. Whenever an agent of the group has preferences over t...