Sciweavers

783 search results - page 10 / 157
» On security proof of McCullagh
Sort
View
IJNSEC
2008
118views more  IJNSEC 2008»
13 years 9 months ago
Refuting the Security Claims of Mathuria and Jain (2005) Key Agreement Protocols
Despite the importance of proofs in assuring protocol implementers about the security properties of key establishment protocols, many protocol designers fail to provide any proof ...
Kim-Kwang Raymond Choo
CSFW
1999
IEEE
14 years 2 months ago
I/O Automaton Models and Proofs for Shared-Key Communication Systems
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...
Nancy A. Lynch
IACR
2011
97views more  IACR 2011»
12 years 9 months ago
Two-Output Secure Computation with Malicious Adversaries
We present a method to compile Yao’s two-player garbled circuit protocol into one that is secure against malicious adversaries that relies on witness indistinguishability. Our ap...
Abhi Shelat, Chih-Hao Shen
FOCS
1999
IEEE
14 years 2 months ago
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
Amit Sahai
CRYPTO
2006
Springer
109views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
There are several candidate semantically secure encryption schemes, yet in many applications non-malleability of encryptions is crucial. We show how to transform any semantically s...
Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan