Two-Message, Oblivious Evaluation of Cryptographic Functionalities
From MaRDI portal
Publication:2829963
DOI10.1007/978-3-662-53015-3_22zbMath1406.94046OpenAlexW2484657427MaRDI QIDQ2829963
Nico Döttling, Nils Fleischhacker, Dominique Schröder, Johannes Krupp
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
Related Items (3)
Adaptive oblivious transfer with access control from lattice assumptions ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model ⋮ Lattice-based blind signatures, revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth projective hashing and two-message oblivious transfer
- Definitions and properties of zero-knowledge proof systems
- 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
- Oblivious transfer and polynomial evaluation
- Maliciously Circuit-Private FHE
- From Non-adaptive to Adaptive Pseudorandom Functions
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Semi-homomorphic Encryption and Multiparty Computation
- Short and Stateless Signatures from the RSA Assumption
- Efficient Pseudorandom Functions via On-the-Fly Adaptation
- On the Impossibility of Three-Move Blind Signature Schemes
- Bounded-concurrent secure two-party computation without setup assumptions
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Evaluating Branching Programs on Encrypted Data
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Foundations of Cryptography
- On the Composition of Zero-Knowledge Proof Systems
- Fully homomorphic encryption using ideal lattices
- Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
- Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
- The round complexity of verifiable secret sharing and secure multicast
- Round Optimal Blind Signatures
- Advances in Cryptology – CRYPTO 2004
- Efficient Round Optimal Blind Signatures
- Advances in Cryptology - CRYPTO 2003
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Two-Message, Oblivious Evaluation of Cryptographic Functionalities
