Back to Results
First PageMeta Content
Non-interactive zero-knowledge proof / Mathematical proof / Zero-knowledge proof / Commitment scheme / Cryptography / Cryptographic protocols / Decision Linear assumption


Groth–Sahai proofs revisited E. Ghadafi, N.P. Smart, and B. Warinschi Dept. Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road,
Add to Reading List

Document Date: 2010-01-17 10:23:34


Open Document

File Size: 212,27 KB

Share Result on Facebook

City

Bristol / /

Company

BT / Bi / /

Country

United Kingdom / /

Currency

pence / /

/

Event

Reorganization / /

Facility

Merchant Venturers Building / University of Bristol / /

Holiday

Assumption / /

IndustryTerm

online manuscript / impractical protocols / non-interactive protocols / oringal online manuscript / cleaner and simpler protocol / countless applications / e-print / e-cash / proof systems / composable oblivious transfer protocols / optimistic fair exchange protocol / garbled-circuit protocol / zero-knowledge proof systems / /

Organization

University of Bristol / CRS / European Union / /

Person

Jens Groth / Wi / Amit Sahai / Ai / /

Position

RT / second author / /

RadioStation

Am 2 / /

Technology

encryption / garbled-circuit protocol / cryptography / cleaner and simpler protocol / non-interactive protocols / universally composable oblivious transfer protocols / optimistic fair exchange protocol / certain protocol / /

SocialTag