Sciweavers

947 search results - page 96 / 190
» Provable Implementations of Security Protocols
Sort
View
CRYPTO
2007
Springer
93views Cryptology» more  CRYPTO 2007»
15 years 10 months ago
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
Danny Harnik, Yuval Ishai, Eyal Kushilevitz
EUROCRYPT
2004
Springer
15 years 11 months ago
On Generating the Initial Key in the Bounded-Storage Model
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
Stefan Dziembowski, Ueli M. Maurer
SP
2003
IEEE
104views Security Privacy» more  SP 2003»
15 years 11 months ago
Using Replication and Partitioning to Build Secure Distributed Systems
A challenging unsolved security problem is how to specify and enforce system-wide security policies; this problem is even more acute in distributed systems with mutual distrust. T...
Lantian Zheng, Stephen Chong, Andrew C. Myers, Ste...
ISCN
2006
IEEE
16 years 8 days ago
An optimistic fair e-commerce protocol for large e-goods
Suppose two entities that do not trust each other want to exchange some arbitrary data over a public channel. A fair exchange protocol ensures that both parties get what they want ...
Cagil Can Oniz, Erkay Savas, Albert Levi
ATAL
2005
Springer
15 years 11 months ago
Law-governed Linda as a semantics for agent dialogue protocols
Tuple spaces and the associated Linda language are a popular model for distributed computation, and Law-Governed Linda (LGL) is a variant allowing processes to have differential ...
Sylvie Doutre, Peter McBurney, Michael Wooldridge