Compressing cryptographic resources. (Extended abstract)

DOI10.1007/3-540-48405-1_37MaRDI QIDQ4941881zbMATH OpenFDO

Authors Niv Gilboa, Yuval Ishai

Publication date 19 July 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48405-1_37

zbMATH Keywords

compressionlinear correlation patternprivate-key cryptosystemprivately correlated pseudo-randomnesspseudo-random functionspseudo-random generators

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• On the power of correlated randomness in secure computation
• Extracting correlations
• Correlation Extractors and Their Applications
• Secure computation based on leaky correlations: high resilience setting
• How to compress interactive communication

Cited in

(10)

• Best possible information-theoretic MPC
• General constructions for information-theoretic private information retrieval
• Efficient fully secure computation via distributed zero-knowledge proofs
• Compression in Finite Fields and Torus-Based Cryptography
• scientific article; zbMATH DE number 67079 (Why is no real title available?)
• CNF-FSS and its applications
• Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
• Compressing unit-vector correlations via sparse pseudorandom generators
• Direct FSS constructions for branching programs and more from PRGs with encoded-output homomorphism
• New results in share conversion, with applications to evolving access structures

This page was built for publication: Compressing cryptographic resources. (Extended abstract)

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