Privacy-preserving logical vector clocks using secure computation techniques

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

Volumn 1, Issue , 2007, Pages

  Kerschbaum, Florian ^a   Vayssière, Julien ^b  

^a SAP RESEARCH   (Germany)

^b SAP RESEARCH   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CANNING; CLOCKS; DISTRIBUTED COMPUTER SYSTEMS; VECTORS;

DISTRIBUTED COMPUTATIONS; DISTRIBUTED SYSTEMS; INTERNATIONAL CONFERENCES; LOGICAL CLOCKS; LOGICAL TIMESTAMP; LOGICAL TIMESTAMPS; MESSAGE SENDING; PARALLEL AND DISTRIBUTED SYSTEMS; PRIVACY-PRESERVING; SECURE COMPUTATIONS; SENSITIVE INFORMATIONS; VECTOR CLOCKS;

COMPUTER SYSTEMS;

EID: 48049095494     PISSN: 15219097     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2007.4447773     Document Type: Conference Paper

References (19)

1. M. Ben-Or, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proceedings of the 20th ACM symposium on theory of computing, 1988.
2. I. Damgard, and M. Jurik. A Generalisation, a Simplification and some Applications of Pailliers Probabilistic Public-Key System. Proceedings of International Conference on Theory and Practice of PublicKey Cryptography, 2001.
3. W. Diffie, and M. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory 22(6), 1976.
4. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM 28(6), 1985.
5. O. Goldreich. Secure Multi-party Computation. Available at www.wisdom.weizmann.ac.il/~oded/pp.html, 2002.
6. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. Proceedings of the 19th ACM conference on theory of computing, 1987.
7. S. Goldwasser. Multi party computations: past and present. Proceedings of the 16th ACM symposium on principles of distributed computing, 1997.
8. F. Kerschbaum, and O. Terzidis. Filtering for Private Collaborative Benchmarking. Proceedings of the International Conference on Emerging Trends in Information and Communication Security, 2006.
9. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 1978.
10. F. Mattern. Virtual Time and Global States of Distributed Systems. Proceedings of the International Workshop on Parallel and Distributed Algorithms, 1989.
11. D. Naccache, and J. Stern. A New Public-Key Cryptosystem Based on Higher Residues. Proceedings of the ACM Conference on Computer and Communications Security, 1998.
12. M. Naor, and B. Pinkas. Efficient Oblivious Transfer Protocols. Proceedings of the symposium on data structures and algorithms, 2001.
13. P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Proceedings of EUROCRYPT, 1999.
14. M. Rabin. How to exchange secrets by oblivious transfer. Technical Memo TR-81, Aiken Computation Laboratory, 1981.
15. M. Reiter, and L. Gong. Preventing Denial and Forgery of Causal Relationships in Distributed Systems. Proceedings of the IEEE Symposium on Security and Privacy, 1993.
16. R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21(2), 1978.
17. B. Schneier. Applied Cryptography, 2nd Edition. John Wiley & Sons, 1996.
18. S. Smith, and D. Tygar. Security and Privacy for Partial Order Time. Proceedings of the International Conference on Parallel and Distributed Computing Systems, 1994
19. A. Yao. Protocols for Secure Computations. Proceedings of the IEEE Symposium on foundations of computer science 23, 1982.