scientific article; zbMATH DE number 1775426
From MaRDI portal
Publication:4542559
zbMath1028.68016MaRDI QIDQ4542559
Cynthia Dwork, Moni Naor, Amit Sahai
Publication date: 27 January 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (48)
Concurrent knowledge extraction in public-key models ⋮ On the security loss of unique signatures ⋮ A note on the Dwork-Naor timed deniable authentication ⋮ Full and partial deniability for authentication schemes ⋮ A novel deniable authentication protocol using generalized ElGamal signature scheme ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ A new framework for deniable secure key exchange ⋮ Explainable arguments ⋮ Indistinguishable Proofs of Work or Knowledge ⋮ Lower bounds and impossibility results for concurrent self composition ⋮ Concurrently composable non-interactive secure computation ⋮ On constant-round concurrent non-malleable proof systems ⋮ On concurrent multi-party quantum computation ⋮ Individual simulations ⋮ Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model ⋮ Leakproof secret sharing protocols with applications to group identification scheme ⋮ SZK proofs for black-box group problems ⋮ Cryptography and cryptographic protocols ⋮ Timed encryption with application to deniable key exchange ⋮ Quantum deniable authentication protocol ⋮ Random walks and concurrent zero-knowledge ⋮ Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era ⋮ Cryptography Using Captcha Puzzles ⋮ Novel \(\Omega\)-protocols for NP ⋮ Unifying simulatability definitions in cryptographic systems under different timing assumptions ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Lower bounds for non-black-box zero knowledge ⋮ On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits ⋮ Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol ⋮ Collusion-Free Protocols in the Mediated Model ⋮ Completely Non-malleable Encryption Revisited ⋮ The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization ⋮ A new approach for UC security concurrent deniable authentication ⋮ A non-interactive deniable authentication scheme based on designated verifier proofs ⋮ Local Sequentiality Does Not Help for Concurrent Composition ⋮ Ring signatures for deniable AKEM: Gandalf's fellowship ⋮ Resettable statistical zero-knowledge for NP ⋮ A simple protocol for deniable authentication based on ElGamal cryptography ⋮ Resettably Secure Computation ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model ⋮ Designated Confirmer Signatures with Unified Verification ⋮ Private Coins versus Public Coins in Zero-Knowledge Proof Systems ⋮ Improvement of Fan et al.'s deniable authentication protocol based on Diffie-Hellman algorithm ⋮ A new deniable authentication protocol from bilinear pairings ⋮ Adaptively secure distributed public-key systems. ⋮ Generic transformation from broadcast encryption to round-optimal deniable ring authentication
This page was built for publication:
