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
13
views
51
references
Top references
cited by
10
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,313
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – EUROCRYPT 2012
Tightly-Secure Signatures from Lossy Identification Schemes
other
Author(s):
Michel Abdalla
,
Pierre-Alain Fouque
,
Vadim Lyubashevsky
,
Mehdi Tibouchi
Publication date
(Print):
2012
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
51
Record
: found
Abstract
: not found
Article
: not found
Security Arguments for Digital Signatures and Blind Signatures
David Pointcheval
,
Jacques Stern
(2000)
0
comments
Cited
207
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Efficient signature generation by smart cards
C.P. Schnorr
(1991)
0
comments
Cited
105
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Ronald L. Rivest
,
Silvio Micali
,
Shafi Goldwasser
(1988)
0
comments
Cited
89
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 572-590
DOI:
10.1007/978-3-642-29011-4_34
SO-VID:
619289da-0dcc-4881-bda5-3adcde002668
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 27
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
pp. 45
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
pp. 117
Identity-Based Encryption Resilient to Continual Auxiliary Leakage
pp. 135
Quantum Proofs of Knowledge
pp. 228
Identity-Based (Lossy) Trapdoor Functions and Applications
pp. 246
Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
pp. 263
Efficient Zero-Knowledge Argument for Correctness of a Shuffle
pp. 318
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
pp. 336
Minimalism in Cryptography: The Even-Mansour Scheme Revisited
pp. 355
Message Authentication, Revisited
pp. 392
Narrow-Bicliques: Cryptanalysis of Full IDEA
pp. 428
Statistical Tools Flavor Side-Channel Collision Attacks
pp. 446
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
pp. 465
Fully Homomorphic Encryption with Polylog Overhead
pp. 502
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
pp. 572
Tightly-Secure Signatures from Lossy Identification Schemes
pp. 591
Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
pp. 609
Scalable Group Signatures with Revocation
pp. 628
Incremental Deterministic Public-Key Encryption
pp. 645
Standard Security Does Not Imply Security against Selective-Opening
pp. 719
Pseudorandom Functions and Lattices
pp. 738
Lattice Signatures without Trapdoors
Similar content
1,313
Distributed control of inverter-based lossy microgrids for power sharing and frequency regulation under voltage constraints
Authors:
Wei Zhang
,
Chin-Yao Chang
A Comprehensive Review: Materials for the Fabrication of Optical Fiber Refractometers Based on Lossy Mode Resonance
Authors:
Aritz Ozcariz
,
Carlos Ruiz-Zamarreño
,
Francisco J. Arregui
Overcoming the Chu lower bound on antenna Q with highly dispersive lossy material
Authors:
Arthur D. Yaghjian
See all similar
Cited by
10
Fully, (Almost) Tightly Secure IBE and Dual System Groups
Authors:
Jie Chen
,
Hoeteck Wee
Tightly-Secure Signatures from Lossy Identification Schemes
Authors:
Michel Abdalla
,
Pierre-Alain Fouque
,
Vadim Lyubashevsky
…
A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model
Authors:
Eike Kiltz
,
Vadim Lyubashevsky
,
Christian Schaffner
See all cited by