scientific article; zbMATH DE number 1808209
From MaRDI portal
Publication:3149671
zbMATH Open1010.94553MaRDI QIDQ3149671FDOQ3149671
Authors: Ronald Cramer, Jesper Buus Nielsen, Ivan B. Damgård 
Publication date: 30 September 2002
Title of this publication is not available (Why is that?)
Recommendations
- Multiparty Computation from Somewhat Homomorphic Encryption
- Advances in Cryptology - CRYPTO 2003
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Semi-homomorphic encryption and multiparty computation
- Secure multiparty computation and secret sharing
- Theory and Practice of Multiparty Computation
- Multiparty Computations in Non-private Environments
- An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
Cited In (66)
- Threshold structure-preserving signatures
- Taming adaptivity in YOSO protocols: the modular way
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems
- Network-agnostic security comes (almost) for free in DKG and MPC
- Secure multiparty computation from threshold encryption based on class groups
- The price of active security in cryptographic protocols
- Network-agnostic multi-party computation revisited (extended abstract)
- Publicly verifiable secret sharing over class groups and applications to DKG and YOSO
- Group homomorphic encryption: characterizations, impossibility results, and applications
- Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
- MPC with synchronous security and asynchronous responsiveness
- Threshold properties of prime power subgroups with application to secure integer comparisons
- Title not available (Why is that?)
- On communication-efficient asynchronous MPC with adaptive security
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles
- Tight bounds for the multiplicative complexity of symmetric functions
- Multi-party Indirect Indexing and Applications
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
- Practical Two-Party Computation Based on the Conditional Gate
- Benaloh's dense probabilistic encryption revisited
- Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings
- Identification schemes from key encapsulation mechanisms
- Between a rock and a hard place: interpolating between MPC and FHE
- Systematizing secure computation for research and decision support
- Information Security and Cryptology - ICISC 2005
- How to deal with malicious users in privacy‐preserving distributed data mining
- Bit-Slice Auction Circuit
- Hardware security without secure hardware: how to decrypt with a password and a server
- Multiparty computation for dishonest majority: from passive to active security at low cost
- Semi-homomorphic encryption and multiparty computation
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- Secure multiparty computation with free branching
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- The price of active security in cryptographic protocols
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
- BETA: biometric-enabled threshold authentication
- Multiparty cardinality testing for threshold private intersection
- Multi-party threshold private set intersection with sublinear communication
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Perfect verification of modular scheme
- Distributed anonymous data perturbation method for privacy-preserving data mining
- Multiparty Computation from Somewhat Homomorphic Encryption
- Multikey fully homomorphic encryption and applications
- Timed-release computational secret sharing and threshold encryption
- Asynchronous Multi-Party Computation with Quadratic Communication
- Quadratic Error Minimization in a Distributed Environment with Privacy Preserving
- Universally composable \(\varSigma \)-protocols in the global random-oracle model
- Actively secure setup for SPDZ
- Resource fairness and composability of cryptographic protocols
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
- Adaptive security of multi-party protocols, revisited
- On constructing homomorphic encryption schemes from coding theory
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Quantum homomorphic encryption for polynomial-sized circuits
- Advances in Cryptology - CRYPTO 2003
- Towards practical topology-hiding computation
- Better preprocessing for secure multiparty computation
- Efficient implementation of the Orlandi protocol
- Efficient Binary Conversion for Paillier Encrypted Values
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Active security in multiparty computation over black-box groups
- Efficient and scalable universal circuits
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3149671)
