Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428124
DOI10.1007/B11817zbMATH Open1122.94366OpenAlexW2480001466MaRDI QIDQ5428124FDOQ5428124
Jesper Buus Nielsen, Ivan B. Damgård
Publication date: 28 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11817
Recommendations
Cited In (38)
- Multi-party revocation in sovrin: performance through distributed trust
- Threshold structure-preserving signatures
- Simplified Threshold RSA with Adaptive and Proactive Security
- Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Better Preprocessing for Secure Multiparty Computation
- On communication-efficient asynchronous MPC with adaptive security
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks
- Benaloh’s Dense Probabilistic Encryption Revisited
- \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
- Title not available (Why is that?)
- Private Database Access with HE-over-ORAM Architecture
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
- Secure multiparty computation from threshold encryption based on class groups
- More constructions of lossy and correlation-secure trapdoor functions
- Adaptive oblivious transfer with access control from lattice assumptions
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
- Adaptively secure MPC with sublinear communication complexity
- A formal treatment of the role of verified compilers in secure computation
- Privacy-preserving Dijkstra
- Reconciling non-malleability with homomorphic encryption
- Resource fairness and composability of cryptographic protocols
- An improved threshold homomorphic cryptosystem based on class groups
- Encryption Switching Protocols
- 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
- General composition and universal composability in secure multiparty computation
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
- Multi-party computation with conversion of secret sharing
- Efficient one-sided adaptively secure computation
- Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Efficient two-party exponentiation from quotient transfer
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)
