Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities

DOI10.1007/978-3-642-36594-2_15zbMATH Open1315.94081OpenAlexW2136427585MaRDI QIDQ4910282FDOQ4910282

Authors: R. Amzi Jeffs, Mike Rosulek 

Publication date: 18 March 2013

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_15

Recommendations

• Towards characterizing securely computable two-party randomized functions
• scientific article; zbMATH DE number 1497864
• scientific article; zbMATH DE number 2086506
• Designing fully secure protocols for secure two-party computation of constant-domain functions
• Two-message, oblivious evaluation of cryptographic functionalities
• Engineering secure two-party computation protocols. Design, optimization, and applications of efficient secure function evaluation
• Verifiable functional encryption
• Practical design of two-party cryptographic protocols
• Functional Re-encryption and Collusion-Resistant Obfuscation

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (2)

• Homomorphisms preserving neural ideals
• Completeness for symmetric two-party functionalities: revisited

This page was built for publication: Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910282)