Theory of Cryptography
From MaRDI portal
Publication:5711650
DOI10.1007/b106171zbMath1079.94534OpenAlexW4251449056WikidataQ59379672 ScholiaQ59379672MaRDI QIDQ5711650
Eu-Jin Goh, Kobbi Nissim, Dan Boneh
Publication date: 7 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106171
Related Items (only showing first 100 items - show all)
Structure-preserving signatures and commitments to group elements ⋮ Selling multiple secrets to a single buyer ⋮ Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Predicate encryption supporting disjunctions, polynomial equations, and inner products ⋮ Fully Collusion-Resistant Traceable Key-Policy Attribute-Based Encryption with Sub-linear Size Ciphertexts ⋮ Unconditionally anonymous ring and mesh signatures ⋮ A cryptographic primitive based on hidden-order groups ⋮ Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials ⋮ Encrypted SQL arithmetic functions processing for secure cloud database ⋮ Fully leakage-resilient signatures ⋮ Constant Size Ring Signature Without Random Oracle ⋮ 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 ⋮ Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm ⋮ Reconciling non-malleability with homomorphic encryption ⋮ Secret computation of purchase history data using somewhat homomorphic encryption ⋮ Threshold public key encryption scheme resilient against continual leakage without random oracles ⋮ 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 ⋮ Automated analysis of cryptographic assumptions in generic group models ⋮ Spreading alerts quietly and the subgroup escape problem ⋮ Homomorphic extensions of CRT-based secret sharing ⋮ Privacy preserving multi-party computation delegation for deep learning in cloud computing ⋮ Group homomorphic encryption: characterizations, impossibility results, and applications ⋮ Efficient traceable signatures in the standard model ⋮ Improved hidden vector encryption with short ciphertexts and tokens ⋮ Key-policy attribute-based encryption against continual auxiliary input leakage ⋮ Finding composite order ordinary elliptic curves using the Cocks-Pinch method ⋮ 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 ⋮ Efficient set operations in the presence of malicious adversaries ⋮ Laconic private set intersection and applications ⋮ Heuristics of the Cocks-Pinch method ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Homomorphic secret sharing for low degree polynomials ⋮ Hierarchical attribute based encryption with continuous leakage-resilience ⋮ Restricted adaptive oblivious transfer ⋮ Transforming Hidden Vector Encryption Schemes from Composite to Prime Order Groups ⋮ New Communication-Efficient Oblivious Transfer Protocols Based on Pairings ⋮ Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates ⋮ Quadratic Error Minimization in a Distributed Environment with Privacy Preserving ⋮ Quantum fully homomorphic encryption scheme for cloud privacy data based on quantum circuit ⋮ Anonymous spatial encryption under affine space delegation functionality with full security ⋮ Benaloh’s Dense Probabilistic Encryption Revisited ⋮ Efficient computation outsourcing for inverting a class of homomorphic functions ⋮ Identity-based quotable ring signature ⋮ 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 ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ (Leveled) Fully Homomorphic Encryption without Bootstrapping ⋮ Perfect Non-interactive Zero Knowledge for NP ⋮ Compact Group Signatures Without Random Oracles ⋮ Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys ⋮ Towards Robust Computation on Encrypted Data ⋮ Homomorphic Encryption and Signatures from Vector Decomposition ⋮ Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ ⋮ Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis ⋮ One-round secure fair meeting location determination based on homomorphic encryption ⋮ Ciphertext-policy hierarchical attribute-based encryption with short ciphertexts ⋮ On Basing Private Information Retrieval on NP-Hardness ⋮ A CCA-secure key-policy attribute-based proxy re-encryption in the adaptive corruption model for dropbox data sharing system ⋮ Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model ⋮ A new reversible date-hiding algorithm for encrypted images ⋮ Déjà Q: Encore! Un Petit IBE ⋮ Sub-linear Size Traceable Ring Signatures without Random Oracles ⋮ Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption ⋮ Privacy-Preserving Fingerprint Authentication Resistant to Hill-Climbing Attacks ⋮ Secure Data Aggregation in Wireless Sensor Networks: Homomorphism versus Watermarking Approach ⋮ Better security for deterministic public-key encryption: the auxiliary-input setting ⋮ Application of non-associative structures for construction of homomorphic cryptosystems ⋮ 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 ⋮ Verifiable single-server private information retrieval from LWE with binary errors ⋮ Private information retrieval with sublinear online time ⋮ Another Look at Extended Private Information Retrieval Protocols ⋮ Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy ⋮ Anonymous Encryption with Partial-Order Subset Delegation Functionality ⋮ 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 ⋮ A novel fully homomorphic encryption scheme bsed on LWE ⋮ Multiparty cardinality testing for threshold private intersection ⋮ A geometric approach to homomorphic secret sharing ⋮ Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys ⋮ A Secure M + 1st Price Auction Protocol Based on Bit Slice Circuits ⋮ Towards Restricting Plaintext Space in Public Key Encryption ⋮ Using abelian varieties to improve pairing-based cryptography ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits ⋮ Efficient fully CCA-secure predicate encryptions from pair encodings ⋮ Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 ⋮ Breaking the Circuit Size Barrier for Secure Computation Under DDH ⋮ New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts ⋮ Identity-based broadcast encryption with continuous leakage resilience ⋮ An optimized GHV-type HE scheme: simpler, faster, and more versatile ⋮ PSI-stats: private set intersection protocols supporting secure statistical functions ⋮ Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves
This page was built for publication: Theory of Cryptography
