Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428124
Recommendations
- scientific article; zbMATH DE number 1808209
- Semi-homomorphic encryption and multiparty computation
- Scalable and Unconditionally Secure Multiparty Computation
- Multiparty Computation from Somewhat Homomorphic Encryption
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
Cited in
(40)- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Efficient two-party exponentiation from quotient transfer
- \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s
- Efficient implementation of the Orlandi protocol
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Secure multiparty computation from threshold encryption based on class groups
- Privacy-preserving Dijkstra
- \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks
- Reconciling non-malleability with homomorphic encryption
- More constructions of lossy and correlation-secure trapdoor functions
- Efficient RSA key generation and threshold Paillier in the two-party setting
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- Multi-party revocation in sovrin: performance through distributed trust
- On communication-efficient asynchronous MPC with adaptive security
- Efficient RSA key generation and threshold Paillier in the two-party setting
- General composition and universal composability in secure multiparty computation
- Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
- Benaloh's dense probabilistic encryption revisited
- Simplified Threshold RSA with Adaptive and Proactive Security
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
- Multi-party computation with conversion of secret sharing
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
- Better preprocessing for secure multiparty computation
- Adaptively secure MPC with sublinear communication complexity
- Private database access with HE-over-ORAM architecture
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- Efficient one-sided adaptively secure computation
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- A formal treatment of the role of verified compilers in secure computation
- Encryption switching protocols
- Resource fairness and composability of cryptographic protocols
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
- Adaptive security of multi-party protocols, revisited
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- Adaptive oblivious transfer with access control from lattice assumptions
- An improved threshold homomorphic cryptosystem based on class groups
- Threshold structure-preserving signatures
- Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
This page was built for publication: Advances in Cryptology - CRYPTO 2003
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428124)
