Two-message, oblivious evaluation of cryptographic functionalities
From MaRDI portal
Recommendations
- Efficient non-interactive secure computation
- Round-optimal secure two-party computation
- 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
- A new approach to practical active-secure two-party computation
- Advances in Cryptology - CRYPTO 2003
- 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 oblivious transfer protocols
- Efficient pseudorandom functions via on-the-fly adaptation
- Efficient Round Optimal Blind Signatures
- 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
- scientific article; zbMATH DE number 4191106 (Why is no real title available?)
- Keyword search and oblivious pseudorandom functions
- Maliciously circuit-private FHE
- Multiparty Computation from Somewhat Homomorphic Encryption
- Oblivious transfer and polynomial evaluation
- Oblivious transfer with adaptive queries
- On 2-round secure multiparty computation
- On the Composition of Zero-Knowledge Proof Systems
- On the concurrent composition of zero-knowledge proofs
- On the impossibility of three-move blind signature schemes
- Parallel coin-tossing and constant-round secure two-party computation
- Priced oblivious transfer: how to sell digital goods
- Round efficiency of multi-party computation with a dishonest majority
- Round optimal blind signatures
- Round-optimal secure two-party computation
- Secure distributed linear algebra in a constant number of rounds
- Secure two-party computation via cut-and-choose oblivious transfer
- Security arguments for digital signatures and blind signatures
- Security of blind digital signatures. (Extended abstract)
- Semi-homomorphic encryption and multiparty computation
- Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case
- Short and Stateless Signatures from the RSA Assumption
- Smooth projective hashing and two-message oblivious transfer
- The round complexity of verifiable secret sharing and secure multicast
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Theory of Cryptography
- Theory of Cryptography
Cited in
(4)
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)