Sciweavers

490 search results - page 5 / 98
» Equivalent Keys of HPC
Sort
View
IACR
2011
126views more  IACR 2011»
13 years 11 months ago
On Enumeration of Polynomial Equivalence Classes and Their Application to MPKC
The Isomorphism of Polynomials (IP) is one of the most fundamental problems in multivariate public key cryptography (MPKC). In this paper, we introduce a new framework to study th...
Dongdai Lin, Jean-Charles Faugère, Ludovic ...
112
Voted
IMCSIT
2010
14 years 6 months ago
Service level agreements for job control in high-performance computing
A key element for outsourcing critical parts of a business process in Service Oriented Architectures are Service Level Agreements (SLAs). They build the key element to move from so...
Roland Kübert, Stefan Wesner
CPAIOR
2010
Springer
14 years 10 months ago
Automatically Exploiting Subproblem Equivalence in Constraint Programming
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
Geoffrey Chu, Maria Garcia de la Banda, Peter J. S...
112
Voted
CSFW
2012
IEEE
13 years 2 months ago
Verifying Privacy-Type Properties in a Modular Way
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
Myrto Arapinis, Vincent Cheval, Stéphanie D...
80
Voted
APPML
2010
86views more  APPML 2010»
14 years 11 months ago
A note on single-linkage equivalence
We introduce the concept of single-linkage equivalence of edge-weighted graphs, we apply it to characterise maximal spanning trees and "ultrasimilarities", and we discus...
Andreas W. M. Dress, Taoyang Wu, XiaoMing Xu