AttributesValues
type
value
  • This paper constructs unbounded simulation sound proofs for boolean circuit satisfiability under standard assumptions with proof size [Formula: see text] bilinear group elements, where d is the depth and n is the input size of the circuit. Our technical contribution is to add unbounded simulation soundness to a recent NIZK of González and Ràfols (ASIACRYPT’19) with very small overhead. Our new scheme can be used to construct the most efficient Signature-of-Knowledge based on standard assumptions that also can be composed universally with other cryptographic protocols/primitives.
subject
  • Information
  • Business terms
  • Concepts in metaphysics
  • Information science
  • Social information processing
  • Computational complexity theory
  • Asymptotic analysis
  • Economics catchphrases
  • Mathematical notation
  • Cryptographic protocols
  • Information Age
  • Analysis of algorithms
  • Logic in computer science
  • Knowledge economy
  • Digital circuits
part of
is abstract of
is hasSource of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software