Client-server concurrent zero knowledge with constant rounds and guaranteed complexity

DOI10.1007/978-3-662-44381-1_19MaRDI QIDQ2874545zbMATH OpenOpenAlexFDO

Authors Ran Canetti, Abhishek Jain, Omer Paneth

Publication date 7 August 2014

Published in Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44381-1_19

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Automata, Languages and Programming
• scientific article; zbMATH DE number 1759795
• Lower bounds for concurrent zero knowledge
• scientific article; zbMATH DE number 1418313
• scientific article; zbMATH DE number 1304087

Cited in

(3)

• Random walks and concurrent zero-knowledge
• scientific article; zbMATH DE number 2081079 (Why is no real title available?)
• On Constant-Round Concurrent Zero-Knowledge

This page was built for publication: Client-server concurrent zero knowledge with constant rounds and guaranteed complexity

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