Sciweavers

31 search results - page 3 / 7
» Efficient Non-malleable Commitment Schemes
Sort
View
SIGMOD
1995
ACM
132views Database» more  SIGMOD 1995»
15 years 1 months ago
Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks
This paper describes an efficient optimistic concurrency control scheme for use in distributed database systems in which objects are cached and manipulated at client machines whil...
Atul Adya, Robert Gruber, Barbara Liskov, Umesh Ma...
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
Tal Moran, Moni Naor
JUCS
2008
156views more  JUCS 2008»
14 years 9 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng
SCN
2008
Springer
142views Communications» more  SCN 2008»
14 years 9 months ago
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
Yehuda Lindell, Benny Pinkas, Nigel P. Smart
CIC
2006
184views Communications» more  CIC 2006»
14 years 11 months ago
A Data Replication Scheme based on Primary Copy for Ensuring Data Consistency in Mobile Ad hoc Networks
Abstract - A mobile ad hoc network (MANET) is a multihop wireless network capable of autonomous operations. Since MANET causes frequent network partitions, a data replication is co...
Aekyung Moon, Han Namgoong, Hyoungsun Kim, Hyun Ki...