Sciweavers

604 search results - page 14 / 121
» Efficient Computation of Multiplicative Inverses for Cryptog...
Sort
View
JSC
2008
126views more  JSC 2008»
13 years 6 months ago
Computing singular points of plane rational curves
We compute the singular points of a plane rational curve, parametrically given, using the implicitization matrix derived from the -basis of the curve. It is shown that singularity...
Falai Chen, Wenping Wang, Yang Liu
USS
2010
13 years 5 months ago
ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash
In recent years, many advances have been made in cryptography, as well as in the performance of communication networks and processors. As a result, many advanced cryptographic pro...
Sarah Meiklejohn, C. Christopher Erway, Alptekin K...
ESANN
2008
13 years 9 months ago
Learning Inverse Dynamics: a Comparison
While it is well-known that model can enhance the control performance in terms of precision or energy efficiency, the practical application has often been limited by the complexiti...
Duy Nguyen-Tuong, Jan Peters, Matthias Seeger, Ber...
EUROCRYPT
2000
Springer
13 years 11 months ago
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
Ronald Cramer, Ivan Damgård, Ueli M. Maurer
ASIACRYPT
2007
Springer
13 years 11 months ago
Simple and Efficient Perfectly-Secure Asynchronous MPC
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
Zuzana Beerliová-Trubíniová, ...