The following pages link to CryptoComputing with Rationals (Q2995368):
Displaying 7 items.
- Efficient range proofs with transparent setup from bounded integer commitments (Q2056793) (← links)
- Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers (Q2200560) (← links)
- High-Precision Secure Computation of Satellite Collision Probabilities (Q2827717) (← links)
- Linear Bandwidth Naccache-Stern Encryption (Q3540055) (← links)
- Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model (Q5087275) (← links)
- Toward practical privacy-preserving linear regression (Q6199734) (← links)
- A new approach to efficient and secure fixed-point computation (Q6547972) (← links)