Pages that link to "Item:Q5428124"
From MaRDI portal
The following pages link to Advances in Cryptology - CRYPTO 2003 (Q5428124):
Displaying 37 items.
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- Multi-party computation with conversion of secret sharing (Q664384) (← links)
- Multi-party revocation in sovrin: performance through distributed trust (Q826287) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- More constructions of lossy and correlation-secure trapdoor functions (Q1946593) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Efficient two-party exponentiation from quotient transfer (Q2096636) (← links)
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation (Q2145391) (← links)
- Reconciling non-malleability with homomorphic encryption (Q2408582) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- A formal treatment of the role of verified compilers in secure computation (Q2669248) (← links)
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- On communication-efficient asynchronous MPC with adaptive security (Q2697849) (← links)
- Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems (Q2794490) (← links)
- Private Database Access with HE-over-ORAM Architecture (Q2794501) (← links)
- Better Preprocessing for Secure Multiparty Computation (Q2822679) (← links)
- Encryption Switching Protocols (Q2835592) (← links)
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (Q2890015) (← links)
- Benaloh’s Dense Probabilistic Encryption Revisited (Q3011926) (← links)
- (Q3149671) (← links)
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation (Q3193251) (← links)
- Simplified Threshold RSA with Adaptive and Proactive Security (Q3593121) (← links)
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles (Q3600228) (← links)
- Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values (Q3623058) (← links)
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer (Q5025956) (← links)
- Adaptive oblivious transfer with access control from lattice assumptions (Q5919120) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks (Q6045214) (← links)
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions (Q6134825) (← links)
- \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s (Q6164395) (← links)
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model (Q6488035) (← links)
- Threshold structure-preserving signatures (Q6562572) (← links)
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead (Q6581801) (← links)
- Privacy-preserving Dijkstra (Q6653041) (← links)
- An improved threshold homomorphic cryptosystem based on class groups (Q6660542) (← links)
