scientific article; zbMATH DE number 1808209
From MaRDI portal
Publication:3149671
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
(81)- Distributed anonymous data perturbation method for privacy-preserving data mining
- Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings
- Timed-release computational secret sharing and threshold encryption
- Group homomorphic encryption: characterizations, impossibility results, and applications
- Multiparty cardinality testing for threshold private intersection
- BETA: biometric-enabled threshold authentication
- Multi-party threshold private set intersection with sublinear communication
- Actively secure setup for SPDZ
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- The price of active security in cryptographic protocols
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles
- 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
- Distributing any elliptic curve based protocol
- Efficient and scalable universal circuits
- Threshold properties of prime power subgroups with application to secure integer comparisons
- Efficient RSA key generation and threshold Paillier in the two-party setting
- 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
- MPC with synchronous security and asynchronous responsiveness
- Adaptive security of multi-party protocols, revisited
- On communication-efficient asynchronous MPC with adaptive security
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Better preprocessing for secure multiparty computation
- Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)
- Between a rock and a hard place: interpolating between MPC and FHE
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Active security in multiparty computation over black-box groups
- Multiparty Computation from Somewhat Homomorphic Encryption
- Systematizing secure computation for research and decision support
- Semi-homomorphic encryption and multiparty computation
- Quadratic Error Minimization in a Distributed Environment with Privacy Preserving
- Identification schemes from key encapsulation mechanisms
- Benaloh's dense probabilistic encryption revisited
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- On constructing homomorphic encryption schemes from coding theory
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
- How to deal with malicious users in privacy‐preserving distributed data mining
- Asynchronous Multi-Party Computation with Quadratic Communication
- Efficient implementation of the Orlandi protocol
- Multiparty computation for dishonest majority: from passive to active security at low cost
- Efficient Binary Conversion for Paillier Encrypted Values
- scientific article; zbMATH DE number 1024062 (Why is no real title available?)
- scientific article; zbMATH DE number 1952886 (Why is no real title available?)
- Multikey fully homomorphic encryption and applications
- Perfect verification of modular scheme
- Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
- Bit-slice auction circuit
- Multi-party Indirect Indexing and Applications
- Advances in Cryptology - CRYPTO 2003
- Practical Two-Party Computation Based on the Conditional Gate
- Information Security and Cryptology - ICISC 2005
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- Towards practical topology-hiding computation
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems
- Universally composable -protocols in the global random-oracle model
- Network-agnostic security comes (almost) for free in DKG and MPC
- Secure multiparty computation from threshold encryption based on class groups
- Threshold structure-preserving signatures
- Resource fairness and composability of cryptographic protocols
- Taming adaptivity in YOSO protocols: the modular way
- The price of active security in cryptographic protocols
- Practical and efficient FHE-based MPC
- Network-agnostic multi-party computation revisited (extended abstract)
- Publicly verifiable secret sharing over class groups and applications to DKG and YOSO
- An improved threshold homomorphic cryptosystem based on class groups
- Resolving the efficiency-utility dilemma of threshold linearly homomorphic encryption via message-space adapter
- Fast secure computations on shared polynomials and applications to private set operations
- Quantum (t, n) threshold signature based on shift-code operation and Lagrange unitary operation
- Verification of modular secret sharing
- DRAGON: decentralization at the cost of representation after arbitrary GrOupiNg and its applications to sub-cubic DKG and interactive consistency
- A fundamental domain in the special linear group \(\mathrm{SL}_2(\mathbb{F}_p[x])\) and secret sharing on its basis
- Correction to: ``Actively secure setup for SPDZ
- Towards scalable YOSO MPC via packed secret-sharing
- Is it even possible? On the parallel composition of asynchronous MPC protocols
- Information-theoretic network-agnostic MPC with polynomial communication
- Constant-round YOSO MPC without setup
- Revisiting module lattice-based homomorphic encryption and application to secure-MPC
- Tight bounds for the multiplicative complexity of symmetric functions
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)
