International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR Local Search

Possible queries include homomorphic author:david.
Found 20000 results
Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=1298
Marc Fischlin
Crypto 2005
CRYPTO 2005: Program
https://iacr.org/conferences/crypto2005/program.html
Main Page Call for Papers Contact Info Program Local Info Registration Rump Session BoFs CRYPTO 2005 Program Preliminary - subject to change All events in Campbell Hall (unless otherwise noted) Sunday, August 14, 2005 17:00 -...
CRYPTO 2005: Santa Barbara, California, USA
https://iacr.org/archive/crypto2005/crypto2005.html
Much of the information on this web page was provided courtesy of Michael Ley and the DBLP Project CRYPTO 2005: Santa Barbara, California, USA Victor Shoup, (Ed.): Advances in Cryptology - CRYPTO 2005: 25th Annual...
Adaptive Proofs have Straightline Extractors (in the Random Oracle Model)
Eprint
https://eprint.iacr.org/2015/712
David Bernhard Bogdan Warinschi Ngoc Khanh Nguyen
Abstract. The concept of adaptive security for proofs of knowledge was recently studied by Bernhard et al. They formalised adaptive security in the ROM and showed that the non-interactive version of the Schnorr protocol...
last revised 18 Oct 2016
Non-interactive zero-knowledge proofs in the quantum random oracle model
Eprint
https://eprint.iacr.org/2014/587
Dominique Unruh
We present a construction for non-interactive zero-knowledge proofs of knowledge in the random oracle model from general sigma-protocols. Our construction is secure against quantum adversaries. Prior constructions (by...
received 29 Jul 2014
TCC 2008
https://iacr.org/workshops/tcc2008/program.html
Fifth IACR Theory of Cryptography Conference TCC 2008 March 19-21 2008, New York University New York, USA Home Contact Submissions Call for papers Accepted papers Program Rump Session Special Event Venue Registration...
AsiaCrypt 2013 Accepted Papers
https://iacr.org/conferences/asiacrypt2013/accepted/index.html
ASIACRYPT 2013 Dec 1 - 5 Bangalore, India Accepted Papers Adaptive and Concurrent Secure Computation from New Adaptive, Non-Malleable Commitments Dana Dachman-Soled, Tal Malkin, Mariana Raykova, and Muthuramakrishnan...
IACR EUROCRYPT 2016
https://iacr.org/archive/eurocrypt2016/eurocrypt2016-index-novideo.html
EUROCRYPT 2016: Marc Fischlin and Jean-Sébastien Coron (Eds.): Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques Vienna, Austria, May...
IACR EUROCRYPT 2016
https://iacr.org/archive/eurocrypt2016/eurocrypt2016-index.html
EUROCRYPT 2016: Marc Fischlin and Jean-Sébastien Coron (Eds.): Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques Vienna, Austria, May...
Theory of Cryptography 2008
https://iacr.org/archive/tcc2008/tcc2008.html
Much of the information on this web page was provided courtesy of Michael Ley and the DBLP Project TCC 2008: New York, NY, USA Ran Canetti (Ed.): Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New...
Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Proprocessing
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=2248
Ivan Damgård
Eurocrypt 1992
IACR EUROCRYPT 2015
https://iacr.org/archive/eurocrypt2015/eurocrypt2015-index.html
EUROCRYPT 2015: Elisabeth Oswald and Marc Fischlin (Eds.): Advances in Cryptology - EUROCRYPT 2015 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques Sofia, Bulgaria, April 26-30,...
Efficient Designated-Verifier Non-Interactive Zero-Knowledge Proofs of Knowledge
Eprint
https://eprint.iacr.org/2017/1029
Pyrros Chaidos Geoffroy Couteau
We propose a framework for constructing efficient designated-verifier non-interactive zero-knowledge proofs (DVNIZK) for a wide class of algebraic languages over abelian groups, under standard assumptions. The proofs obtained...
last revised 28 Mar 2018
Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=28558
Pyrros Chaidos Geoffroy Couteau
Eurocrypt 2018
Minimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption
Eprint
https://eprint.iacr.org/2011/012
Jens Groth
A non-interactive zero-knowledge proof can be used to demonstrate the truth of a statement without revealing anything else. It has been shown under standard cryptographic assumptions that non-interactive zero-knowledge proofs...
received 6 Jan 2011
AsiaCrypt 2013 Program
https://iacr.org/conferences/asiacrypt2013/program/index.html
ASIACRYPT 2013 Dec 1 - 5 Bangalore, India Program at a glance Sunday, December 1 -- Reception @ JW Marriott Monday, December 2 Tuesday, December 3 Wednesday, December 4 Thursday, December 5 Session 1 Zero-Knowledge Theoretical...
Non-Interactive Zero-Knowledge Proofs of Non-Membership
Eprint
https://eprint.iacr.org/2015/072
Olivier Blazy Céline Chevalier Damien Vergnaud
Often, in privacy-sensitive cryptographic protocols, a party commits to a secret message m and later needs to prove that $m$ belongs to a language L or that m does not belong to L (but this party does not want to reveal any...
received 1 Feb 2015
Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=24126
Marc Fischlin Benoît Libert Mark Manulis
Asiacrypt 2011
Efficient Non-Interactive Zero-Knowledge Proofs in Cross-Domains Without Trusted Setup
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=29284
Michael Backes Lucjan Hanzlik Amir Herzberg Aniket Kate Ivan Pryvalov
Pkc 2019
With the recent emergence of efficient zero-knowledge (ZK) proofs for general circuits, while efficient zero-knowledge proofs of algebraic statements have existed for decades, a natural challenge arose to combine algebraic and...
Efficient Non-Interactive Zero-Knowledge Proofs in Cross-Domains without Trusted Setup
Eprint
https://eprint.iacr.org/2019/063
Michael Backes Lucjan Hanzlik Amir Herzberg Aniket Kate Ivan Pryvalov
With the recent emergence of efficient zero-knowledge (ZK) proofs for general circuits, while efficient zero-knowledge proofs of algebraic statements have existed for decades, a natural challenge arose to combine algebraic and...
last revised 18 Jan 2019
Next ►