Advances in Cryptology - CRYPTO 2003

DOI10.1007/b11817zbMath1122.94366OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428124

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (31)

Multi-party revocation in sovrin: performance through distributed trust ⋮ Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation ⋮ A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ Reconciling non-malleability with homomorphic encryption ⋮ A formal treatment of the role of verified compilers in secure computation ⋮ \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s ⋮ Secure multiparty computation from threshold encryption based on class groups ⋮ More constructions of lossy and correlation-secure trapdoor functions ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ Adaptive security of multi-party protocols, revisited ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Resource fairness and composability of cryptographic protocols ⋮ Multi-party computation with conversion of secret sharing ⋮ Benaloh’s Dense Probabilistic Encryption Revisited ⋮ Efficient one-sided adaptively secure computation ⋮ Simplified Threshold RSA with Adaptive and Proactive Security ⋮ On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles ⋮ Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems ⋮ Private Database Access with HE-over-ORAM Architecture ⋮ Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Better Preprocessing for Secure Multiparty Computation ⋮ Encryption Switching Protocols ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback ⋮ Efficient two-party exponentiation from quotient transfer ⋮ Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer

This page was built for publication: Advances in Cryptology - CRYPTO 2003