Logics for reasoning about cryptographic constructions
type: Item
instance of: scholarly article
title: Logics for reasoning about cryptographic constructions
zbMATH Open document ID: 1090.68033
author: Russell Impagliazzo
author: Bruce M. Kapron
published in: Journal of Computer and System Sciences
publication date: 2006-04-28T00:00:00Z
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 5021335
zbMATH Keywords: Security protocols
zbMATH Keywords: Cryptographically sound proofs
zbMATH Keywords: Nonstandard arithmetics
MaRDI profile type: MaRDI publication profile
full work available at URL: j.jcss.2005.06.008
OpenAlex ID: W2159543798
cites work: A calculus for cryptographic protocols: The spi calculus
cites work: Reconciling two views of cryptography (The computational soundness of formal encryption)
cites work: Foundations of Security Analysis and Design III
cites work: Q4251022
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: A logic of authentication
cites work: Q3800030
cites work: Q5586401
cites work: Q4133141
cites work: Functional interpretations of feasibly constructive arithmetic
cites work: On the security of public key protocols
cites work: Q4052071
cites work: A logic for reasoning about probabilities
cites work: Q3801804
cites work: Indexings of subrecursive classes
cites work: Theory of Cryptography
cites work: A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols
cites work: Bit commitment using pseudorandomness
cites work: Existence and feasibility in arithmetic
cites work: Theory of Formal Systems. (AM-47)
DOI: 10.1016/J.JCSS.2005.06.008
description: scientific article; zbMATH DE number 5021335