The round complexity of black-box post-quantum secure computation (Q6863916)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8154860
Language Label Description Also known as
default for all languages
No label defined
    English
    The round complexity of black-box post-quantum secure computation
    scientific article; zbMATH DE number 8154860

      Statements

      The round complexity of black-box post-quantum secure computation (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      4 February 2026
      0 references
      multi-party computation
      0 references
      post-quantum
      0 references
      non-malleability
      0 references
      black-box
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers