Results 91 to 100 of about 669 (148)
Why Fiat-Shamir for Proofs Lacks a Proof [PDF]
, 2012 The Fiat-Shamir heuristic (CRYPTO \u2786) is used to convert any 3-message public-coin proof or argument system into a non-interactive argument, by hashing the prover\u27s first message to select the verifier\u27s challenge.
Sanjam Garg, Nir Bitansky, Daniel Wichs
core
Security of signed ELGamal encryption
, 2005 Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against the adaptive chosen ciphertext attack, in which an attacker can freely use
Jakobsson, Markus, Schnorr, Claus Peter
core
A Machine-Checked Correctness Proof for Pastry
, 2018 International audienceProtocols implemented on overlay networks in a peer-to-peer (P2P) setting promise flexibility, performance, and scalability due to the possibility for nodes to join and leave the network while the protocol is running.
Stephan Merz +8 more
core +1 more source
IEEE Open Journal of the Computer SocietyThe rapid advancement of deepfake technology poses risks, including financial fraud and political misinformation, demanding robust methods for verifying image content authenticity.
Atsuki Koyama +3 more
doaj +1 more source
On the Security of Nova Recursive Proof System [PDF]
Nova is a new type of recursive proof system that uses a folding scheme as its core building block. This brilliant idea of folding relations can significantly reduce the recursion overhead.
Hyeonbum Lee, Jae Hong Seo
core
Verification of forward simulations with thread-local, step-local proof obligations [PDF]
This paper presents a proof technique for proving refinements for general state-based models of concurrent systems that reduces proving forward simulations to thread-local, step-local proof obligations.
Reif, Wolfgang +2 more
core +1 more source
SmallWood: Hash-Based Polynomial Commitments and Zero-Knowledge Arguments for Relatively Small Instances [PDF]
Zero-knowledge proofs (ZKPs) are a fundamental building block in cryptography, enabling powerful privacy-preserving and verifiable computations. In the post-quantum era, hash-based ZKPs have emerged as a promising direction due to their conjectured ...
Thibauld Feneuil, Matthieu Rivain
core
Contributions to cryptanalysis: design and analysis of cryptographic hash functions
, 2014 "A cryptographic hash function is a mechanism producing a fixed-length output of a message of arbitrary length. It fullfils a collection of security requirements guaranteeing that a hash function does not introduce any weakness into the system to which ...
Przemysław Szczepan Sokołowski (12304172)
core +1 more source
Permutation-Based Hash Chains with Application to Password Hashing
IACR Transactions on Symmetric CryptologyHash chain based password systems are a useful way to guarantee authentication with one-time passwords. The core idea dates back to Lamport, and is specified in RFC 1760 as S/Key. At CCS 2017, Kogan et al.
Charlotte Lefevre, Bart Mennink
doaj +1 more source
Enhanced Security and Efficiency in Blockchain With Aggregated Zero-Knowledge Proof Mechanisms
IEEE AccessBlockchain technology has emerged as a revolutionary tool in ensuring data integrity and security in digital transactions. However, the current approaches to data verification in blockchain systems, particularly in Ethereum, face challenges in terms of ...
Oleksandr Kuznetsov +5 more
doaj +1 more source