scientific article; zbMATH DE number 1775426
From MaRDI portal
Publication:4542559
Recommendations
Cited in
(73)- A non-interactive deniable authentication scheme based on designated verifier proofs
- Hybrid commitments and their applications to zero-knowledge proof systems
- On the security loss of unique signatures
- Adaptively secure distributed public-key systems.
- On constant-round concurrent non-malleable proof systems
- TARDIS: a foundation of time-lock puzzles in UC
- Generic transformation from broadcast encryption to round-optimal deniable ring authentication
- Random walks and concurrent zero-knowledge
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
- Non-uniformly sound certificates with applications to concurrent zero-knowledge
- Scalable zero knowledge with no trusted setup
- Lower bounds and impossibility results for concurrent self composition
- Concurrent zero-knowledge. With additional background by Oded Goldreich
- Novel \(\Omega\)-protocols for NP
- Unifying simulatability definitions in cryptographic systems under different timing assumptions
- Lower bounds for non-black-box zero knowledge
- A new approach for UC security concurrent deniable authentication
- Improvement of Fan et al.'s deniable authentication protocol based on Diffie-Hellman algorithm
- A new deniable authentication protocol from bilinear pairings
- A new framework for deniable secure key exchange
- Individual simulations
- Concurrent knowledge extraction in public-key models
- Local zero knowledge
- On constant-round concurrent zero-knowledge from a knowledge assumption
- Indistinguishable proofs of work or knowledge
- Optimistic concurrent zero knowledge
- Designated confirmer signatures with unified verification
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
- Eye for an eye: efficient concurrent zero-knowledge in the timing model
- Private coins versus public coins in zero-knowledge proof systems
- Implicit zero-knowledge arguments and applications to the malicious setting
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
- Full and partial deniability for authentication schemes
- Efficient Zero Knowledge on the Internet
- Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol
- Collusion-Free Protocols in the Mediated Model
- Local Sequentiality Does Not Help for Concurrent Composition
- Resettably Secure Computation
- scientific article; zbMATH DE number 1302864 (Why is no real title available?)
- Leakproof secret sharing protocols with applications to group identification scheme
- scientific article; zbMATH DE number 2081079 (Why is no real title available?)
- Timed encryption with application to deniable key exchange
- Quantum deniable authentication protocol
- Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
- Cryptography using \texttt{CAPTCHA} puzzles
- Cryptography and cryptographic protocols
- Concurrent and resettable zero-knowledge in poly-logarithmic rounds
- Advances in Cryptology - CRYPTO 2003
- Zaps and Their Applications
- Concurrent zero-knowledge
- Completely Non-malleable Encryption Revisited
- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
- Updatable Zero-Knowledge Databases
- Precise Concurrent Zero Knowledge
- A simple protocol for deniable authentication based on ElGamal cryptography
- Theory of Cryptography
- Automata, Languages and Programming
- Magic adversaries versus individual reduction: science wins either way
- Slow motion zero knowledge identifying with colliding commitments
- Theory of Cryptography
- Explainable arguments
- Concurrently composable non-interactive secure computation
- On concurrent multi-party quantum computation
- Ring signatures for deniable AKEM: Gandalf's fellowship
- Resettable statistical zero-knowledge for NP
- Improved black-box constructions of composable secure computation
- On deniable authentication against malicious verifiers
- On the limits of non-interactive blind signatures
- Lower bounds for concurrent zero knowledge
- A note on the Dwork-Naor timed deniable authentication
- A novel deniable authentication protocol using generalized ElGamal signature scheme
- SZK proofs for black-box group problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542559)
