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.
- Efficient and secure attribute-based signature for monotone predicates (Q2406435) (← links)
- Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness (Q2413008) (← links)
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge (Q2416940) (← links)
- QANIZK for adversary-dependent languages and their applications (Q2420581) (← links)
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials (Q2423846) (← links)
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method (Q2430983) (← links)
- Efficient chameleon hash functions in the enhanced collision resistant model (Q2658065) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- Privacy-enhanced remote data integrity checking with updatable timestamp (Q2663494) (← links)
- Hardware security without secure hardware: how to decrypt with a password and a server (Q2664944) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Statistical ZAPs from group-based assumptions (Q2695645) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Laconic private set intersection and applications (Q2697887) (← links)
- Towards tight adaptive security of non-interactive key exchange (Q2697896) (← links)
- Policy-compliant signatures (Q2697898) (← links)
- A CCA-full-anonymous group signature with verifiable controllable linkability in the standard model (Q2697926) (← links)
- Non-Interactive Zero-Knowledge Proofs of Non-Membership (Q2790035) (← links)
- Scalable Divisible E-cash (Q2794505) (← links)
- Reconfigurable Cryptography: A Flexible Approach to Long-Term Security (Q2796136) (← links)
- Multilinear Maps from Obfuscation (Q2796137) (← links)
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (Q2799091) (← links)
- Towards Lightweight Anonymous Entity Authentication for IoT Applications (Q2817466) (← links)
- Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information (Q2817818) (← links)
- A Lattice-Based Group Signature Scheme with Message-Dependent Opening (Q2822670) (← links)
- Offline Witness Encryption (Q2822676) (← links)
- Fiat–Shamir for Highly Sound Protocols Is Instantiable (Q2827720) (← links)
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions (Q2827730) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- Short Attribute-Based Signatures for Threshold Predicates (Q2889994) (← links)
- Plaintext-Checkable Encryption (Q2890016) (← links)
- Generalizing Efficient Multiparty Computation (Q2947520) (← links)
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption (Q2953774) (← links)
- Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions (Q2953781) (← links)
- Structure-Preserving Smooth Projective Hashing (Q2953782) (← links)
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience (Q2958151) (← links)
- Constructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks (Q2975822) (← links)
- A Signature Scheme with Efficient Proof of Validity (Q3005577) (← links)
- Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform (Q3011902) (← links)
- Achieving Optimal Anonymity in Transferable E-Cash with a Judge (Q3011914) (← links)
- Revocable Attribute-Based Signatures with Adaptive Security in the Standard Model (Q3011915) (← links)
- An Analysis of Affine Coordinates for Pairing Computation (Q3059636) (← links)
- Non-interactive Confirmer Signatures (Q3073694) (← links)
- Attribute-Based Signatures (Q3073718) (← links)
- Sub-linear Size Traceable Ring Signatures without Random Oracles (Q3073719) (← links)
- Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes (Q3104713) (← links)
- Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts (Q3181025) (← links)
- Dynamic Threshold Public-Key Encryption with Decryption Consistency from Static Assumptions (Q3194590) (← links)