Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
From MaRDI portal
Publication:2031427
DOI10.1007/s10817-020-09581-wOpenAlexW3086061451MaRDI QIDQ2031427
Publication date: 9 June 2021
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-020-09581-w
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient secure two-party protocols. Techniques and constructions
- Efficient signature generation by smart cards
- Constructions and bounds for unconditionally secure non-interactive commitment schemes
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- CryptHOL: game-based proofs in higher-order logic
- Improved OR-Composition of Sigma-Protocols
- Concrete Semantics
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Foundations of Cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
- Computer-Aided Security Proofs for the Working Cryptographer
- Formal certification of code-based cryptographic proofs
This page was built for publication: Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
