Two-message, oblivious evaluation of cryptographic functionalities

DOI10.1007/978-3-662-53015-3_22MaRDI QIDQ2829963zbMATH OpenOpenAlexFDO

Authors Nico Döttling, Nils Fleischhacker, Johannes Krupp, Dominique Schröder

Publication date 9 November 2016

Published in Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-53015-3_22

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient non-interactive secure computation
• Advances in Cryptology – CRYPTO 2004
• Constant-round private function evaluation with linear complexity
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Two-round oblivious transfer from CDH or LPN

Cites work

• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• scientific article; zbMATH DE number 4191106 (Why is no real title available?)
• scientific article; zbMATH DE number 1304087 (Why is no real title available?)
• scientific article; zbMATH DE number 1088232 (Why is no real title available?)
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• scientific article; zbMATH DE number 1942420 (Why is no real title available?)
• scientific article; zbMATH DE number 2009981 (Why is no real title available?)
• scientific article; zbMATH DE number 1842488 (Why is no real title available?)
• scientific article; zbMATH DE number 1842491 (Why is no real title available?)
• scientific article; zbMATH DE number 1418318 (Why is no real title available?)
• A new approach to practical active-secure two-party computation
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology – CRYPTO 2004
• Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
• Bounded-concurrent secure two-party computation without setup assumptions
• Concurrent and resettable zero-knowledge in poly-logarithmic rounds
• Definitions and properties of zero-knowledge proof systems
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Efficient Round Optimal Blind Signatures
• Efficient oblivious transfer protocols
• Efficient pseudorandom functions via on-the-fly adaptation
• Evaluating Branching Programs on Encrypted Data
• Foundations of Cryptography
• From non-adaptive to adaptive pseudorandom functions
• Fully homomorphic encryption using ideal lattices
• How to construct constant-round zero-knowledge proof systems for NP
• Maliciously circuit-private FHE
• Multiparty Computation from Somewhat Homomorphic Encryption
• Oblivious transfer and polynomial evaluation
• On the Composition of Zero-Knowledge Proof Systems
• On the impossibility of three-move blind signature schemes
• Round optimal blind signatures
• Secure two-party computation via cut-and-choose oblivious transfer
• Security arguments for digital signatures and blind signatures
• Semi-homomorphic encryption and multiparty computation
• Short and Stateless Signatures from the RSA Assumption
• Smooth projective hashing and two-message oblivious transfer
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The round complexity of verifiable secret sharing and secure multicast
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography

Cited in

(4)

• Efficient round-optimal blind signatures in the standard model
• Adaptive oblivious transfer with access control from lattice assumptions
• Lattice-based blind signatures, revisited
• Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities

This page was built for publication: Two-message, oblivious evaluation of cryptographic functionalities

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