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

Most cited references 25

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 321 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Minimum disclosure proofs of knowledge

Gilles Brassard, David Chaum, Claude Crépeau (1988)

0 comments Cited 104 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Conference Proceedings: not found

Pinocchio: Nearly Practical Verifiable Computation

M. Raykova, J. Howell, C. Gentry … (2013)

0 comments Cited 68 times – based on 0 reviews

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2016

Publication date (Online): April 28 2016

Pages: 327-357

DOI: 10.1007/978-3-662-49896-5_12

SO-VID: 47f505c9-452f-4512-ba4c-83b54c6d02aa

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 22

See all cited by

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

Read this book at

Related collections

Indigenous Knowledge

Most cited references 25

The Knowledge Complexity of Interactive Proof Systems

Minimum disclosure proofs of knowledge

Pinocchio: Nearly Practical Verifiable Computation

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 3,648

Cited by 22