作者: David Bernhard , Marc Fischlin , Bogdan Warinschi
DOI: 10.1007/978-3-662-46447-2_28
关键词:
摘要: We formalise the notion of adaptive proofs knowledge in random oracle model, where extractor has to recover witnesses for multiple, possibly adaptively chosen statements and proofs. also discuss extensions simulation soundness, as typically required “encrypt-then-prove” construction strongly secure encryption from IND-CPA schemes. Utilizing our model we show three results: (1) Simulation-sound exist. (2) The with a simulation-sound proof yields CCA security. This appears be “folklore” result but which never been proven model. As corollary, obtain new class CCA-secure schemes. (3) We that Fiat-Shamir transformed Schnorr protocol is not implications this limitation.