Efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 1998, Pages 67-72

  Gennaro, Rosario ^a   Micciancio, Daniele ^a   Rabin, Tal ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS; SECURITY OF DATA; STATISTICAL METHODS; THEOREM PROVING;

NON-INTERACTIVE STATISTICAL ZERO-KNOWLEDGE PROOF SYSTEMS; QUASI-SAFE PRIME PRODUCTS;

CRYPTOGRAPHY;

EID: 0032218232     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/288090.288108     Document Type: Conference Paper

References (8)