Sciweavers

403 search results - page 60 / 81
» An algebra for commitment protocols
Sort
View
MKM
2009
Springer
15 years 6 months 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
AC
1998
Springer
15 years 4 months ago
The Search for the Holy Grail in Quantum Cryptography
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...
Louis Salvail
CCS
2008
ACM
15 years 1 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
ICDE
2006
IEEE
185views Database» more  ICDE 2006»
15 years 6 months ago
Don't be a Pessimist: Use Snapshot based Concurrency Control for XML
Currently, only few XML data management systems support concurrent access to an XML document, and if they do, they typically apply variations of hierarchical locking to handle XML...
Zeeshan Sardar, Bettina Kemme
FC
2005
Springer
142views Cryptology» more  FC 2005»
15 years 5 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova