Two-Message, Oblivious Evaluation of Cryptographic Functionalities

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-loalgorithm 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 {Ω} (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)