Computationally Sound Mechanized Proofs for Deniable Authentication Protocols with a Probabilistic Polynomial Calculus in Computational Model

2011 ◽  
Vol 10 (3) ◽  
pp. 611-625 ◽  
Author(s):  
Bo Meng ◽  
Fei Shao
2006 ◽  
Vol 10 (6) ◽  
pp. 504-506 ◽  
Author(s):  
R.W. Zhu ◽  
D.S. Wong ◽  
C.H. Lee

2012 ◽  
Vol 195-196 ◽  
pp. 992-997
Author(s):  
Da Wei Wei ◽  
Wei Liu ◽  
Xiu Feng Zhao

The notion of deniable authentication is introduced by Dwork et al., deniable authentication protocols allow a sender to authenticate a message for receiver, in a way that the receiver cannot convince a third party that such authentication ever took place. Raimondo et al. present authentication protocol λProj and deniable version Den-λProj by adding challenge-response mechanism. In this paper we prove the protocol λProj without challenge-response is deniable against malicious verifier under subset witness assumption.


2001 ◽  
Vol 148 (2) ◽  
pp. 101-104 ◽  
Author(s):  
X. Deng ◽  
H. Zhu ◽  
C.H. Lee

Sign in / Sign up

Export Citation Format

Share Document