Retrieved August 4, 2022, from Chicago All Acronyms. IEEE Transactions on Information Theory, 36(3):553–558, May 1990.Facebook Twitter Linkedin Quote Copy APA All Acronyms. Wiener: Cryptanalysis of Short RSA Secret Exponents. In Advances in Cryptology - EUROCRYPT’ 89, LNCS 434, page 690. Michael Waidner and Birgit Pfitzmann: The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability. ACM Transaction on Computer Systems, 1(1):38–44, February 1983. Communications of the ACM, 21(2):120–126, February 1978.Īdi Shamir: On the Generation of Cryptographically Strong Pseudorandom Sequences. Rivest, Adi Shamir, and Leonard Adleman: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Interner Bericht 22/90, Fakultät für Informatik, Universität Karlsruhe, December 1990. Springer-Verlag, Berlin, 1996.īirgit Pfitzmann and Michael Waidner: Formal Aspects of Fail-stop Signatures. Hildesheimer Informatik-Berichte 16/94, ISSN 0941-3014, Institut für Informatik, UNiversität Hildesheim, June 1994.īirgit Pfitzmann: Digital Signature Schemes - General Framework and Fail-Stop Signatures. to appear in SIAM Journal on Computing, 26(2):291–330, April 1997.īirgit Pfitzmann: Fail-Stop Signatures Without Trees. Pedersen and Birgit Pfitzmann: Fail-Stop Signatures.
#FUMY DEFINITION SOFTWARE#
In 3rd Fast Software Encryption Workshop, LNCS 1039, pages 83–87. In Proceedings of the First International Workshop on Functional Analysis at Trier University, pages 331–342. Kaisa Nyberg: Commutativity in Cryptography. In Advances in Cryptology - CRYPTO’ 92, LNCS 740, pages 15–30. Pedersen, and Birgit Pfitzmann: New Constructions of Fail-Stop Signatures and Lower Bounds. Springer-Verlag, Berlin, 1993.Įugène van Heijst, Torben P.
In Advances in Cryptology - EUROCRYPT’ 92, LNCS 658, pages 366–377.
#FUMY DEFINITION HOW TO#
Pedersen: How to Make Efficient Fail-stop Signatures. Springer-Verlag, Berlin, 1986.Įugène van Heyst and Torben P. In Advances in Cryptology - CRYPTO’ 85, LNCS 218, pages 403–408. Johan Håstad: On Using RSA with Low Exponent in a Public Network. In Advances in Cryptology - CRYPTO’ 94, LNCS 839, pages 234–246.
Springer-Verlag, Berlin, 1996.Ĭynthia Dwork and Moni Naor: An Efficient Existentially Unforgeable Signature Scheme and its Application. In Advances in Cryptology - CRYPTO’ 96, LNCS 1109. Damgård: New Generation of Secure and Practical RSA-Based Signatures. In Advances in Cryptology - CRYPTO’ 96, LNCS 1070, pages 1–9. In 1st ACM Conference on Computer and Communications Security, November 1993, pages 62–73, acm press, New York, 1993.ĭon Coppersmith, Matthew Franklin, Jacques Patarin, and Michael Reiter: Low-Exponent RSA with Related Messages. Mihir Bellare and Phillip Rogaway: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In Advances in Cryptology - EUROCRYPT’ 93, LNCS 765, pages 274–285. Josh Benaloh and Michael de Mare: One-Way Accumulators: A Decentralized Alternative to Digital Signatures. Diplomarbeit, Institut für Informatik, Universität Hildesheim, July 1996. Niko Barić: Digitale Signaturen mit Fail-stop Sicherheit ohne Baumauthentifizierung. This process is experimental and the keywords may be updated as the learning algorithm improves. These keywords were added by machine and not by the authors. In contrast to previous constructions with tree authentication, the length of both this public key and the signatures can be independent of the number of messages that can be signed. As an application, we construct a fail-stop signature scheme in which many one-time public keys are accumulated into one short public key. In this paper, we generalize the definition of accumulators and define and construct a collision-free subtype. However, the one-way property does is not sufficient for all applications. One-way accumulators, introduced by Benaloh and de Mare, can be used to accumulate a large number of values into a single one, which can then be used to authenticate every input value without the need to transmit the others.
0 kommentar(er)
