scientific article
From MaRDI portal
Publication:3149671
zbMath1010.94553MaRDI QIDQ3149671
Jesper Buus Nielsen, Ronald Cramer, Ivan B. Damgård
Publication date: 30 September 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (45)
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ YOSO: You only speak once. Secure MPC with stateless ephemeral roles ⋮ Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares ⋮ A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ Secure multiparty computation with free branching ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Hardware security without secure hardware: how to decrypt with a password and a server ⋮ Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle ⋮ How to deal with malicious users in privacy‐preserving distributed data mining ⋮ Efficient and scalable universal circuits ⋮ Timed-release computational secret sharing and threshold encryption ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ Towards practical topology-hiding computation ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ Group homomorphic encryption: characterizations, impossibility results, and applications ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Secure multiparty computation from threshold encryption based on class groups ⋮ MPC with synchronous security and asynchronous responsiveness ⋮ Asynchronous Multi-Party Computation with Quadratic Communication ⋮ Adaptive security of multi-party protocols, revisited ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Tight bounds for the multiplicative complexity of symmetric functions ⋮ Resource fairness and composability of cryptographic protocols ⋮ Quadratic Error Minimization in a Distributed Environment with Privacy Preserving ⋮ Identification Schemes from Key Encapsulation Mechanisms ⋮ Benaloh’s Dense Probabilistic Encryption Revisited ⋮ Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks ⋮ Efficient Binary Conversion for Paillier Encrypted Values ⋮ Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems ⋮ Better Preprocessing for Secure Multiparty Computation ⋮ Multiparty cardinality testing for threshold private intersection ⋮ BETA: biometric-enabled threshold authentication ⋮ Multi-party threshold private set intersection with sublinear communication ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits ⋮ On Constructing Homomorphic Encryption Schemes from Coding Theory ⋮ Actively secure setup for SPDZ ⋮ Distributed anonymous data perturbation method for privacy-preserving data mining ⋮ Unnamed Item ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback ⋮ Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer ⋮ Bit-Slice Auction Circuit ⋮ The price of active security in cryptographic protocols
This page was built for publication:
