Evaluating 2-DNF formulas on ciphertexts
From MaRDI portal
Recommendations
- Secure voting using partially compatible homomorphisms
- Cryptographic counters and applications to electronic voting
- A generalisation, a simplification and some applications of Paillier's probabilistic public-key system
- Multiplicative homomorphic e-voting
- Fully homomorphic encryption using ideal lattices
Cited in
(only showing first 100 items - show all)- Using abelian varieties to improve pairing-based cryptography
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
- Dual trapdoor identity-based encryption with keyword search
- Privacy-preserving outsourcing of image feature extraction in cloud computing
- Verifiable outsourced ciphertext-policy attribute-based encryption in cloud computing
- Homomorphic secret sharing for low degree polynomials
- Identity-based quotable ring signature
- Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis
- A CCA-secure key-policy attribute-based proxy re-encryption in the adaptive corruption model for dropbox data sharing system
- A new reversible date-hiding algorithm for encrypted images
- Group homomorphic encryption: characterizations, impossibility results, and applications
- Predicate signatures from pair encodings via dual system proof technique
- Fully secure functional encryption with a large class of relations from the decisional linear assumption
- Verifiable single-server private information retrieval from LWE with binary errors
- Private information retrieval with sublinear online time
- Multiparty cardinality testing for threshold private intersection
- A geometric approach to homomorphic secret sharing
- Efficient fully CCA-secure predicate encryptions from pair encodings
- An optimized GHV-type HE scheme: simpler, faster, and more versatile
- PSI-stats: private set intersection protocols supporting secure statistical functions
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
- Encrypted SQL arithmetic functions processing for secure cloud database
- Homomorphic extensions of CRT-based secret sharing
- Privacy preserving multi-party computation delegation for deep learning in cloud computing
- Key-policy attribute-based encryption against continual auxiliary input leakage
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Hierarchical attribute based encryption with continuous leakage-resilience
- Quantum fully homomorphic encryption scheme for cloud privacy data based on quantum circuit
- A taxonomy of pairing-friendly elliptic curves
- One-round secure fair meeting location determination based on homomorphic encryption
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Fully leakage-resilient signatures
- Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
- Reconciling non-malleability with homomorphic encryption
- Threshold public key encryption scheme resilient against continual leakage without random oracles
- Automated analysis of cryptographic assumptions in generic group models
- Improved hidden vector encryption with short ciphertexts and tokens
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- Heuristics of the Cocks-Pinch method
- PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives
- Laconic private set intersection and applications
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- On basing private information retrieval on NP-hardness
- Déjà Q: encore! Un petit IBE
- Minimizing the number of bootstrappings in fully homomorphic encryption
- Privacy-preserving fingerprint authentication resistant to hill-climbing attacks
- Leakage-resilient functional encryption via pair encodings
- Secret handshakes with dynamic expressive matching policy
- Accountable large-universe attribute-based encryption supporting any monotone access structures
- A novel fully homomorphic encryption scheme bsed on LWE
- Non-zero inner product encryption with short ciphertexts and private keys
- Breaking the circuit size barrier for secure computation under DDH
- Structure-preserving signatures and commitments to group elements
- Adaptive oblivious transfer and generalization
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
- Constant-round asynchronous multi-party computation based on one-way functions
- Secure naïve Bayesian classification over encrypted data in cloud
- Transforming hidden vector encryption schemes from composite to prime order groups
- Quadratic Error Minimization in a Distributed Environment with Privacy Preserving
- Benaloh's dense probabilistic encryption revisited
- Sub-linear size traceable ring signatures without random oracles
- Secure data aggregation in wireless sensor networks: homomorphism versus watermarking approach
- Simulatable adaptive oblivious transfer with statistical receiver's privacy
- Anonymous encryption with partial-order subset delegation functionality
- A secure \(M + 1^{\text{st}}\) price auction protocol based on bit slice circuits
- Towards restricting plaintext space in public key encryption
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
- A cryptographic primitive based on hidden-order groups
- Constant size ring signature without random oracle
- Unconditionally anonymous ring and mesh signatures
- Solving discrete logarithm problem in an interval using periodic iterates
- Application of non-associative structures for construction of homomorphic cryptosystems
- Compact E-Cash and Simulatable VRFs Revisited
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
- Efficient Traceable Signatures in the Standard Model
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Fully collusion-resistant traceable key-policy attribute-based encryption with sub-linear size ciphertexts
- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
- Perfect Non-interactive Zero Knowledge for NP
- Compact Group Signatures Without Random Oracles
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Evaluating Branching Programs on Encrypted Data
- Towards Robust Computation on Encrypted Data
- Homomorphic Encryption and Signatures from Vector Decomposition
- A New Protocol for Conditional Disclosure of Secrets and Its Applications
- Another Look at Extended Private Information Retrieval Protocols
- Efficient set operations in the presence of malicious adversaries
- Practical secure naïve Bayesian classification over encrypted big data in cloud
- Computing discrete logarithms in an interval
- Computing interval discrete logarithm problem with restricted jump method
- Homomorphic encryption
- A new distribution version of Boneh-Goh-Nissim cryptosystem : Security and performance analysis
- Pairing-based cryptography
- Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption
- An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers
- Anonymous spatial encryption under affine space delegation functionality with full security
- Efficient computation outsourcing for inverting a class of homomorphic functions
- Lossy identification schemes from decisional RSA
This page was built for publication: Evaluating 2-DNF formulas on ciphertexts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711650)
