On the communication complexity of secure function evaluation with long output
From MaRDI portal
Recommendations
- Hiding the input-size in secure two-party computation
- Communication preserving protocols for secure function evaluation
- Rate-1 quantum fully homomorphic encryption
- Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits
- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
Cited in
(72)- Monotone policy BARGs from BARGs and additively homomorphic encryption
- Batching adaptively-sound SNARGs for NP
- Key-homomorphic and aggregate verifiable random functions
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Signature-based witness encryption with compact ciphertext
- On the (In)security of Kilian-based SNARGs
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- On black-box knowledge-sound commit-and-prove SNARKs
- SNARGs for monotone policy batch NP
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- Impossibility of simulation secure functional encryption even with random oracles
- Registration-based encryption: removing private-key generator from IBE
- A simple construction of iO for Turing machines
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Communication preserving protocols for secure function evaluation
- Limits on the power of indistinguishability obfuscation and functional encryption
- Adaptive succinct garbled RAM or: how to delegate your database
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- Breaking the sub-exponential barrier in obfustopia
- Lower bounds for the number of decryption updates in registration-based encryption
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Universal ring signatures in the standard model
- Non-interactive batch arguments for NP from standard assumptions
- Registered (inner-product) functional encryption
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Optimizing registration based encryption
- Maliciously secure massively parallel computation for all-but-one corruptions
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
- Registered attribute-based encryption
- Credibility in private set membership
- Laconic function evaluation for Turing machines
- Non-interactive publicly-verifiable delegation of committed programs
- When KGC meets curator: new paradigm of registered ABE and FE
- Succinct computational secret sharing for monotone circuits
- Succinct witness encryption for batch languages and applications
- Size-Hiding Computation for Multiple Parties
- Simpler constructions of asymmetric primitives from obfuscation
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Correlation intractability and SNARGs from sub-exponential DDH
- How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
- Rate-limited secure function evaluation
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- SNARGs for P from sub-exponential DDH and QR
- Sometimes-decryptable homomorphic encryption from sub-exponential DDH
- Fully homomorphic encryption with chosen-ciphertext security from LWE
- Unbounded distributed broadcast encryption and registered ABE from succinct LWE
- Foundations of platform-assisted auctions
- Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
- Hiding the input-size in secure two-party computation
- Rate-1 fully local somewhere extractable hashing from DDH
- Cryptographic pseudorandom generators can make cryptosystems problematic
- Multi-party threshold private set intersection with sublinear communication
- Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- TinyLabels: how to compress garbled circuit input labels, efficiently
- Simultaneous-message and succinct secure computation
- Laconic private set intersection and applications
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds
- Quasi-linear indistinguishability obfuscation via mathematical proofs of equivalence and applications
- Boosting batch arguments and RAM delegation
- Succinct computational secret sharing
- Somewhere statistically binding commitment schemes with applications
- Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Evolving secret sharing revisited: computational security and succinctness
- Vector and functional commitments from lattices
- Short attribute-based signatures for arbitrary Turing machines from standard assumptions
- Rate-limited secure function evaluation: definitions and constructions
- Adaptively secure garbled circuits from one-way functions
This page was built for publication: On the communication complexity of secure function evaluation with long output
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989027)
