Sciweavers

361 search results - page 27 / 73
» Composition of Password-Based Protocols
Sort
View
CRYPTO
1990
Springer
79views Cryptology» more  CRYPTO 1990»
14 years 21 days ago
Fair Computation of General Functions in Presence of Immoral Majority
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
Shafi Goldwasser, Leonid A. Levin
ASIACRYPT
2011
Springer
12 years 8 months ago
BiTR: Built-in Tamper Resilience
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
Seung Geol Choi, Aggelos Kiayias, Tal Malkin
CONCUR
2008
Springer
13 years 10 months ago
Modeling Computational Security in Long-Lived Systems
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
SEFM
2005
IEEE
14 years 2 months ago
On Compatibility and Behavioural Substitutability of Component Protocols
Component Based Development (CBD) aims to facilitate the construction of large-scale applications by supporting the composition of simple building blocks into complex applications...
Nabil Hameurlain
CCS
2001
ACM
14 years 1 months ago
Events in security protocols
The events of a security protocol and their causal dependency can play an important role in the analysis of security properties. This insight underlies both strand spaces and the ...
Federico Crazzolara, Glynn Winskel