Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
4
views
9
references
Top references
cited by
15
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,170
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks
other
Author(s):
Mihir Bellare
,
Adriana Palacio
Publication date
(Online):
September 13 2002
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Resource Identification
Most cited references
9
Record
: found
Abstract
: not found
Article
: not found
The Knowledge Complexity of Interactive Proof Systems
Shafi Goldwasser
,
Silvio Micali
,
Charles Rackoff
(1989)
0
comments
Cited
319
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Security Arguments for Digital Signatures and Blind Signatures
David Pointcheval
,
Jacques Stern
(2000)
0
comments
Cited
209
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Zero-knowledge proofs of identity
Amos Fiat
,
Adi Shamir
,
Uriel Feige
(1988)
0
comments
Cited
102
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2002
Publication date (Online):
September 13 2002
Pages
: 162-177
DOI:
10.1007/3-540-45708-9_11
SO-VID:
54478b11-3ab0-45d9-9e18-c30dd6a7a53e
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Essential Algebraic Structure within the AES
pp. 17
Blockwise-Adaptive Attackers Revisiting the (In)Security of Some Provably Secure Encryption Modes: CBC, GEM, IACBC
pp. 31
Tweakable Block Ciphers
pp. 47
The LSD Broadcast Encryption Scheme
pp. 77
Provably Secure Steganography
pp. 93
Flaws in Applying Proof Methodologies to Signature Schemes
pp. 111
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case
pp. 127
On the Security of RSA Encryption in TLS
pp. 143
Security Analysis of IKE’s Signature-Based Key-Exchange Protocol
pp. 162
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks
pp. 178
On 2-Round Secure Multiparty Computation
pp. 194
Private Computation — k-Connected versus 1-Connected Networks
pp. 210
Analysis and Improvements of NTRU Encryption Paddings
pp. 226
Universal Padding Schemes for RSA
pp. 242
Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
pp. 257
Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors
pp. 272
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups
pp. 304
(Not So) Random Shuffles of RC4
pp. 320
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV
pp. 336
Supersingular Abelian Varieties in Cryptology
pp. 369
Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2
pp. 385
Threshold Password-Authenticated Key Exchange
pp. 401
A Threshold Pseudorandom Function Construction and Its Applications
pp. 417
Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products
pp. 433
Hidden Number Problem with the Trace and Bit Security of XTR and LUC
pp. 449
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security
pp. 481
Deniable Ring Authentication
pp. 499
SiBIR: Signer-Base Intrusion-Resilient Signatures
pp. 515
Cryptanalysis of Stream Ciphers with Linear Masking
pp. 533
The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers
pp. 549
A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction
pp. 565
Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks
pp. 581
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
pp. 597
Unique Signatures and Verifiable Random Functions from the DH-DDH Separation
pp. 613
Security Proof for Partial-Domain Hash Signature Schemes
Similar content
3,170
Hash function requirements for Schnorr signatures
Authors:
Gregory Neven
,
Nigel Smart
,
Bogdan Warinschi
Lowness for the Class of Schnorr Random Reals
Authors:
Bjorn Kjos-Hanssen
,
André Nies
,
Frank Stephan
Schnorr trivial reals a construction
Authors:
Johanna Franklin
See all similar
Cited by
25
Lattice Signatures and Bimodal Gaussians
Authors:
Léo Ducas
,
Alain Durmus
,
Tancrède Lepoint
…
Security Proofs for Identity-Based Identification and Signature Schemes
Authors:
Mihir Bellare
,
Chanathip Namprempre
,
Gregory Neven
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
Authors:
Akinori Kawachi
,
Keisuke Tanaka
,
Keita Xagawa
See all cited by