Skip to main content
Search

# Secure Multi-Party Computation

2 related articles

Subscribe to updates
  1. arXiv

    One training step's opened values are enough to copy a LoRA adapter: VeilTune moves the forward pass, backpropagation and Adam update into secure multi-party computation

    Existing secure fine-tuning protocols hand the data owner hidden representations or logits from every step, and from those the data owner can copy the provider's LoRA adapter: from the hidden representations of a single mini-batch of 32 samples, the copy agrees with the original on 99.2% of test inputs, and logits alone give about 94%. VeilTune instead runs the forward pass, backpropagation and the Adam update entirely in secure multi-party computation and reveals only the trained adapter to the model owner, averaging 5.3 points above SecP-Tuning on four few-shot tasks with RoBERTa-large and staying within 0.3 to 1.7 points of plaintext training.

  2. arXiv

    Private vector search stops scaling with database size: HNSecW brings online ANN queries to logarithmic time while holding recall at billion scale

    In the symmetric-privacy setting where both the query and the database must stay hidden, HNSecW turns HNSW graph-index approximate nearest neighbor search into a fully data-independent procedure that runs under secure multi-party computation, giving single-query online communication and local computation logarithmic complexity. Earlier protocols of this kind mostly used cluster-based pipelines whose online communication grows linearly with database size. On million- to billion-scale benchmarks, HNSecW keeps recall comparable to plaintext HNSW and reaches up to orders-of-magnitude end-to-end speedup over 2PC PANTHER on a wide-area network.

You’re all caught up