Lattice-based signature and Identity-Based Encryption are well-known cryptographic schemes, and having both efficient and provable secure schemes in the standard model is still a challenging task in light of the current NIST post-quantum competition. We address this problem in this paper by mixing standard IBE scheme, \`a la ABB (EUROCRYPT 2010) on Ring-SIS/LWE assumptions with the efficient trapdoor of Peikert and Micciancio (EUROCRYPT 2012) and we provide an efficient implementation. Our IBE scheme is more efficient than the IBE scheme of Ducas, Lyubashevsky and Prest based on NTRU assumption and is based on more standard assumptions. Although our signature scheme is not as efficient as recent lattice-based schemes based on Fiat-Shamir with Aborts, it is provably secure in the standard model and its efficiency is a few milliseconds.

OCaml implementation of Fiat-Shamir Zero Knowledge Proof system as a client/server authentication protocol

An implementation of the Fiat-Shamir Zero Knowledge Proof algorithm

Simple implementation of Feige-Fiat-Shamir identification protocol in C++

OOP Fiat-Shamir Zero Knowledge Protocol implementation

Merlin is a STROBE-based transcript construction for zero-knowledge proofs. It automates the Fiat-Shamir transform, so that by using Merlin, non-interactive protocols can be implemented as if they were interactive.

Go implementation of non-interactive proofs of knowledge using the fiat-shamir heuristic.

Fiat Shamir Protocol implemented in js

C# OOP implementation of Fiat Shamir Identification Scheme

Non-Interactive Zero-Knowledge Proof implementation using Fiat-Shamir Heuristic and Elliptic Curve Cryptography

Implements the Special Soundness property of the the Fiat-Shamir sigma-protocol

The Legend Finance Nodejs implementation of the Feige-Fiat-Shamir (FFS) zero-knowledge verification protocol.

This is the practical implementation of feige-fiat shamir authentication protocol using C++ socket programming.

Elliptic Curve Cryptography Implementation of Fiat Shamir Heuristic in Zero Knowledge Proof with a Non-Interactive pattern.

A Rust implementation of Non-Interactive Schnorr Zero-Knowledge Discrete Logarithm Proof scheme with a Fiat-Shamir transformation.

Fiat-Shamir implementation in C#

feige fiat shamir implementation using sockets

Fiat-Shamir protocol implemented using TCP server.

Zero-Knowledge Identification Protocol - Feige-Fiat-Shamir Implementation

Implementation of the Fiat-Shamir Identification protocol in C++

Simple implementation of the Feige-Fiat-Shamir Identification Scheme.

JS implementation of the Feige Fiat Shamir identification scheme

Reference implementation of a Fiat-Shamir Signature over NTRU lattices

No description available

A python OOP Implementation of the Fiege Fiat and Shamir Identification Scheme

A simple Zero-Knowledge Proof implementation using the Fiat–Shamir protocol in Python

Implementation of Schnorr's Protocol: interactive zero-knowledge proofs and non-interactive signatures via Fiat-Shamir transform

A research-driven implementation of Schnorr-based zero-knowledge authentication exploring replay resistance, Fiat–Shamir transforms, and real-world protocol trade-offs in Rust.

Several scripts have been developed to implement a demonstration of a Zero Knowledge Proof (ZKP), using the Feige-Fiat-Shamir Identifcation Protocol.

C# implementations of cryptographic algorithms and protocols from university course: - GOST 28147-89 (Magma) - RSA encryption/signing - GOST 34.11-2012 hash - Kerberos protocol simulation - Fiat-Shamir authentication - Shamir's secret sharing - Chaum's blind signature - Ong-Schnorr-Shamir covert channel