↓ Skip to main content

Automata, Languages and Programming

Overview of attention for book
Cover of 'Automata, Languages and Programming'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Differential Privacy
  3. Altmetric Badge
    Chapter 2 The One Way to Quantum Computation
  4. Altmetric Badge
    Chapter 3 Efficient Zero Knowledge on the Internet
  5. Altmetric Badge
    Chapter 4 Independent Zero-Knowledge Sets
  6. Altmetric Badge
    Chapter 5 An Efficient Compiler from Σ-Protocol to 2-Move Deniable Zero-Knowledge
  7. Altmetric Badge
    Chapter 6 New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures
  8. Altmetric Badge
    Chapter 7 Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption
  9. Altmetric Badge
    Chapter 8 Cryptographically Sound Implementations for Communicating Processes
  10. Altmetric Badge
    Chapter 9 A Dolev-Yao-Based Definition of Abuse-Free Protocols
  11. Altmetric Badge
    Chapter 10 Preserving Secrecy Under Refinement
  12. Altmetric Badge
    Chapter 11 Quantifying Information Leakage in Process Calculi
  13. Altmetric Badge
    Chapter 12 Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
  14. Altmetric Badge
    Chapter 13 Generalized Compact Knapsacks Are Collision Resistant
  15. Altmetric Badge
    Chapter 14 An Efficient Provable Distinguisher for HFE
  16. Altmetric Badge
    Chapter 15 A Tight Bound for EMAC
  17. Altmetric Badge
    Chapter 16 Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity
  18. Altmetric Badge
    Chapter 17 On Everlasting Security in the Hybrid Bounded Storage Model
  19. Altmetric Badge
    Chapter 18 On the Impossibility of Extracting Classical Randomness Using a Quantum Computer
  20. Altmetric Badge
    Chapter 19 Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
  21. Altmetric Badge
    Chapter 20 Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
  22. Altmetric Badge
    Chapter 21 Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes
  23. Altmetric Badge
    Chapter 22 A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs
  24. Altmetric Badge
    Chapter 23 Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability
  25. Altmetric Badge
    Chapter 24 An Adaptively Secure Mix-Net Without Erasures
  26. Altmetric Badge
    Chapter 25 Multipartite Secret Sharing by Bivariate Interpolation
  27. Altmetric Badge
    Chapter 26 Identity-Based Encryption Gone Wild
  28. Altmetric Badge
    Chapter 27 Deterministic Priority Mean-Payoff Games as Limits of Discounted Games
  29. Altmetric Badge
    Chapter 28 Recursive Concurrent Stochastic Games
  30. Altmetric Badge
    Chapter 29 Half-Positional Determinacy of Infinite Games
  31. Altmetric Badge
    Chapter 30 A Game-Theoretic Approach to Deciding Higher-Order Matching
  32. Altmetric Badge
    Chapter 31 Descriptive and Relative Completeness of Logics for Higher-Order Functions
  33. Altmetric Badge
    Chapter 32 Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism
  34. Altmetric Badge
    Chapter 33 Typed GoI for Exponentials
  35. Altmetric Badge
    Chapter 34 Commutative Locative Quantifiers for Multiplicative Linear Logic
  36. Altmetric Badge
    Chapter 35 The Wadge Hierarchy of Deterministic Tree Languages
  37. Altmetric Badge
    Chapter 36 Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
  38. Altmetric Badge
    Chapter 37 On Complexity of Grammars Related to the Safety Problem
  39. Altmetric Badge
    Chapter 38 Jumbo λ-Calculus
  40. Altmetric Badge
    Chapter 39 λ-RBAC: Programming with Role-Based Access Control
  41. Altmetric Badge
    Chapter 40 Communication of Two Stacks and Rewriting
  42. Altmetric Badge
    Chapter 41 On the Axiomatizability of Priority
  43. Altmetric Badge
    Chapter 42 A Finite Equational Base for CCS with Left Merge and Communication Merge
  44. Altmetric Badge
    Chapter 43 Theories of HNN-Extensions and Amalgamated Products
  45. Altmetric Badge
    Chapter 44 On Intersection Problems for Polynomially Generated Sets
  46. Altmetric Badge
    Chapter 45 Invisible Safety of Distributed Protocols
  47. Altmetric Badge
    Chapter 46 The Complexity of Enriched μ-Calculi
  48. Altmetric Badge
    Chapter 47 Interpreting Tree-to-Tree Queries
  49. Altmetric Badge
    Chapter 48 Constructing Exponential-Size Deterministic Zielonka Automata
  50. Altmetric Badge
    Chapter 49 Flat Parametric Counter Automata
  51. Altmetric Badge
    Chapter 50 Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
Attention for Chapter 6: New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures
Altmetric Badge

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
11 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures
Chapter number 6
Book title
Automata, Languages and Programming
Published by
Springer Berlin Heidelberg, January 2006
DOI 10.1007/11787006_6
Book ISBNs
978-3-54-035907-4, 978-3-54-035908-1
Authors

Damien Vergnaud

Editors

Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener

Mendeley readers

The data shown below were compiled from readership statistics for 11 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 11 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 4 36%
Professor > Associate Professor 2 18%
Student > Ph. D. Student 1 9%
Researcher 1 9%
Professor 1 9%
Other 0 0%
Unknown 2 18%
Readers by discipline Count As %
Computer Science 8 73%
Mathematics 1 9%
Unknown 2 18%