Pages that link to "Item:Q4907580"

The following pages link to Efficient Noninteractive Proof Systems for Bilinear Groups (Q4907580):

Displaying 32 items.

• Tightly secure signatures and public-key encryption (Q300383) (← links)
• Constant-size structure-preserving signatures: generic constructions and simple assumptions (Q321316) (← links)
• An algebraic framework for Diffie-Hellman assumptions (Q514473) (← links)
• IBE with tight security against selective opening and chosen-ciphertext attacks (Q780378) (← links)
• Smooth NIZK arguments (Q1629410) (← links)
• On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
• Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
• Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
• Tightly CCA-secure inner product functional encryption scheme (Q2055966) (← links)
• Aggregatable distributed key generation (Q2056680) (← links)
• Partially structure-preserving signatures: lower bounds, constructions and more (Q2117038) (← links)
• More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds (Q2167723) (← links)
• Continuously non-malleable codes in the split-state model (Q2210446) (← links)
• Efficient fully structure-preserving signatures and shrinking commitments (Q2318093) (← links)
• Non-interactive composition of sigma-protocols via Share-then-Hash (Q2691604) (← links)
• Completeness of Single-Bit Projection-KDM Security for Public Key Encryption (Q2790040) (← links)
• Stronger Security Notions for Decentralized Traceable Attribute-Based Signatures and More Efficient Constructions (Q2790054) (← links)
• Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography (Q2796128) (← links)
• The electronic cash system based on non-interactive zero-knowledge proofs (Q2804880) (← links)
• New Techniques for Non-interactive Shuffle and Range Arguments (Q2822687) (← links)
• Improving Practical UC-Secure Commitments Based on the DDH Assumption (Q2827723) (← links)
• Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming (Q2829954) (← links)
• Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability (Q2946483) (← links)
• How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones (Q2953786) (← links)
• Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting (Q2953791) (← links)
• On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness (Q5041170) (← links)
• Access Control Encryption for Equality, Comparison, and More (Q5738753) (← links)
• Non-malleable Codes with Split-State Refresh (Q5738791) (← links)
• Real Hidden Identity-Based Signatures (Q5854422) (← links)
• Efficient Round-Optimal Blind Signatures in the Standard Model (Q5854440) (← links)
• An efficient identity tracing scheme for blockchain-based systems (Q6057389) (← links)
• Compact structure-preserving signatures with almost tight security (Q6134421) (← links)