The following pages link to (Q4542559):
Displaying 43 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Full and partial deniability for authentication schemes (Q352021) (← links)
- Leakproof secret sharing protocols with applications to group identification scheme (Q439799) (← links)
- Timed encryption with application to deniable key exchange (Q477191) (← links)
- Quantum deniable authentication protocol (Q479408) (← links)
- A note on the Dwork-Naor timed deniable authentication (Q845814) (← links)
- A novel deniable authentication protocol using generalized ElGamal signature scheme (Q865908) (← links)
- SZK proofs for black-box group problems (Q929290) (← links)
- A non-interactive deniable authentication scheme based on designated verifier proofs (Q1007888) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- On the security loss of unique signatures (Q1629431) (← links)
- Adaptively secure distributed public-key systems. (Q1853497) (← links)
- On constant-round concurrent non-malleable proof systems (Q1944155) (← links)
- TARDIS: a foundation of time-lock puzzles in UC (Q2056801) (← links)
- Generic transformation from broadcast encryption to round-optimal deniable ring authentication (Q2115719) (← links)
- Random walks and concurrent zero-knowledge (Q2229263) (← links)
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era (Q2229281) (← links)
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits (Q2267359) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- Novel \(\Omega\)-protocols for NP (Q2480118) (← links)
- Unifying simulatability definitions in cryptographic systems under different timing assumptions (Q2484407) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- A new approach for UC security concurrent deniable authentication (Q2519285) (← links)
- Improvement of Fan et al.'s deniable authentication protocol based on Diffie-Hellman algorithm (Q2570708) (← links)
- A new deniable authentication protocol from bilinear pairings (Q2572738) (← links)
- A new framework for deniable secure key exchange (Q2672249) (← links)
- Individual simulations (Q2691606) (← links)
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (Q2945373) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- Designated Confirmer Signatures with Unified Verification (Q3104715) (← links)
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model (Q3392944) (← links)
- Private Coins versus Public Coins in Zero-Knowledge Proof Systems (Q3408218) (← links)
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model (Q3519532) (← links)
- Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol (Q3593091) (← links)
- Collusion-Free Protocols in the Mediated Model (Q3600237) (← links)
- Local Sequentiality Does Not Help for Concurrent Composition (Q3623059) (← links)
- Resettably Secure Computation (Q3627427) (← links)
- Cryptography Using Captcha Puzzles (Q4916003) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Completely Non-malleable Encryption Revisited (Q5445447) (← links)
- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization (Q5445524) (← links)
- A simple protocol for deniable authentication based on ElGamal cryptography (Q5463667) (← links)
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← links)
