Shared generation of pseudo-random functions

DOI10.1016/j.jco.2003.08.021zbMath1058.94017OpenAlexW1964363905WikidataQ62559248 ScholiaQ62559248MaRDI QIDQ1827581

Huaxiong Wang, Josef Pieprzyk

Publication date: 6 August 2004

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2003.08.021

zbMATH Keywords

cryptographysecret sharingaccess structurepseudo-random functionsset-cover problemcumulative mapsresilient collection of sets

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• One way functions and pseudorandom generators
• An explication of secret sharing schemes
• Multiple assignment scheme for sharing secret
• Geometric secret sharing schemes and their duals
• Advances in cryptology - ASIACRYPT 2002. 8th international conference on the theory and application of cryptology and information security, Queenstown, New Zealand, December 1--5, 2002. Proceedings
• Robust and efficient sharing of RSA functions.
• Distributing the encryption and decryption of a block cipher
• How to share a function securely
• Robust Threshold DSS Signatures
• Security of Ramp Schemes
• How to share a secret
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Shared generation of pseudo-random functions