Sciweavers

22 search results - page 4 / 5
» Communication Complexity in Algebraic Two-Party Protocols
Sort
View
ACNS
2010
Springer
134views Cryptology» more  ACNS 2010»
13 years 7 months ago
Efficient and Secure Evaluation of Multivariate Polynomials and Applications
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...
Matthew K. Franklin, Payman Mohassel
MKM
2009
Springer
14 years 15 days ago
OpenMath in SCIEnce: SCSCP and POPCORN
In this short communication we want to give an overview of how OpenMath is used in the European project “SCIEnce” [12]. The main aim of this project is to allow unified commun...
Peter Horn, Dan Roozemond
PKC
2007
Springer
124views Cryptology» more  PKC 2007»
14 years 2 days ago
Practical and Secure Solutions for Integer Comparison
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
Juan A. Garay, Berry Schoenmakers, José Vil...
ENTCS
2002
143views more  ENTCS 2002»
13 years 5 months ago
Collecting Statistics over Runtime Executions
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
Bernd Finkbeiner, Sriram Sankaranarayanan, Henny S...
JSAC
2007
102views more  JSAC 2007»
13 years 5 months ago
Partially-coherent distributed space-time codes with differential encoder and decoder
Abstract— Distributed space-time coding is a means of achieving diversity through cooperative communication in a wireless relay network. In this paper, we consider a transmission...
T. Kiran, B. Sundar Rajan