Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

EasyCrypt proof of unsatisfiability of comparison-based definition of non-malleability for commitments

NotificationsYou must be signed in to change notification settings

dfirsov/comparison-based-non-malleabiltiy-unsat

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

This repository contains the EasyCrypt code associated with the paper "D. Firsov, S. Laur, E. Zhuchko.Unsatisfiability of Comparison-Based Non-Malleability for Commitments" published at ICTAC 2022.

Contents

  • checkall - script for running the EasyCrypt proof-checker on the entire development.
  • CNM_unsat.ec - definition of comparison-based non-malleability and the proof of its unsatisfiability:
    • lemma cnm_unsat formalizes Thm. 1 from Sec. 2.1.
  • D1D2.ec,WholeMsg.ec - auxiliary games

Setup

  • For this project we used the developement version of EasyCrypt (1.0) theorem prover with GIT hash: r2022.04-23-gb44893a5
  • EasyCrypt was configured with support from the following SMT solvers: Why3@1.5.0, Z3@4.8.7, CVC4@1.6, Alt-Ergo@2.4.1
  • to check the development run:$> cd DEVELOPMENT_FOLDER && bash checkall

About

EasyCrypt proof of unsatisfiability of comparison-based definition of non-malleability for commitments

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors2

  •  
  •  

[8]ページ先頭

©2009-2025 Movatter.jp