On round-optimal zero knowledge in the bare public-key model

DOI10.1007/978-3-642-29011-4_11MaRDI QIDQ2894406zbMATH OpenOpenAlexFDO

Authors Alessandra Scafuro, Ivan Visconti

Publication date 29 June 2012

Published in Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29011-4_11

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Advances in Cryptology – CRYPTO 2004
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• Automata, Languages and Programming
• Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
• Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model

Cited in

(21)

• Cryptographic reverse firewalls for interactive proof systems
• Random walks and concurrent zero-knowledge
• Individual simulations
• Concurrent knowledge extraction in public-key models
• scientific article; zbMATH DE number 1722687 (Why is no real title available?)
• A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
• Improved OR-composition of sigma-protocols
• Concurrent non-malleable commitments (and more) in 3 rounds
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• Concurrent knowledge extraction in the public-key model
• 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge
• Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption
• Co-sound Zero-Knowledge with Public Keys
• Advances in Cryptology – CRYPTO 2004
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
• Impossibility and Feasibility Results for Zero Knowledge with Public Keys
• Automata, Languages and Programming
• Full round zero-sum distinguishers on \textsf{TinyJAMBU}-128 and \textsf{TinyJAMBU}-192 keyed-permutation in the known-key setting
• Cryptographic reverse firewalls for interactive proof systems
• Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler

This page was built for publication: On round-optimal zero knowledge in the bare public-key model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894406)