scientific article; zbMATH DE number 1418292
From MaRDI portal
Publication:4941852
zbMath0940.94005MaRDI QIDQ4941852
Publication date: 26 July 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
non-interactivityround complexitymulti-party computationCramer-Shoup cryptosystemoptimally resilient distributed multiplication protocol
Related Items (7)
Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Tag-KEM/DEM: A new framework for hybrid encryption ⋮ Efficient hybrid encryption from ID-based encryption ⋮ Provably secure threshold password-authenticated key exchange ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Secure multiplication of shared secrets in the exponent
This page was built for publication:
