The following pages link to (Q3149671):
Displaying 45 items.
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares (Q306248) (← links)
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- Tight bounds for the multiplicative complexity of symmetric functions (Q924152) (← links)
- Distributed anonymous data perturbation method for privacy-preserving data mining (Q1045647) (← links)
- Timed-release computational secret sharing and threshold encryption (Q1692147) (← links)
- Group homomorphic encryption: characterizations, impossibility results, and applications (Q1943979) (← links)
- Multiparty cardinality testing for threshold private intersection (Q2061947) (← links)
- BETA: biometric-enabled threshold authentication (Q2061958) (← links)
- Multi-party threshold private set intersection with sublinear communication (Q2061962) (← links)
- Actively secure setup for SPDZ (Q2072211) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles (Q2128556) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model (Q2170058) (← links)
- Efficient and scalable universal circuits (Q2188968) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- Hardware security without secure hardware: how to decrypt with a password and a server (Q2664944) (← links)
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle (Q2672240) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← 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)
- Better Preprocessing for Secure Multiparty Computation (Q2822679) (← links)
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits (Q2829941) (← links)
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (Q2890015) (← links)
- Quadratic Error Minimization in a Distributed Environment with Privacy Preserving (Q3003497) (← links)
- Identification Schemes from Key Encapsulation Mechanisms (Q3011903) (← links)
- Benaloh’s Dense Probabilistic Encryption Revisited (Q3011926) (← links)
- On Constructing Homomorphic Encryption Schemes from Coding Theory (Q3104683) (← links)
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation (Q3193251) (← links)
- How to deal with malicious users in privacy‐preserving distributed data mining (Q3497744) (← links)
- Asynchronous Multi-Party Computation with Quadratic Communication (Q3519524) (← links)
- Efficient Binary Conversion for Paillier Encrypted Values (Q3593115) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- (Q4625145) (← links)
- Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks (Q4933209) (← links)
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer (Q5025956) (← links)
- Bit-Slice Auction Circuit (Q5030176) (← links)
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) (Q6132407) (← links)
- Towards practical topology-hiding computation (Q6135413) (← links)
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems (Q6158770) (← links)
- Universally composable \(\varSigma \)-protocols in the global random-oracle model (Q6169354) (← links)
- Network-agnostic security comes (almost) for free in DKG and MPC (Q6186588) (← links)
- Secure multiparty computation from threshold encryption based on class groups (Q6186606) (← links)