Sciweavers

1019 search results - page 202 / 204
» Cryptographic Design Vulnerabilities
Sort
View
AC
2000
Springer
14 years 9 months ago
State of the art in electronic payment systems
nvented abstract representations of value. As time passed, representations of value became more abstract, progressing from barter through bank notes, payment orders, checks, credit...
N. Asokan, Philippe A. Janson, Michael Steiner, Mi...
RSA
2000
170views more  RSA 2000»
14 years 9 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
TIFS
2010
186views more  TIFS 2010»
14 years 7 months ago
An abuse-free fair contract-signing protocol based on the RSA signature
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
Guilin Wang
PAISI
2010
Springer
14 years 7 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
14 years 7 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...