Sciweavers

1286 search results - page 24 / 258
» A Practical Modelling Notation for Secure Distributed Comput...
Sort
View
EUROCRYPT
2007
Springer
13 years 11 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas
PKC
2010
Springer
161views Cryptology» more  PKC 2010»
13 years 9 months ago
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
ded abstract of this paper appears in 13th International Conference on Practice and Theory in Public Key Cryptography (PKC) 2010, Lecture Notes in Computer Science Vol. ?, P. Nguye...
Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, Vi...
ICDCS
2009
IEEE
14 years 4 months ago
Protecting Neighbor Discovery Against Node Compromises in Sensor Networks
The neighborhood information has been frequently used by protocols such as routing in sensor networks. Many methods have been proposed to protect such information in hostile envir...
Donggang Liu
ISORC
2000
IEEE
13 years 12 months ago
Structural and Behavioral Decomposition in Object Oriented Models
The decomposition of large systems into parts is a general principle of software design. Even more, in the scope of distributed systems a partition of the whole system into distri...
Joachim Fischer, Eckhardt Holz, Birger Møll...
CACM
2007
164views more  CACM 2007»
13 years 7 months ago
Is abstraction the key to computing?
ACTION THE KEY TO COMPUTING? Why is it that some software engineers and computer scientists are able to produce clear, elegant designs and programs, while others cannot? Is it poss...
Jeff Kramer