Sciweavers

1175 search results - page 13 / 235
» Abstract computability and algebraic specification
Sort
View
CRYPTO
2006
Springer
232views Cryptology» more  CRYPTO 2006»
15 years 5 months ago
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
Abstract. We introduce algebraic geometric techniques in secret sharing and in secure multi-party computation (MPC) in particular. The main result is a linear secret sharing scheme...
Hao Chen, Ronald Cramer
ISSAC
1998
Springer
117views Mathematics» more  ISSAC 1998»
15 years 6 months ago
Lightweight Formal Methods for Computer Algebra Systems
In this paper we demonstrate the use of formal methods tools to provide a semantics for the type hierarchy of the AXIOM computer algebra system, and a methodology for Aldor progra...
Martin Dunstan, Tom Kelsey, Steve Linton, Ursula M...
92
Voted
AISC
2008
Springer
15 years 4 months ago
Effective Set Membership in Computer Algebra and Beyond
Abstract. In previous work, we showed the importance of distinguishing "I know that X = Y " from "I don't know that X = Y ". In this paper we look at effec...
James H. Davenport
ECCC
2007
144views more  ECCC 2007»
15 years 1 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
FOSSACS
2005
Springer
15 years 7 months ago
Mathematical Models of Computational and Combinatorial Structures
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
Marcelo P. Fiore