The following pages link to Foundations of Cryptography (Q3655279):
Displaying 43 items.
- Multi-party quantum key agreement by an entangled six-qubit state (Q294000) (← links)
- Rate-limited secure function evaluation (Q329720) (← links)
- Incentive-driven attacker for corrupting two-party protocols (Q1626274) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- Best possible information-theoretic MPC (Q1631330) (← links)
- On multiparty garbling of arithmetic circuits (Q1710662) (← links)
- Quantum bit commitment and the reality of the quantum state (Q1742837) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Oblivious DFA evaluation on joint input and its applications (Q2023228) (← links)
- Secure and efficient multiparty private set intersection cardinality (Q2025374) (← links)
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol (Q2031427) (← links)
- Compact, efficient and UC-secure isogeny-based oblivious transfer (Q2056684) (← links)
- Oblivious transfer is in MiniQCrypt (Q2056751) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)
- Quantum verifiable protocol for secure modulo zero-sum randomness (Q2101598) (← links)
- Anonymous communication protocol over quantum networks (Q2107026) (← links)
- An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
- PSI from PaXoS: fast, malicious private set intersection (Q2119031) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Towards a unified approach to black-box constructions of zero-knowledge proofs (Q2139627) (← links)
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation (Q2145393) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- Secure computation with preprocessing via function secret sharing (Q2175917) (← links)
- Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers (Q2200560) (← links)
- An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks (Q2229283) (← links)
- Formalisation of probabilistic concealment (Q2318502) (← links)
- Secure linear system computation in the presence of malicious adversaries (Q2335946) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- A quantum related-key attack based on the Bernstein-Vazirani algorithm (Q2681588) (← links)
- On the adaptive security of MACs and PRFs (Q2692364) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias (Q2805518) (← links)
- Privacy-Preserving k-Nearest Neighbour Query on Outsourced Database (Q2817461) (← links)
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious (Q3179362) (← links)
- On Quantum Chosen-Ciphertext Attacks and Learning with Errors (Q5089145) (← links)
- Access Control Encryption for Equality, Comparison, and More (Q5738753) (← links)
- Block cipher invariants as eigenvectors of correlation matrices (Q5915627) (← links)
- Tight tradeoffs in searchable symmetric encryption (Q5925503) (← links)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
- Masking primal and dual models for data privacy in network revenue management (Q6112568) (← links)
- Anonymous counting tokens (Q6562569) (← links)
- Scalable multi-party private set union from multi-query secret-shared private membership test (Q6595683) (← links)
