Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(2)
Interactive Proofs
Zero Knowledge
Related Publications
(43)
Zero knowledge proofs of identity
How to Prove Yourself: Practical Solutions to Identification and Signature Problems
Efficient Signature Generation by Smart Cards
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
The knowledge complexity of interactive proof systems
Subscribe
Academic
Publications
A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory
A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory,10.1007/3-540-45961-8_11,Louis C. Guillo
Edit
A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory
(
Citations: 287
)
BibTex
|
RIS
|
RefWorks
Download
Louis C. Guillou
,
Jean-Jacques Quisquater
Zero-knowledge
interactive proofs
are very promising for the problems related to the verification of identity. After their (mainly theoretical) introduction by S. Goldwasser, S. Micali and C. Rackoff (1985), A. Fiat and A. Shamir (1986) proposed a first practical solution: the scheme of Fiat-Shamir is a trade-off between the number of authentication numbers stored in each security microprocessor and the number of witness numbers to be checked at each verification. This paper proposes a new scheme which requires the storage of only one authentication number in each security microprocessor and the check of only one witness number. The needed computations are only 2 or 3 more than for the scheme of Fiat-Shamir.
Conference:
Theory and Application of Cryptographic Techniques - EUROCRYPT
, vol. 330, pp. 123-128, 1988
DOI:
10.1007/3-540-45961-8_11
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.springerlink.com
)
(
www.informatik.uni-trier.de
)
(
link.springer.de
)
Citation Context
(186)
...For example Guillou and Quisquater [
6
] proposed how to lower the bandwidth and memory requirements; Schnorr [7] described an alternative that uses the discrete logarithm problem...
Slawomir Grzonkowski
,
et al.
A privacy-enabled solution for sharing social data in ad-hoc mobile ne...
...Later, satisfactory and practical solutions for IBS schemes were proposed in [2, 3].In [4] Guillou and Quisquater proposed a “paradoxical” IBS using their interactive zeroknowledge protocol in [4,
5
]. An IBS scheme using pairings was first proposed by Sakai, Ohgishi and Kasahara in [6], However they did not present the security analysis in their work...
Anoop Kumar Pandey
,
et al.
Distributed PKG ID based signcryption
...For example Guillou and Quisquater [
51
] proposed how to lower the bandwidth and memory requirements; Schnorr [52] described an alternative that uses the discrete logarithm problem...
Slawomir Grzonkowski
,
et al.
Sharing cloud services: user authentication for social enhancement of ...
...In this paper, we consider public-key trapdoor commitments [
GQ88
, Ped92] which are also homomorphic and length reducing...
...There are also direct constructions of homomorphic trapdoor commitment schemes such as Guillou and Quisquater commitments [
GQ88
] and Pedersen commitments [Ped92]...
Masayuki Abe
,
et al.
Structure-Preserving Signatures and Commitments to Group Elements
...signature scheme that is existentially unforgeable versus adaptivechosenmessageattacks.WecanchoosetheGuillou-Quisquater (GQ) signature scheme which consists of the GQ identification protocol [
18
] made non-interactive using the Fiat-Shamir technique [13], and proven secure in the random oracle model [31]...
...message attacks. For the signature scheme, one could use the Guillou-Quisqater [
18
] signature scheme...
Philip D. MacKenzie
,
et al.
Password-authenticated key exchange based on RSA
Sort by:
Citations
(287)
A privacy-enabled solution for sharing social data in ad-hoc mobile networks
(
Citations: 1
)
Slawomir Grzonkowski
,
Peter M. Corcoran
Published in 2011.
Distributed PKG ID based signcryption
Anoop Kumar Pandey
,
Kumud Ranjan
,
Anant Agarwal
,
Neeraj Kumar
Conference:
Students' Technology Symposium, IEEE - TechSym
, 2011
Sharing cloud services: user authentication for social enhancement of home networking
Slawomir Grzonkowski
,
Peter M. Corcoran
Journal:
IEEE Transactions on Consumer Electronics - IEEE TRANS CONSUM ELECTRON
, vol. 57, no. 3, pp. 1424-1432, 2011
Structure-Preserving Signatures and Commitments to Group Elements
(
Citations: 13
)
Masayuki Abe
,
Georg Fuchsbauer
,
Jens Groth
,
Kristiyan Haralambiev
,
Miyako Ohkubo
Conference:
International Crytology Conference - CRYPTO
, pp. 209-236, 2010
A generalization of Paillier's public-key system with applications to electronic voting
(
Citations: 4
)
Ivan Damgård
,
Mads Jurik
,
Jesper Buus Nielsen
Journal:
International Journal of Information Security
, vol. 9, no. 6, pp. 371-385, 2010