scientific article; zbMATH DE number 1842491
From MaRDI portal
Publication:4783725
zbMath1002.94521MaRDI QIDQ4783725
Publication date: 8 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2139/21390171
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
More efficient shuffle argument from unique factorization ⋮ Broadcast-optimal two round MPC with an honest majority ⋮ Tight state-restoration soundness in the algebraic group model ⋮ Generic plaintext equality and inequality proofs ⋮ Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage ⋮ Black-box accumulation based on lattices ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ Cryptography and cryptographic protocols ⋮ What security can we achieve within 4 rounds? ⋮ Private multiparty sampling and approximation of vector combinations ⋮ Transparent SNARKs from DARK compilers ⋮ What Security Can We Achieve Within 4 Rounds? ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Reverse firewalls for actively secure MPCs
This page was built for publication:
