Fast public-key silent OT and more from constrained Naor-Reingold
From MaRDI portal
Publication:6637563
DOI10.1007/978-3-031-58751-1_4MaRDI QIDQ6637563
Dung Bui, Geoffroy Couteau, Mahshid Riahinia, Pierre-Jean Meyer, Alain Passelègue
Publication date: 13 November 2024
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A dichotomy for local small-bias generators
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- On the concrete security of Goldreich's pseudorandom generator
- Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
- Non-interactive zero knowledge from sub-exponential DDH
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Efficient range proofs with transparent setup from bounded integer commitments
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Reusable two-round MPC from DDH
- On the fast algebraic immunity of threshold functions
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- On the algebraic immunity of direct sum constructions
- Designated-verifier pseudorandom generators, and their applications
- Reusable designated-verifier NIZKs for all NP from CDH
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- Efficient pseudorandom correlation generators: silent OT extension and more
- Four $$\mathbb {Q}$$ : Four-Dimensional Decompositions on a $$\mathbb {Q}$$ -curve over the Mersenne Prime
- A Unified Approach to MPC with Preprocessing Using OT
- On the one-way function candidate proposed by Goldreich
- Learning with Rounding, Revisited
- Pseudorandom Functions and Lattices
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Quasi-Adaptive NIZK for Linear Subspaces Revisited
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- Fast Pseudorandom Functions Based on Expander Graphs
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
- An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security
- Bounded CCA2-Secure Encryption
- On the Security of Goldreich’s One-Way Function
- Revisiting the Concrete Security of Goldreich’s Pseudorandom Generator
- Expander-Based Cryptography Meets Natural Proofs
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Algebraic attacks against random local functions and their countermeasures
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Advances in Cryptology - CRYPTO 2003
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Public Key Cryptography - PKC 2006
- Low cost constant round MPC combining BMR and oblivious transfer
- Indistinguishability obfuscation from well-founded assumptions
- Constrained pseudorandom functions from homomorphic secret sharing
- Authenticated garbling from simple correlations
- Worst-case subexponential attacks on PRGs of constant degree or constant locality
- Correlated pseudorandomness from expand-accumulate codes
- Expand-convolute codes for pseudorandom correlation generators from LPN
- A note on non-interactive zero-knowledge from CDH
Related Items (1)
This page was built for publication: Fast public-key silent OT and more from constrained Naor-Reingold
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637563)
