作者: Michael Backes , Birgit Pfitzmann
关键词:
摘要: Symbolic secrecy of exchanged keys is arguably one the most important notions shown with automated proof tools. It means that an adversary restricted to symbolic operations on terms can never get entire key into its knowledge set. Cryptographic essentially computational indistinguishability between real and a random one, given view much more general adversary.