Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
Open Access
- 1 January 2010
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Public-key cryptosystems from the worst-case shortest vector problemPublished by Association for Computing Machinery (ACM) ,2009
- A Framework for Efficient and Composable Oblivious TransferLecture Notes in Computer Science, 2008
- Perfectly-Secure MPC with Linear Communication ComplexityPublished by Springer Science and Business Media LLC ,2008
- Zero-knowledge from secure multiparty computationPublished by Association for Computing Machinery (ACM) ,2007
- On lattices, learning with errors, random linear codes, and cryptographyPublished by Association for Computing Machinery (ACM) ,2005
- Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure ComputationLecture Notes in Computer Science, 2005
- Universally composable security: a new paradigm for cryptographic protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Statistical secrecy and multibit commitmentsIEEE Transactions on Information Theory, 1998
- Communication complexity of secure computation (extended abstract)Published by Association for Computing Machinery (ACM) ,1992
- How to share a secretCommunications of the ACM, 1979