Two-message, oblivious evaluation of cryptographic functionalities

DOI10.1007/978-3-662-53015-3_22zbMATH Open1406.94046OpenAlexW2484657427MaRDI QIDQ2829963FDOQ2829963

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

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

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

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)