Pages that link to "Item:Q6163942"
From MaRDI portal
The following pages link to To label, or not to label (in generic groups) (Q6163942):
Displaying 21 items.
- Labels for non-individuals? (Q812040) (← links)
- On the impossibility of algebraic vector commitments in pairing-free groups (Q6114273) (← links)
- The price of verifiability: lower bounds for verifiable random functions (Q6169431) (← links)
- Beyond Uber: instantiating generic groups via PGGs (Q6169556) (← links)
- An analysis of the algebraic group model (Q6175979) (← links)
- On black-box knowledge-sound commit-and-prove SNARKs (Q6562559) (← links)
- Predicate aggregate signatures and applications (Q6562570) (← links)
- Proof of necessary work: succinct state verification with fairness guarantees (Q6573988) (← links)
- Lower bounds on assumptions behind registration-based encryption (Q6582178) (← links)
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing (Q6582221) (← links)
- Limits in the provable security of ECDSA signatures (Q6587956) (← links)
- Round-robin is optimal: lower bounds for group action based protocols (Q6587957) (← links)
- Algebraic group model with oblivious sampling (Q6587960) (← links)
- The relationship between idealized models under computationally bounded adversaries (Q6605332) (← links)
- Constant-size zk-SNARKs in ROM from falsifiable assumptions (Q6637561) (← links)
- Lower-bounds on public-key operations in PIR (Q6637562) (← links)
- Limits of black-box anamorphic encryption (Q6648211) (← links)
- Generic and algebraic computation models: when AGM proofs transfer to the GGM (Q6652959) (← links)
- Limits on the power of prime-order groups: separating Q-type from static assumptions (Q6652960) (← links)
- On sequential functions and fine-grained cryptography (Q6652975) (← links)
- Quantum complexity for discrete logarithms and related problems (Q6652978) (← links)
