Sciweavers

142 search results - page 7 / 29
» Protocol Algebra
Sort
View
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
WOLLIC
2010
Springer
15 years 3 months ago
Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signa
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
Daniele Nantes Sobrinho, Mauricio Ayala-Rinc&oacut...
STACS
2007
Springer
15 years 4 months ago
On the Automatic Analysis of Recursive Security Protocols with XOR
Abstract. In many security protocols, such as group protocols, principals have to perform iterative or recursive computations. We call such protocols recursive protocols. Recently,...
Ralf Küsters, Tomasz Truderung
ISOLA
2010
Springer
14 years 8 months ago
Towards a Connector Algebra
Interoperability of heterogeneous networked systems has yet to reach the maturity required by ubiquitous computing due to the technology-dependent nature of solutions. The Connect ...
Marco Autili, Chris Chilton, Paola Inverardi, Mart...
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
15 years 4 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...