Pages that link to "Item:Q5458605"
From MaRDI portal
The following pages link to Efficient Non-interactive Proof Systems for Bilinear Groups (Q5458605):
Displayed 50 items.
- Generic Transformation to Strongly Existentially Unforgeable Signature Schemes with Continuous Leakage Resiliency (Q3194598) (← links)
- Constant Size Ring Signature Without Random Oracle (Q3194600) (← links)
- A New Public Remote Integrity Checking Scheme with User Privacy (Q3194614) (← links)
- Compact E-Cash and Simulatable VRFs Revisited (Q3392907) (← links)
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures (Q3392908) (← links)
- Identity Based Group Signatures from Hierarchical Identity-Based Encryption (Q3392909) (← links)
- Efficient Traceable Signatures in the Standard Model (Q3392912) (← links)
- Universally Composable Adaptive Priced Oblivious Transfer (Q3392915) (← links)
- Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting (Q3457062) (← links)
- Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost (Q3457064) (← links)
- Practical Round-Optimal Blind Signatures in the Standard Model (Q3457068) (← links)
- Structure-Preserving Signatures from Standard Assumptions, Revisited (Q3457070) (← links)
- Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions (Q3457071) (← links)
- Anonymous Proxy Signatures (Q3540046) (← links)
- Ambiguous Optimistic Fair Exchange (Q3600366) (← links)
- Universally Composable Adaptive Oblivious Transfer (Q3600373) (← links)
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks (Q3627444) (← links)
- Anonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy Signatures (Q3631371) (← links)
- Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS (Q4916002) (← links)
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages (Q4916015) (← links)
- Tagged One-Time Signatures: Tight Security and Optimal Tag Size (Q4916017) (← links)
- Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures (Q4916021) (← links)
- Verifiable Elections That Scale for Free (Q4916026) (← links)
- Efficient Confirmer Signatures from the “Signature of a Commitment” Paradigm (Q4933213) (← links)
- Verifiable Inner Product Encryption Scheme (Q5041153) (← links)
- Hierarchical Identity-Based Encryption with Tight Multi-challenge Security (Q5041156) (← links)
- Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes (Q5041167) (← links)
- QA-NIZK Arguments of Same Opening for Bilateral Commitments (Q5048959) (← links)
- Signatures of Knowledge for Boolean Circuits Under Standard Assumptions (Q5048960) (← links)
- Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model (Q5087275) (← links)
- Adequate Elliptic Curves for Computing the Product of n Pairings (Q5267791) (← links)
- Efficient Non-interactive Range Proof (Q5323058) (← links)
- Fully Anonymous Group Signatures Without Random Oracles (Q5387098) (← links)
- Sanitizable Signatures Revisited (Q5502753) (← links)
- Access Control Encryption for Equality, Comparison, and More (Q5738753) (← links)
- Improved Structure Preserving Signatures Under Standard Bilinear Assumptions (Q5738756) (← links)
- Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash (Q5738783) (← links)
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts (Q5738790) (← links)
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps (Q5738874) (← links)
- Optimally Sound Sigma Protocols Under DCRA (Q5854433) (← links)
- Continuously non-malleable codes with split-state refresh (Q5915916) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions (Q5919680) (← links)
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures (Q6041296) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q6063130) (← links)
- PAPR: publicly auditable privacy revocation for anonymous credentials (Q6080901) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Multimodal private signatures (Q6104359) (← links)
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs (Q6108830) (← links)