How to construct random functions
Journal of the ACM (JACM)
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Identity-based Conference Key Distribution Systems
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
An improved protocol for demonstrating possession of discrete logarithms and some generalizations
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
A modification of the Fiat-Shamir scheme
CRYPTO '88 Proceedings on Advances in cryptology
A secure audio teleconference system
CRYPTO '88 Proceedings on Advances in cryptology
A minimal model for secure computation (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Anonymous Wireless Authentication on a Portable Cellular Mobile System
IEEE Transactions on Computers
Secure audio teleconferencing: a practical solution
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
A number of alternative encryption techniques have been suggested for secure audio teleconferencing implementable on public switched network, in which the centralized facility, called bridge, does not hold any secret. The role of the bridge is to synchronously add simultaneous encrypted signals, modulo some known number, and then transmit the result to all the participants. Each terminal has a secret key, with which it can decrypt the above modular sum of encrypted signals to obtain the desired ordinary sum of cleartext signals. Secrecy of the systems is analyzed. Some of which are provably secure, assuming the existence of one way functions, and for the others we have partial cryptanalysis.We also present a N-party identification and signature systems, based on Fiat and Shamir's single party systems, and another N-party signature system based on discrete-log problem. Our systems have communication complexity 2N times that of the basic Fiat-Shamir systems (as compared to a factor of N2 in the direct application of the basic scheme to all pairs).