Sciweavers

80 search results - page 6 / 16
» On the Complexity of Reasoning in Kleene Algebra
Sort
View
TAPSOFT
1997
Springer
13 years 11 months ago
Specifying Complex and Structured Systems with Evolving Algebras
This paper presents an approach for specifying complex, structured systems with Evolving Algebras by means of aggregation and composition. Evolving algebras provide a formal method...
Wolfgang May
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
LPAR
2010
Springer
13 years 5 months ago
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...
Friedrich Neurauter, Harald Zankl, Aart Middeldorp
JAIR
2000
105views more  JAIR 2000»
13 years 7 months ago
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
Federico Barber
PKC
2010
Springer
210views Cryptology» more  PKC 2010»
13 years 11 months ago
Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem
Abstract. In this paper, we fully break the Algebraic Surface Cryptosystem (ASC for short) proposed at PKC’2009 [3]. This system is based on an unusual problem in multivariate cr...
Jean-Charles Faugère, Pierre-Jean Spaenleha...