Pages that link to "Item:Q3183590"

The following pages link to Short and Stateless Signatures from the RSA Assumption (Q3183590):

Displayed 37 items.

• Tightly secure signatures from lossy identification schemes (Q315555) ‎ (← links)
• Programmable hash functions and their applications (Q434345) ‎ (← links)
• A characterization of chameleon hash functions and new, efficient designs (Q484332) ‎ (← links)
• Memory lower bounds of reductions revisited (Q1648781) ‎ (← links)
• Leakage-resilient cryptography from puncturable primitives and obfuscation (Q1710617) ‎ (← links)
• On the tightness of forward-secure signature reductions (Q1715854) ‎ (← links)
• Bonsai trees, or how to delegate a lattice basis (Q1928766) ‎ (← links)
• Subversion-resilient signatures: definitions, constructions and applications (Q1989360) ‎ (← links)
• Efficient digital signatures from RSA without random oracles (Q1999174) ‎ (← links)
• Confined guessing: new signatures from standard assumptions (Q2018822) ‎ (← links)
• Impossibility on tamper-resilient cryptography with uniqueness properties (Q2061927) ‎ (← links)
• A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption (Q2152147) ‎ (← links)
• New methods and abstractions for RSA-based forward secure signatures (Q2229278) ‎ (← links)
• Practical (fully) distributed signatures provably secure in the standard model (Q2354772) ‎ (← links)
• Fully leakage-resilient signatures (Q2392093) ‎ (← links)
• Short signatures from Diffie-Hellman: realizing almost compact public key (Q2408586) ‎ (← links)
• Efficient chameleon hash functions in the enhanced collision resistant model (Q2658065) ‎ (← links)
• On the impossibility of purely algebraic signatures (Q2697897) ‎ (← links)
• Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography (Q2796128) ‎ (← links)
• Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) ‎ (← links)
• New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications (Q2890001) ‎ (← links)
• Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More (Q2890012) ‎ (← links)
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) ‎ (← links)
• Towards Tightly Secure Lattice Short Signature and Id-Based Encryption (Q2953784) ‎ (← links)
• One-Time Signatures and Chameleon Hash Functions (Q3084263) ‎ (← links)
• A Storage Efficient Redactable Signature in the Standard Model (Q3399214) ‎ (← links)
• Obfuscation of Hyperplane Membership (Q3408188) ‎ (← links)
• Realizing Hash-and-Sign Signatures under Standard Assumptions (Q3627443) ‎ (← links)
• Vector Commitments and Their Applications (Q4916001) ‎ (← links)
• Tighter Reductions for Forward-Secure Signature Schemes (Q4916016) ‎ (← links)
• A Framework for Constructing Convertible Undeniable Signatures (Q4933212) ‎ (← links)
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) ‎ (← links)
• Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes (Q5041167) ‎ (← links)
• Fast and Adaptively Secure Signatures in the Random Oracle Model from Indistinguishability Obfuscation (Short Paper) (Q5056035) ‎ (← links)
• Chameleon-Hashes with Ephemeral Trapdoors (Q5738755) ‎ (← links)
• Removing the Strong RSA Assumption from Arguments over the Integers (Q5738979) ‎ (← links)
• The power of undirected rewindings for adaptive security (Q6145931) ‎ (← links)