Minicrypt primitives with algebraic structure and applications

DOI10.1007/s00145-022-09442-2zbMath1506.94018OpenAlexW2952444296MaRDI QIDQ5925579

Navid Alamati, Sikhar Patranabis, Arnab Roy, Hart Montgomery

Publication date: 5 January 2023

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-022-09442-2

zbMATH Keywords

algebraic structurecryptographic complexitycryptomaniafoundations of cryptographyhomomorphic primitivesminicrypt

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limits on the power of garbling techniques for public-key encryption
• From laconic zero-knowledge to public-key cryptography. Extended abstract
• Security arguments for digital signatures and blind signatures
• Anonymous IBE, leakage resilience and circular security from new assumptions
• Two-round multiparty secure computation from minimal assumptions
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• Invisible sanitizable signatures and public-key encryption are equivalent
• Identity-based encryption from the Diffie-Hellman assumption
• Structure vs. hardness through the obfuscation lens
• From selective IBE to full IBE and selective HIBE
• New constructions of identity-based and key-dependent message secure encryption schemes
• Trapdoor functions from the computational Diffie-Hellman assumption
• Efficient range-trapdoor functions and applications: rate-1 OT and more
• Two-round oblivious transfer from CDH or LPN
• Round optimal secure multiparty computation from minimal assumptions
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• Compressible FHE with applications to PIR
• New techniques for efficient trapdoor functions and applications
• Trapdoor hash functions and their applications
• Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
• Probabilistic methods in group theory
• Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
• Lower Bounds on Assumptions Behind Indistinguishability Obfuscation
• On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Key Homomorphic PRFs and Their Applications
• An Algebraic Framework for Diffie-Hellman Assumptions
• Attribute-Based Encryption for Circuits from Multilinear Maps
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
• Notions of Black-Box Reductions, Revisited
• On Homomorphic Encryption and Chosen-Ciphertext Security
• Black-Box Reductions and Separations in Cryptography
• Black-box constructions for secure computation
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Homomorphic Encryption: From Private-Key to Public-Key
• Functional Encryption: Definitions and Challenges
• Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Resettable zero-knowledge (extended abstract)
• Undeniable Signatures
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• Weak Pseudorandom Functions in Minicrypt
• Lossy trapdoor functions and their applications
• Trapdoors for hard lattices and new cryptographic constructions
• On Ideal Lattices and Learning with Errors over Rings
• Generalized Identity Based and Broadcast Encryption Schemes
• Secure Hybrid Encryption from Weakened Key Encapsulation
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Unifying Zero-Knowledge Proofs of Knowledge
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• A Pseudorandom Generator from any One-way Function
• An Identity Based Encryption Scheme Based on Quadratic Residues
• Candidate Multilinear Maps from Ideal Lattices
• The Complexity of Public-Key Cryptography
• Pseudorandom Functions: Three Decades Later
• Fully homomorphic encryption using ideal lattices
• Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
• Breaking the Sub-Exponential Barrier in Obfustopia
• Advances in Cryptology – CRYPTO 2004
• Textbook non-malleable commitments
• Fuzzy Identity-Based Encryption
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Theory of Cryptography
• Automata, Languages and Programming
• On the Power of Hierarchical Identity-Based Encryption
• On lattices, learning with errors, random linear codes, and cryptography
• Theory of Cryptography

This page was built for publication: Minicrypt primitives with algebraic structure and applications