Cryptocomputing with rationals

DOI10.1007/3-540-36504-4_10zbMATH Open1275.94027OpenAlexW1517358265MaRDI QIDQ2995368FDOQ2995368

Jacques Stern, Geert-Jan Wackers, Pierre-Alain Fouque

Publication date: 20 April 2011

Published in: Financial Cryptography (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00565270/file/fc02.pdf

Recommendations

• Advances in homomorphic cryptosystems
• scientific article; zbMATH DE number 1759349
• Publication:4940713
• Homomorphic cryptosystems and their applications.
• scientific article; zbMATH DE number 4057442

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (7)

• Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model
• Linear Bandwidth Naccache-Stern Encryption
• Toward practical privacy-preserving linear regression
• High-Precision Secure Computation of Satellite Collision Probabilities
• Efficient range proofs with transparent setup from bounded integer commitments
• Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers
• A new approach to efficient and secure fixed-point computation

This page was built for publication: Cryptocomputing with rationals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995368)