410 likes | 527 Views
A survey of the server-aided verification models. Outline. Introduction Survey: GL05 Survey: Wu08 Survey: Wang10 Survey: Wu11 and Wang11 Conclusion. GL05. Wu08. Wang10. Wu11. Wang11. Introduction. 簡單回顧從 2005 年到 2012 年之間,有關 server-aided verification (SAV) 的文章。. Outline. Introduction
E N D
Outline • Introduction • Survey: GL05 • Survey: Wu08 • Survey: Wang10 • Survey: Wu11 and Wang11 • Conclusion
GL05 Wu08 Wang10 Wu11 Wang11 Introduction • 簡單回顧從2005年到2012年之間,有關server-aided verification (SAV)的文章。
Outline • Introduction • Survey: GL05 • Survey: Wu08 • Survey: Wang10 • Survey: Wu11 and Wang11 • Conclusion
Server-Aided Verification: Theory and Practice Marc Girault and David Lefranc Asiacrypt2005, pp. 605 – 623, 2005 Cites: 16
Definitions • The model of an interactive proof of knowledge
Definitions • Definition 1. Legitimate / Misbehaving / Cheating. • In an interactive proof of knowledge between a prover P and a verifier V, P maybe deviates from the protocol. • : legitimate • : cheating • : misbehaving
Definitions • Definition 2. SAV protocol.
Definitions • Definition 2. SAV protocol. • The protocol is said to be a server-aided verification protocol (SAV) for if: • Auxiliary completeness. • Auxiliary soundness. • Computational saving. • Auxiliary non-repudiation.
Auxiliary Soundness • The final predicate • Hard to know • The final predicate is construction from the predicate by randomizing it, that only the verifier known it. • Hard to solve • The final predicate is construction from the predicate such that the final predicate is computationally hard to solve.
Security model in the case of signature scheme • To proof the soundness of a SAV protocol • Assume
SAV protocol for identification schemes Hard-to-know-based SAV protocol
SAV protocol for identification schemes Hard-to-solve-based SAV protocol
Summary • 提出SAV所需要滿足的安全性條件。 • 延伸原本signature scheme的協定,讓它具有server-aided功能。
Outline • Introduction • Survey: GL05 • Survey: Wu08 • Survey: Wang10 • Survey: Wu11 and Wang11 • Conclusion
Server-Aided Verification Signatures: Definitions and New Constructions Wei Wu, Yi Mu, Willy Susilo, and Xinyi huang ProvSec 2008, pp. 141 – 155, 2008 Cites: 9
Definitions • A signature scheme
Definitions • Requirements • Completeness • Existential unforgeability of • Existential unforgeability under adaptive chose message attacks
Definitions • Requirements • Existential unforgeability of • Setup. C: A: • Queries. A can request qs sign queries. • Output. A outputs a pair and wins this game if
Definitions • A server-aided verification signature scheme • The ordinary signature scheme
Definitions • Requirements • Completeness • Computational saving • Existential unforgeability
Definitions • Requirements • Existential unforgeability of • Setup. C: A: • Queries. A can request the following queries. • qs sign queries • qv server-aided verification queries. • A acts as the server, C acts as the verifier. • Executing SAV-Verify, C returns the result to A at the end for each queries. • Output. A outputs a pair and wins this game if
Definitions • SAV- against Collusion and Adaptive chosen message attacks • Setup. C: A: • Queries. A only need to make server-aided verification queries. • Output. A outputs a message m*. C chooses a random element where is the set of valid signatures of m* as the response. A wins this game if
Summary • 定義SAV的不可偽造性。 • 提出signer與server共謀的攻擊。
Outline • Introduction • Survey: GL05 • Survey: Wu08 • Survey: Wang10 • Survey: Wu11 and Wang11 • Conclusion
Comment on Wu et al.’s Server-aided Verification Signature Scheme Zhiwei Wang, Licheng Wang, Yixian Yang, and Zhengming Hu International Journal of Network Security, Vol. 10, No. 3, pp. 204 – 206, 2010 Cites: 5
New definition of the security of SAV-Σ against collusion and adaptive chosen message attacks • An untrusted server is very likely to collude with a signature forger. • Setup. C: A: • Queries. A can only make qv server-aided verification queries. • Output. A outputs a pair where is chosen by A under (pkf, skf). A wins this game if
Summary • 作者認為Wu等人的攻擊方式不夠詳盡,於是提出一個更新的model,並証明Wu等人的SAV-BLS在這model之下是安全的。
Outline • Introduction • Survey: GL05 • Survey: Wu08 • Survey: Wang10 • Survey: Wu11 and Wang11 • Conclusion
Provably secure server-aided verification signatures Wei Wu, Yi Mu, Willy Susilo, and Xinyi Huang Computer and Mathematics with Applications, pp. 1705 – 1723, 2011. Cites: 4
A new construction of the server-aided verification signature scheme Zhiwei Wang Mathematical and Computer Modeling, Vol. 55, Issues 1 – 2, pp. 97 – 101, 2011 Cites: 1
Outline • Introduction • Survey: GL05 • Survey: Wu08 • Survey: Wang10 • Survey: Wu11 and Wang11 • Conclusion
The different of the definition of the against collusion and ACMA
Conclusions • Models • EUF => Soundness • The different of the definition of the against collusion and ACMA • More rational attack model • Multi-signer • Multi-server • Server collude with a misbehaving verifier