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 47

Record: found
Abstract: not found
Book Chapter: not found

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

Pascal Paillier (1999)

0 comments Cited 366 times – based on 0 reviews

Bookmark

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

Bookmark

Record: found
Abstract: not found
Article: not found

Proof verification and the hardness of approximation problems

Sanjeev Arora, Carsten Lund, Rajeev Motwani … (1998)

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

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2013

Pages: 315-333

DOI: 10.1007/978-3-642-36594-2_18

SO-VID: a63e447b-d351-4d3a-b25f-02699b20c92e

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 28

Security and Privacy on Blockchain
Authors: Rui Zhang, Rui Xue, Ling Liu
On the Size of Pairing-Based Non-interactive Arguments
Authors: Jens Groth
Overdrive: Making SPDZ Great Again
Authors: Marcel Keller, Valerio Pastro, Dragos Rotaru

See all cited by

Succinct Non-interactive Arguments via Linear Interactive Proofs

Read this book at

Related collections

Online interactive cancer simulations and demos

Most cited references 47

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

The Knowledge Complexity of Interactive Proof Systems

Proof verification and the hardness of approximation problems

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 5,052

Cited by 28