Improved Setup Assumptions for 3-Round Resettable Zero Knowledge

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-30539-2_37
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

Point Obfuscation and 3-Round Zero-Knowledge

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Resettable Cryptography in Constant Rounds – The Case of Zero Knowledge

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Achieving Constant Round Leakage-Resilient Zero-Knowledge

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Knowledge and Assumptions

Philosophical Studies
Philosophy
2011English

Improved Resettable Integrator Control for a Bridgeless Interleaved AC/DC Converter

Turkish Journal of Electrical Engineering and Computer Sciences
Electronic EngineeringElectricalComputer Science
2017English

Interactive Physical Zero-Knowledge Proof for Norinori

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Zero Cost Indexing for Improved Processor Cache Performance

ACM Transactions on Design Automation of Electronic Systems
Computer Science ApplicationsElectronic EngineeringComputer GraphicsElectricalComputer-Aided Design
2006English

Lattice-Based Zero-Knowledge Arguments for Integer Relations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy