scientific article; zbMATH DE number 2043334
From MaRDI portal
Publication:4450762
zbMath1045.94514MaRDI QIDQ4450762
Publication date: 16 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2727/27270350.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ A verifiable secret shuffle of homomorphic encryptions ⋮ Privacy-preserving Krawtchouk moment feature extraction over encrypted image data ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ How to verifiably encrypt many bits for an election? ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ Public-Key Cryptosystems with Primitive Power Roots of Unity ⋮ An algebraic framework for silent preprocessing with trustless setup and active security ⋮ Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers ⋮ ANOTHER TWIST IN THE DINING CRYPTOGRAPHERS’ PROTOCOL ⋮ Efficient one-sided adaptively secure computation ⋮ CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions ⋮ On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols ⋮ Efficient Binary Conversion for Paillier Encrypted Values ⋮ Communication-Efficient Private Protocols for Longest Common Subsequence ⋮ Optimally Sound Sigma Protocols Under DCRA ⋮ A Simpler Rate-Optimal CPIR Protocol ⋮ Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
This page was built for publication:
