Sciweavers

403 search results - page 34 / 81
» An algebra for commitment protocols
Sort
View
APN
1995
Springer
15 years 3 months ago
An Algebraic Semantics for Hierarchical P/T Nets
The first part of this paper gives an algebraic semantics for Place/Transition nets in terms of an algebra which is based on the process algebra ACP. The algebraic semantics is s...
Twan Basten, Marc Voorhoeve
INFOCOM
2009
IEEE
15 years 6 months ago
Routing Metric Designs for Greedy, Face and Combined-Greedy-Face Routing
Abstract—Different geographic routing protocols have different requirements on routing metric designs to ensure proper operation. Combining a wrong type of routing metric with a ...
Yujun Li, Yaling Yang, Xianliang Lu
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
15 years 6 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...
92
Voted
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
16 years 13 days ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
ISOLA
2010
Springer
14 years 10 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...