The following pages link to (Q4318689):
Displaying 22 items.
- Paillier-based publicly verifiable (non-interactive) secret sharing (Q398963) (← links)
- A pairing-based publicly verifiable secret sharing scheme (Q545465) (← links)
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- A key distribution system equivalent to factoring (Q1112781) (← links)
- New efficient and secure protocols for verifiable signature sharing and other applications (Q1582011) (← links)
- PRE: stronger security notions and efficient construction with non-interactive opening (Q2015128) (← links)
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms (Q2167716) (← links)
- Anamorphic encryption: private communication against a dictator (Q2170036) (← links)
- A public key cryptosystem based on a subgroup membership problem (Q2572970) (← links)
- Secret public key schemes (Q2764245) (← links)
- Direct demonstration of the power to break public-key cryptosystems (Q3210169) (← links)
- Robust and Efficient Sharing of RSA Functions (Q3452349) (← links)
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems (Q3777940) (← links)
- On-line secret sharing (Q4608512) (← links)
- A new key escrow cryptosystem (Q5235414) (← links)
- A bivariate polynomial-based cryptographic hard problem and its applications (Q6109708) (← links)
- An efficient publicly verifiable and proactive secret sharing scheme (Q6112179) (← links)
- Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages (Q6125215) (← links)
- Enhanced post-quantum key escrow system for supervised data conflict of interest based on consortium blockchain (Q6173933) (← links)
- Anamorphic encryption, revisited (Q6636496) (← links)
- Anamorphic encryption: new constructions and homomorphic realizations (Q6636498) (← links)
- Limits of black-box anamorphic encryption (Q6648211) (← links)
