| Document Date: 2009-12-04 11:23:33
Open Document File Size: 266,16 KBShare Result on Facebook
City Biel-Bienne / / Company IBM / Zurich Research Laboratory / / Country Switzerland / / / Event FDA Phase / / Facility University of Fribourg / Bern University of Applied Sciences / / IndustryTerm Σ-protocols / larger applications / generic / expected time algorithm / Σ-protocol / probabilistic algorithm / generic homomorphism algorithm / cryptographic applications / cryptographic systems / respective protocols / order / arbitrary generic algorithm / arbitrary Σ-protocols / generic algorithm / party protocol / generic homomorphism algorithms / generic Σprotocols / generic algorithms / generic Σ-protocol / arbitrary groups / generic Σ-protocols / generic black-box algorithm / generic black-box algorithms / / Organization HVZK / Bern University of Applied Sciences / University of Fribourg / / Position knowledge extractor / non-generic knowledge extractor / hypothetical knowledge extractor / respective knowledge extractor / generic group model our efficiency analysis / protocol designer / / Product §2.2 / Hidden-Order Groups Most / / ProgrammingLanguage R / / Technology FO-based protocol / cryptography / arbitrary Σ-protocols / generic Σ-protocol / two-party protocol / generic black-box algorithms / two party protocol / PPT algorithm / expected time algorithm / FO-based protocols / generic Σprotocols / respective protocols / expected PPT algorithm / Generic Black-Box Algorithm / generic algorithm / arbitrary generic algorithm / generic homomorphism algorithms / generic Σ-protocols / using Σ-protocols / PPT algorithms / 2.5 Generic Σ-Protocols / cases FO-based protocols / expected PPT algorithms / probabilistic algorithm / generic homomorphism algorithm / /
SocialTag |
Efficiency Limitations for Σ-Protocols for Group Homomorphisms ? (Full Version) Endre Bangerter1 , Jan Camenisch2 , and Stephan Krenn3 1