Certifying private probabilistic mechanisms
From MaRDI portal
Cites work
- A simple BGN-type cryptosystem from LWE
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- Coin flipping by telephone a protocol for solving impossible problems
- Distance makes the types grow stronger: a calculus for differential privacy
- Efficient constant-round MPC with identifiable abort and public verifiability
- Fairness through awareness
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Higher-order approximate relational refinement types for mechanism design and differential privacy
- Homomorphic encryption for arithmetic of approximate numbers
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- LightDP: towards automating differential privacy proofs
- Linear dependent types for differential privacy
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Reproducibility in learning
- Satisfiability modulo counting
- Succinct functional commitment for a large class of arithmetic circuits
- Testing distributional assumptions of learning algorithms
- Theory of Cryptography
- Tutorials on the foundations of cryptography. Dedicated to Oded Goldreich
- Unifying Zero-Knowledge Proofs of Knowledge
- Vector commitments and their applications
- Verifying the unseen: interactive proofs for label-invariant distribution properties
This page was built for publication: Certifying private probabilistic mechanisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652993)
