Resettable Cryptography in Constant Rounds – The Case of Zero Knowledge

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-25385-0_21
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Constant-Round Resettable Zero Knowledge With Concurrent Soundness in the Bare Public-Key Model

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Improved Setup Assumptions for 3-Round Resettable Zero Knowledge

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Achieving Constant Round Leakage-Resilient Zero-Knowledge

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Finding Legitimacy for Case Study Knowledge: Introduction to a Trialogue in 4 Rounds

Pragmatic Case Studies in Psychotherapy
2006English

Super-Perfect Zero-Knowledge Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2020English

On the Concrete Complexity of Zero-Knowledge Proofs

English

On the Amortized Complexity of Zero-Knowledge Protocols

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Zero-Knowledge Against Quantum Attacks

SIAM Journal on Computing
MathematicsComputer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy