Cryptographic agents: towards a unified theory of computing on encrypted data
From MaRDI portal
Recommendations
- Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents
- Functional encryption: definitions and challenges
- How to run Turing machines on encrypted data
- Obfuscation for Cryptographic Purposes
- Candidate indistinguishability obfuscation and functional encryption for all circuits
Cited in
(6)- Specifying and verifying secrecy in workflows with arbitrarily many agents
- Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents
- Functional encryption: deterministic to randomized functions from simple assumptions
- Leakage-Resilient Chosen-Ciphertext Secure Functional Encryption from Garbled Circuits
- CASE: a new frontier in public-key authenticated encryption
- The concrete security of two-party computation: simple definitions, and tight proofs for PSI and OPRFs
This page was built for publication: Cryptographic agents: towards a unified theory of computing on encrypted data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948394)