Programmable hash functions and their applications
From MaRDI portal
(Redirected from Publication:434345)
Recommendations
- Programmable Hash Functions and Their Applications
- Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
- Short signatures from weaker assumptions
- Programmable hash functions in the multilinear setting
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
Cites work
- scientific article; zbMATH DE number 4057443 (Why is no real title available?)
- scientific article; zbMATH DE number 176568 (Why is no real title available?)
- scientific article; zbMATH DE number 742629 (Why is no real title available?)
- scientific article; zbMATH DE number 1088224 (Why is no real title available?)
- scientific article; zbMATH DE number 1952906 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1759781 (Why is no real title available?)
- scientific article; zbMATH DE number 2086711 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 1406782 (Why is no real title available?)
- scientific article; zbMATH DE number 2204782 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A CDH-Based Ring Signature Scheme with Short Signatures and Public Keys
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A Practical and Tightly Secure Signature Scheme Without Hash Function
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Asymptotically Efficient Lattice-Based Digital Signatures
- Bonsai trees, or how to delegate a lattice basis
- CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption
- Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation Without Random Oracles
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient Authentication from Hard Learning Problems
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient lattice (H)IBE in the standard model
- General Ad Hoc Encryption from Exponent Inversion IBE
- How (not) to design strong-RSA signatures
- Identity-Based Encryption Gone Wild
- Identity-Based Encryption from the Weil Pairing
- Information Security and Privacy
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- Lossy trapdoor functions and their applications
- On the Generic Insecurity of the Full Domain Hash
- Practical Chosen Ciphertext Secure Encryption from Factoring
- Practical Identity-Based Encryption Without Random Oracles
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Security Analysis of the Strong Diffie-Hellman Problem
- Short and Stateless Signatures from the RSA Assumption
- Short signatures from the Weil pairing
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Signatures on randomizable ciphertexts
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- The Cramer-Shoup Strong-RSA Signature Scheme Revisited
- The exact security of digital signatures -- how to sign with RSA and Rabin
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Tight proofs for signature schemes without random oracles
- Trapdoors for hard lattices and new cryptographic constructions
- Zero-knowledge proofs of identity
Cited in
(20)- Programmable hash functions in the multilinear setting
- Lattice-based programmable hash functions and applications
- Implicit zero-knowledge arguments and applications to the malicious setting
- On instantiating the algebraic group model from falsifiable assumptions
- Programmable Hash Functions and Their Applications
- Compact Ring Signature in the Standard Model for Blockchain
- Subversion-resilient signatures: definitions, constructions and applications
- Cryptographic Hash Functions and Some Applications to Information Security
- Practical algorithm substitution attack on extractable signatures
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Short signatures from Diffie-Hellman: realizing almost compact public key
- Anonymous and leakage resilient IBE and IPE
- Short signatures from weaker assumptions
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- Leakage-resilient ring signature schemes
- Parameterized hash functions
- Optimistic fair exchange in the enhanced chosen-key model
- Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
- Efficient digital signatures from RSA without random oracles
This page was built for publication: Programmable hash functions and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q434345)
