Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
type: Item
instance of: scholarly article
title: Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
author: Yanyan Li
published in: Journal of Automated Reasoning
publication date: 2021-06-09T00:00:00Z
Mathematics Subject Classification ID: 68V15
zbMATH DE Number: 7356981
zbMATH Keywords: cryptography
zbMATH Keywords: sigma protocols
zbMATH Keywords: commitment schemes
zbMATH Keywords: Isabelle/HOL
zbMATH Keywords: provable security
describes a project that uses: EasyCrypt
describes a project that uses: EasyUC
describes a project that uses: Archive Formal Proofs
describes a project that uses: Isabelle/HOL
describes a project that uses: CryptHOL
MaRDI profile type: Publication
full work available at URL: s10817-020-09581-w
OpenAlex ID: W3086061451
cites work: Formal certification of code-based cryptographic proofs
cites work: Computer-Aided Security Proofs for the Working Cryptographer
cites work: CryptHOL: game-based proofs in higher-order logic
cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
cites work: Q3826476
cites work: Constructions and bounds for unconditionally secure non-interactive commitment schemes
cites work: How to simulate it in Isabelle: towards formal proof for secure multi-party computation
cites work: Improved OR-Composition of Sigma-Protocols
cites work: Q4394211
cites work: Q4940695
cites work: Q3212280
cites work: On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Foundations of Cryptography
cites work: Efficient secure two-party protocols. Techniques and constructions
cites work: Concrete Semantics
cites work: Efficient signature generation by smart cards
DOI: 10.1007/S10817-020-09581-W
description: scientific article; zbMATH DE number 7356981