Fast public-key silent OT and more from constrained Naor-Reingold
From MaRDI portal
Publication:6637563
DOI10.1007/978-3-031-58751-1_4MaRDI QIDQ6637563FDOQ6637563
Authors: Dung Bui, Geoffroy Couteau, Pierre-Jean Meyer, Alain Passelègue, Mahshid Riahinia 
Publication date: 13 November 2024
Recommendations
- Efficient pseudorandom correlation generators: silent OT extension and more
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Pseudorandom correlation functions from variable-density LPN, revisited
- Efficient pseudorandom correlation generators from ring-LPN
- Correlated pseudorandomness from expand-accumulate codes
Cites Work
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Multiparty Computation from Somewhat Homomorphic Encryption
- A new approach to practical active-secure two-party computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Public Key Cryptography - PKC 2006
- Advances in Cryptology - CRYPTO 2003
- Efficient Non-interactive Proof Systems for Bilinear Groups
- A dichotomy for local small-bias generators
- On the one-way function candidate proposed by Goldreich
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- On the Security of Goldreich’s One-Way Function
- Title not available (Why is that?)
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Pseudorandom functions and lattices
- Quasi-adaptive NIZK for linear subspaces revisited
- Title not available (Why is that?)
- Bounded CCA2-Secure Encryption
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Learning with rounding, revisited. New reduction, properties and applications
- Fast pseudorandom functions based on expander graphs
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- A Unified Approach to MPC with Preprocessing Using OT
- Efficient constant round multi-party computation combining BMR and SPDZ
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
- Four\(\mathbb {Q}\): four-dimensional decompositions on a \(\mathbb {Q}\)-curve over the Mersenne prime
- On the concrete security of Goldreich's pseudorandom generator
- Revisiting the Concrete Security of Goldreich’s Pseudorandom Generator
- Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- 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
- Reusable two-round MPC from DDH
- 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
- Algebraic attacks against random local functions and their countermeasures
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
- On the fast algebraic immunity of threshold functions
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- An algebraic framework for pseudorandom functions and applications to related-key security
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Indistinguishability obfuscation from well-founded assumptions
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- On the algebraic immunity of direct sum constructions
- Authenticated garbling from simple correlations
- Correlated pseudorandomness from expand-accumulate codes
- Expander-Based Cryptography Meets Natural Proofs
- Constrained pseudorandom functions from homomorphic secret sharing
- Low cost constant round MPC combining BMR and oblivious transfer
- Worst-case subexponential attacks on PRGs of constant degree or constant locality
- Expand-convolute codes for pseudorandom correlation generators from LPN
- A note on non-interactive zero-knowledge from CDH
Cited In (2)
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)
