Data Privacy Management Cryptocurrencies and

Blockchain Technology ESORICS 2018 International

Workshops DPM 2018 and CBT 2018 Barcelona Spain
September 6 7 2018 Proceedings Joaquin Garcia-
Alfaro pdf download
https://textbookfull.com/product/data-privacy-management-
cryptocurrencies-and-blockchain-technology-
esorics-2018-international-workshops-dpm-2018-and-
cbt-2018-barcelona-spain-september-6-7-2018-proceedings-joaquin-
garcia-alfaro/

Download more ebook instantly today - get yours now at textbookfull.com

We believe these products will be a great fit for you. Click
the link to download now, or visit textbookfull.com
to discover even more!

Data Privacy Management Cryptocurrencies and Blockchain

Technology ESORICS 2019 International Workshops DPM
2019 and CBT 2019 Luxembourg September 26 27 2019
Proceedings Cristina Pérez-Solà
https://textbookfull.com/product/data-privacy-management-
cryptocurrencies-and-blockchain-technology-
esorics-2019-international-workshops-dpm-2019-and-
cbt-2019-luxembourg-september-26-27-2019-proceedings-cristina-
perez-sola/
Security and Trust Management 14th International
Workshop STM 2018 Barcelona Spain September 6 7 2018
Proceedings Sokratis K. Katsikas

https://textbookfull.com/product/security-and-trust-
management-14th-international-workshop-stm-2018-barcelona-spain-
september-6-7-2018-proceedings-sokratis-k-katsikas/

Emerging Technologies for Authorization and

Authentication First International Workshop ETAA 2018
Barcelona Spain September 7 2018 Proceedings Andrea
Saracino
https://textbookfull.com/product/emerging-technologies-for-
authorization-and-authentication-first-international-workshop-
etaa-2018-barcelona-spain-september-7-2018-proceedings-andrea-
saracino/

Computer Security 23rd European Symposium on Research

in Computer Security ESORICS 2018 Barcelona Spain
September 3 7 2018 Proceedings Part I Javier Lopez

https://textbookfull.com/product/computer-security-23rd-european-
symposium-on-research-in-computer-security-
esorics-2018-barcelona-spain-september-3-7-2018-proceedings-part-
Graph Drawing and Network Visualization 26th
International Symposium GD 2018 Barcelona Spain
September 26 28 2018 Proceedings Therese Biedl

https://textbookfull.com/product/graph-drawing-and-network-
visualization-26th-international-symposium-gd-2018-barcelona-
spain-september-26-28-2018-proceedings-therese-biedl/

Privacy in Statistical Databases UNESCO Chair in Data

Privacy International Conference PSD 2018 Valencia
Spain September 26 28 2018 Proceedings Josep Domingo-
Ferrer
https://textbookfull.com/product/privacy-in-statistical-
databases-unesco-chair-in-data-privacy-international-conference-
psd-2018-valencia-spain-september-26-28-2018-proceedings-josep-
domingo-ferrer/

Understanding and Interpreting Machine Learning in

Medical Image Computing Applications First
International Workshops MLCN 2018 DLF 2018 and iMIMIC
2018 Held in Conjunction with MICCAI 2018 Granada Spain
September 16 20 2018 Proceedings Danail Stoyanov
https://textbookfull.com/product/understanding-and-interpreting-
machine-learning-in-medical-image-computing-applications-first-
international-workshops-mlcn-2018-dlf-2018-and-imimic-2018-held-
in-conjunction-with-miccai-2018-granada-sp/

Big Data Analytics and Knowledge Discovery 20th

International Conference DaWaK 2018 Regensburg Germany
September 3 6 2018 Proceedings Carlos Ordonez

https://textbookfull.com/product/big-data-analytics-and-
knowledge-discovery-20th-international-conference-
dawak-2018-regensburg-germany-september-3-6-2018-proceedings-
carlos-ordonez/

Business Process Management Workshops: BPM 2018

International Workshops, Sydney, NSW, Australia,
September 9-14, 2018, Revised Papers Florian Daniel

https://textbookfull.com/product/business-process-management-
workshops-bpm-2018-international-workshops-sydney-nsw-australia-
september-9-14-2018-revised-papers-florian-daniel/
 Joaquin Garcia-Alfaro
Jordi Herrera-Joancomartí
Giovanni Livraga · Ruben Rios (Eds.)
LNCS 11025

Data Privacy Management,

Cryptocurrencies and
Blockchain Technology
ESORICS 2018 International Workshops, DPM 2018
and CBT 2018, Barcelona, Spain, September 6–7, 2018
Proceedings

123
Lecture Notes in Computer Science 11025
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen

Editorial Board
David Hutchison
Lancaster University, Lancaster, UK
Takeo Kanade
Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler
University of Surrey, Guildford, UK
Jon M. Kleinberg
Cornell University, Ithaca, NY, USA
Friedemann Mattern
ETH Zurich, Zurich, Switzerland
John C. Mitchell
Stanford University, Stanford, CA, USA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
C. Pandu Rangan
Indian Institute of Technology Madras, Chennai, India
Bernhard Steffen
TU Dortmund University, Dortmund, Germany
Demetri Terzopoulos
University of California, Los Angeles, CA, USA
Doug Tygar
University of California, Berkeley, CA, USA
Gerhard Weikum
Max Planck Institute for Informatics, Saarbrücken, Germany
More information about this series at http://www.springer.com/series/7410
Joaquin Garcia-Alfaro Jordi Herrera-Joancomartí
•

Giovanni Livraga Ruben Rios (Eds.)

•

Data Privacy Management,

Cryptocurrencies and
Blockchain Technology
ESORICS 2018 International Workshops, DPM 2018
and CBT 2018, Barcelona, Spain, September 6–7, 2018
Proceedings

123
Editors
Joaquin Garcia-Alfaro Giovanni Livraga
Télécom SudParis Università degli Studi di Milano
Evry Crema
France Italy
Jordi Herrera-Joancomartí Ruben Rios
Enginyeria de la Informacio I de les Com Universidad de Málaga
Universitat Autonoma de Barcelona Málaga
Bellaterra Spain
Spain

ISSN 0302-9743 ISSN 1611-3349 (electronic)

Lecture Notes in Computer Science
ISBN 978-3-030-00304-3 ISBN 978-3-030-00305-0 (eBook)
https://doi.org/10.1007/978-3-030-00305-0

Library of Congress Control Number: 2018953831

LNCS Sublibrary: SL4 – Security and Cryptology

© Springer Nature Switzerland AG 2018

Chapters 28 and 30 are licensed under the terms of the Creative Commons Attribution 4.0 International
License (http://creativecommons.org/licenses/by/4.0/). For further details see license information in the
chapters.
This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the
material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now
known or hereafter developed.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
The publisher, the authors and the editors are safe to assume that the advice and information in this book are
believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors
give a warranty, express or implied, with respect to the material contained herein or for any errors or
omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in
published maps and institutional affiliations.

This Springer imprint is published by the registered company Springer Nature Switzerland AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
 Foreword from the CBT 2018 Program Chairs

This volume contains the proceedings of the Second International Workshop on

Cryptocurrencies and Blockchain Technology (CBT 2018) held in Barcelona during
September 6–7, 2018, in conjunction with the 23rd European Symposium on Research
in Computer Security (ESORICS) 2018.
In less than ten years, cryptocurrencies and blockchain technology have taken a
central position in the IT world. The capitalization marked for cryptocurrencies is
bigger than 300 billion dollars and other promising applications of blockchain tech-
nology range from personal identification and good tracking to distributed autonomous
organizations. Since security is probably the main objective behind all such proposals,
a careful analysis should be performed on those proposals before they reach the mass
market. To that end, the CBT workshop aims to provide a forum for researchers in this
area to carefully analyze current systems and propose new ones in order to create a
scientific background for the solid development of this new area.
In response to the call for papers, we received 39 submissions that were carefully
reviewed by the Program Committee (PC), comprising 19 members, and by additional
reviewers. Each submission received at least three reviews. The PC selected seven full
papers and eight short papers for presentation at the workshop. The selected papers
cover aspects about smart contracts, second layer and off-chain transactions, trans-
parency, performance, attacks, and privacy.
Furthermore, the workshop will be enhanced with a keynote talk sponsored by the
Research Institute (cf. https://researchinstitute.io/), complemented by sponsoring from
BART (Blockchain Advanced Research & Technologies), Inria Saclay, Institut
Mines-Télécom, Universitat Autónoma de Barcelona, and SAMOVAR (URM 5157 of
CNRS).
A special thank you goes to all the authors, who submitted papers to CBT 2018, as
well as the PC and additional reviewers, who worked hard to review the submissions
and discussed the final program. Last but not least, we would like to thank the ESO-
RICS organizers, especially Sokratis Katsikas (ESORICS Symposium Steering Com-
mittee Chair), Miquel Soriano (ESORICS 2018 General Chair), Javier Lopez
(ESORICS 2018 Program Chair), Josep Pegueroles-Valles (ESORICS 2018 Organi-
zation Chair), Marcel Fernandez and Jose Luis Muñoz Tapia (ESORICS 2018 Web-
masters), for all their help and support during the organization of CBT 2018.

July 2018 Joaquin Garcia-Alfaro

Jordi Herrera-Joancomartí
 Organization

2nd International Workshop on Cryptocurrencies and Blockchain

Technology — CBT 2018

Program Committee Chairs

Joaquin Garcia-Alfaro Institut Mines-Télécom, Télécom SudParis, France
Jordi Herrera-Joancomartí Universitat Autònoma de Barcelona, Spain

Program Committee
Daniel Augot Inria Saclay, France
Rainer Böhme Universität Innsbruck, Austria
Joseph Bonneau New York University, USA
Jeremy Clark Concordia University, Canada
Ittay Eyal Technion, Israel
Hannes Hartenstein Karlsruher Institut für Technologie, Germany
Akira Kanaoka Toho University, Japan
Ghassan Karame NEC Research Institute, Germany
Shin’ichiro Matsuo BSafe.network and Keio University, Japan
Patrick McCorry University College London, UK
Sarah Meiklejohn University College London, UK
Andrew Miller University of Illinois, Urbana-Champaign, USA
Pedro Moreno Sanchez Purdue University, USA
Jose Luis Muñoz Tapia Universitat Politècnica de Catalunya, Spain
Guillermo Navarro Universitat Autònoma de Barcelona, Spain
Cristina Pérez-Solà Universitat Autònoma de Barcelona, Spain
Tim Ruffing Saarland University, Germany
Roger Wattenhofer ETH Zürich, Switzerland
Aviv Zohar The Hebrew University, Israel

Steering Committee
Rainer Böhme Universität Innsbruck, Austria
Joaquin Garcia-Alfaro Institut Mines, France
Hannes Hartenstein Karlsruher Institut für Technologie, Germany
Jordi Herrera-Joancomartí Universitat Autònoma de Barcelona, Spain
VIII Organization

Additional Reviewers

Sergi Delgado-Segura Patrik Keller

Joan Bel Michael Fröwis
Carlos Dolader Felix Klaedtke
Till Neudecker Juan Hernandez-Serrano
 Foreword from DPM 2018 Program Chairs

This volume contains the proceedings of the 13th International Workshop on Data
Privacy Management (DPM 2018), which was held in Barcelona, Spain, during
September 6–7, 2018, in conjunction with the 23rd European Symposium on Research
in Computer Security (ESORICS 2018).
The aim of DPM is to promote and stimulate international collaboration and research
exchange in areas related to the management of privacy-sensitive information. This is a
very critical and important issue for organizations and end users. It poses several
challenging problems such as translation of high-level business goals into system-level
privacy policies, administration of sensitive identifiers, data integration, and privacy
engineering, among others.
In response to the call for papers, 36 submissions were received and each of them
was evaluated on the basis of significance, novelty, and technical quality. The Program
Committee, comprising 35 members, performed an excellent task and with the help of
additional reviewers all submissions went through a careful anonymous review process
(3 reviews per submission). The Program Committee’s work was carried out
electronically, yielding intensive discussions. Among the submitted papers, the
Program Committee accepted 11 full papers (resulting in an acceptance rate of 30.5%)
and 5 short papers for presentation at the workshop.
The success of DPM 2018 depends on the volunteering effort of many individuals,
and there is a long list of people who deserve special thanks. We would like to thank all
the members of the Program Committee and all the external reviewers for all their hard
work in evaluating the papers in a short time window and for their active participation
in the discussion and selection process. We are very grateful to all people who gave
their assistance and ensured a smooth organization process: the DPM Steering
Committee for the guidance and support in the organization of the workshop; Enrico
Bacis for taking care of publicity; the ESORICS Symposium Steering Committee and
its chair, Sokratis Katsikas, for all the arrangements that made the satellite events
possible; Joaquin Garcia-Alfaro (ESORICS 2018 Workshop Chair), Miguel Soriano
(ESORICS 2018 General Chair), and Josep Pegueroles (ESORICS 2018 Organization
Chair) for their support in the workshop organization and logistics. We would also like
to thank the keynote speakers for accepting our invitation and for their enlightening
talks. We also express our gratitude for the support received from the UNESCO Chair
in Data Privacy, sponsor of the workshop.
Last but certainly not least, our thanks goes to all the authors who submitted papers
and to all the attendees of the workshop. We hope you find the program of DPM 2018
interesting, stimulating, and inspiring for your future research.

July 2018 Giovanni Livraga

Ruben Rios
 Organization

13th International Workshop on Data Privacy

Management — DPM 2018

Program Committee Chairs

Giovanni Livraga Università degli Studi di Milano, Italy
Ruben Rios Universidad de Málaga, Spain

Publicity Chair
Enrico Bacis Università degli Studi di Bergamo, Italy

Program Committee
Ken Barker University of Calgary, Canada
Jordi Castellà-Roca Universitat Rovira i Virgili, Spain
Mauro Conti University of Padua, Italy
Jorge Cuéllar Siemens AG, Germany
Frederic Cuppens Telecom Bretagne, France
Nora Cuppens Telecom Bretagne, France
Sabrina De Capitani Università degli Studi di Milano, Italy
di Vimercati
José M. De Fuentes Universidad Carlos III de Madrid, Spain
Roberto Di Pietro Hamad Bin Khalifa University, Qatar
Josep Domingo-Ferrer Universitat Rovira i Virgili, Spain
Carmen Fernandez-Gago University of Málaga, Spain
Sara Foresti Università degli Studi di Milano, Italy
Sebastien Gambs Université du Québec à Montréal, Canada
Joaquin Garcia-Alfaro Télécom SudParis, France
Marc Juarez Katholieke Universiteit Leuven, Belgium
Christos Kalloniatis University of the Aegean, Greece
Sokratis Katsikas Giøvik University College in Norway, Norway
Hiroaki Kikuchi Meiji University, Japan
Costas Lambrinoudakis University of Piraeus, Greece
Maryline Laurent Télécom SudParis, France
Wouter Lueks École Polytechnique Fédérale de Lausanne,
Switzerland
 Organization XI

Fabio Martinelli IIT-CNR, Italy

Chris Mitchell Royal Holloway, University of London, UK
Guillermo Navarro-Arribas Universitat Autònoma de Barcelona, Spain
David Nuñez NuCypher, USA
Martín Ochoa Universidad del Rosario, Colombia
Javier Parra-Arnau Universitat Rovira i Virgili, Spain
Gerardo Pelosi Politecnico di Milano, Italy
Silvio Ranise FBK, Security and Trust Unit, Italy
Pierangela Samarati Università degli Studi di Milano, Italy
Matthias Templ Vienna University of Technology, Austria
Vicenç Torra University of Skövde, Sweden
Yasuyuki Tsukada Kanto Gakuin University, Japan
Lena Wiese University of Göttingen, Germany
Melek Önen EURECOM, France

Steering Committee
Josep Domingo-Ferrer Universitat Rovira i Virgili, Spain
Joaquin Garcia-Alfaro Télécom SudParis, France
Guillermo Navarro-Arribas Autonomous University of Barcelona, Spain
Vicenç Torra University of Skövde, Sweden

Additional Reviewers

Michael Bamiloshin Zahra Pooranian

Alberto Blanco-Justicia Sara Ricci
Lorena Cazorla Andrea Saracino
Salimeh Dashti Mina Sheikhalishahi
Lorena González Manzano Mohammad Shojafar
Nicholas Mainardi Aggeliki Tsohou
Katerina Mavroeidi Katerina Vgena
David Pàmies Estrems
 Contents

CBT Workshop: Smart Contracts

Succinctly Verifiable Sealed-Bid Auction Smart Contract . . . . . . . . . . . . . . . 3

Hisham S. Galal and Amr M. Youssef

Blockchain-Based Fair Certified Notifications . . . . . . . . . . . . . . . . . . . . . . . 20

Macià Mut-Puigserver, M. Magdalena Payeras-Capellà,
and Miquel A. Cabot-Nadal

On Symbolic Verification of Bitcoin’s SCRIPT Language . . . . . . . . . . . . . . . . 38

Rick Klomp and Andrea Bracciali

Self-reproducing Coins as Universal Turing Machine. . . . . . . . . . . . . . . . . . 57

Alexander Chepurnoy, Vasily Kharin, and Dmitry Meshkov

CBT Workshop: Second Layer, Off-chain Transactions

and Transparency

Split Payments in Payment Networks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67

Dmytro Piatkivskyi and Mariusz Nowostawski

Payment Network Design with Fees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76

Georgia Avarikioti, Gerrit Janssen, Yuyi Wang, and Roger Wattenhofer

Atomic Information Disclosure of Off-Chained Computations

Using Threshold Encryption . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85
Oliver Stengele and Hannes Hartenstein

Contour: A Practical System for Binary Transparency . . . . . . . . . . . . . . . . . 94

Mustafa Al-Bassam and Sarah Meiklejohn

CBT Workshop: Consensus, Mining Pools and Performance

What Blockchain Alternative Do You Need? . . . . . . . . . . . . . . . . . . . . . . . 113

Tommy Koens and Erik Poll

Valuable Puzzles for Proofs-of-Work. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 130

Colin Boyd and Christopher Carr

A Poisoning Attack Against Cryptocurrency Mining Pools . . . . . . . . . . . . . . 140

Mohiuddin Ahmed, Jinpeng Wei, Yongge Wang, and Ehab Al-Shaer
XIV Contents

Using Economic Risk to Model Miner Hash Rate Allocation

in Cryptocurrencies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155
George Bissias, Brian N. Levine, and David Thibodeau

CBT Workshop: Deadlocks, Attacks and Privacy

Avoiding Deadlocks in Payment Channel Networks . . . . . . . . . . . . . . . . . . 175

Shira Werman and Aviv Zohar

Coloured Ring Confidential Transactions . . . . . . . . . . . . . . . . . . . . . . . . . . 188

Felix Engelmann, Frank Kargl, and Christoph Bösch

Pitchforks in Cryptocurrencies: Enforcing Rule Changes Through

Offensive Forking- and Consensus Techniques (Short Paper) . . . . . . . . . . . . 197
Aljosha Judmayer, Nicholas Stifter, Philipp Schindler,
and Edgar Weippl

DPM Workshop: Privacy Assessment and Trust

Towards an Effective Privacy Impact and Risk Assessment

Methodology: Risk Analysis. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 209
Majed Alshammari and Andrew Simpson

Privacy Risk Assessment: From Art to Science, by Metrics . . . . . . . . . . . . . 225

Isabel Wagner and Eerke Boiten

Bootstrapping Online Trust: Timeline Activity Proofs . . . . . . . . . . . . . . . . . 242

Constantin Cătălin Drăgan and Mark Manulis

DPM Workshop: Private Data and Searches

Post-processing Methods for High Quality Privacy-Preserving

Record Linkage . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 263
Martin Franke, Ziad Sehili, Marcel Gladbach, and Erhard Rahm

d-DOCA: Achieving Privacy in Data Streams. . . . . . . . . . . . . . . . . . . . . . . 279

Bruno C. Leal, Israel C. Vidal, Felipe T. Brito, Juvêncio S. Nobre,
and Javam C. Machado

Data Oblivious Genome Variants Search on Intel SGX . . . . . . . . . . . . . . . . 296

Avradip Mandal, John C. Mitchell, Hart Montgomery, and Arnab Roy

DPM Workshop: Internet of Things

Developing GDPR Compliant Apps for the Edge . . . . . . . . . . . . . . . . . . . . 313

Tom Lodge, Andy Crabtree, and Anthony Brown
 Contents XV

YaPPL - A Lightweight Privacy Preference Language for Legally

Sufficient and Automated Consent Provision in IoT Scenarios . . . . . . . . . . . 329
Max-R. Ulbricht and Frank Pallas

PrivacyGuard: Enforcing Private Data Usage with Blockchain

and Attested Execution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 345
Ning Zhang, Jin Li, Wenjing Lou, and Y. Thomas Hou

DPM Workshop: Privacy and Cryptography

A Performance and Resource Consumption Assessment of Secret

Sharing Based Secure Multiparty Computation . . . . . . . . . . . . . . . . . . . . . . 357
Marcel von Maltitz and Georg Carle

Privacy-Preserving Trade Chain Detection . . . . . . . . . . . . . . . . . . . . . . . . . 373

Stefan Wüller, Malte Breuer, Ulrike Meyer, and Susanne Wetzel

FHE-Compatible Batch Normalization for Privacy Preserving

Deep Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 389
Alberto Ibarrondo and Melek Önen

DPM Workshop: Future Internet

A General Algorithm for k-anonymity on Dynamic Databases . . . . . . . . . . . 407

Julián Salas and Vicenç Torra

On Security of Anonymous Invitation-Based System . . . . . . . . . . . . . . . . . . 415

Naoto Yanai and Jason Paul Cruz

Probabilistic Metric Spaces for Privacy by Design Machine Learning

Algorithms: Modeling Database Changes . . . . . . . . . . . . . . . . . . . . . . . . . . 422
Vicenç Torra and Guillermo Navarro-Arribas

Lifelogging Protection Scheme for Internet-Based Personal Assistants . . . . . . 431

David Pàmies-Estrems, Nesrine Kaaniche, Maryline Laurent,
Jordi Castellà-Roca, and Joaquin Garcia-Alfaro

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 441

CBT Workshop: Smart Contracts
 Succinctly Verifiable Sealed-Bid Auction
Smart Contract

Hisham S. Galal(B) and Amr M. Youssef

Concordia Institute for Information Systems Engineering,

Concordia University, Montréal, QC, Canada
h [email protected]

Abstract. The recently growing tokenization process of digital and

physical assets over the Ethereum blockchain requires a convenient trade
and exchange mechanism. Sealed-bid auctions are powerful trading tools
due to the advantages they offer compared to their open-cry counter-
parts. However, the inherent transparency and lack of privacy on the
Ethereum blockchain conflict with the main objective behind the sealed-
bid auctions. In this paper, we tackle this challenge and present a smart
contract protocol for a succinctly verifiable sealed-bid auction on the
Ethereum blockchain. In particular, we utilize various cryptographic
primitives including zero-knowledge Succinct Non-interactive Argument
of Knowledge (zk-SNARK), Multi-Party Computation (MPC), Public-
Key Encryption (PKE) scheme, and commitment scheme for our app-
roach. First, the proving and verification keys for zk-SNARK are gen-
erated via an MPC protocol between the auctioneer and bidders. Then,
when the auction process starts, the bidders submit commitments of
their bids to the smart contract. Subsequently, each bidder individually
reveals her commitment to the auctioneer using the PKE scheme. Then,
according to the auction rules, the auctioneer claims a winner and gen-
erates a proof off-chain based on the proving key, commitments which
serve as public inputs, and their underlying openings which are consid-
ered the auctioneer’s witness. Finally, the auctioneer submits the proof
to the smart contract which in turn verifies its validity based on the
public inputs, and the verification key. The proposed protocol scales effi-
ciently as it has a constant-size proof and verification cost regardless of
the number of bidders. Furthermore, we provide an analysis of the smart
contract design, in addition to the estimated gas costs associated with
the different transactions.

Keywords: Ethereum · Smart contract · Sealed-bid auction

zk-SNARK

1 Introduction
The unprecedented growing deployment of assets on Ethereum has created a
remarkable market for assets exchange [1] which imposes a high demand for var-
ious trading tools such as verifiable and secure auctions. Auctions are platforms
c Springer Nature Switzerland AG 2018
J. Garcia-Alfaro et al. (Eds.): DPM 2018/CBT 2018, LNCS 11025, pp. 3–19, 2018.
https://doi.org/10.1007/978-3-030-00305-0_1
4 H. S. Galal and A. M. Youssef

for vendors to advertise their assets where interested buyers deposit competitive
bids based on their own monetary valuation. Commonly, the auction winner is
the bidder who submitted the highest price, however, there are a variety of other
rules to determine the winner. Additionally, auctions have also been known to
promote many economic advantages for the efficient trade of goods and services.
According to [18], there exist two types of sealed-bid auctions: (i) First-price
sealed-bid auctions (FPSBA) where the bidders submit bids in sealed envelops
to the auctioneer. Subsequently, the auctioneer solely opens them to determine
the winner who submitted the highest bid, and (ii) Vickrey auctions, which are
similar to FPSBA with the exception that the winner pays the second highest
bid instead.
Arguably, the main objective behind concealing the losing bids in sealed-
bid auctions is to prevent the use of bidders’ valuations against them in future
auctions. Therefore, bidders are motivated to cast their bids without worrying
about the misuse of their valuations. Nonetheless, when auctioneers collude with
malicious bidders, the aforementioned advantage is easily broken. Consequently,
the auctioneer has to be trusted to preserve bids’ privacy and to correctly claim
the auction winner. Therefore, various constructions of sealed-bid auctions utilize
cryptographic protocols to ensure the proper and secure implementation without
harming the privacy of bids.
Ethereum is the second most popular blockchain based on its market capital-
ization that exceeds $53 billion USD as of May 2018 [4]. Ethereum allows running
decentralized applications in a global virtual machine environment known as
Ethereum Virtual Machine (EVM) [28] without depending on any third-party.
From a practical viewpoint, the EVM is a large decentralized computer with
millions of objects (known as smart contracts) that can maintain an internal
database, execute code, and interact with each other. As a result, the EVM
substantially simplifies the creation of blockchain applications on its platform
rather than building new application-specific blockchain from scratch.
The code executed in the EVM is commonly known as a smart contract
which lies dormant and passive until its execution is triggered by transactions.
It inherits strong integrity assurance from the blockchain, even its creator cannot
modify it once it has been deployed. In Ethereum, computation is expensive as
transactions are executed and verified by the full-nodes on Ethereum network.
Therefore, Ethereum defines a gas metric to measure the computation efforts
and storage cost associated with transactions. In other words, each transaction
has a fee (i.e., consumed gas) that is paid by the transaction’s sender in Ether
(Ethereum currency). With the help of the consensus protocol, the smart con-
tract is also guaranteed to execute precisely as its code dictates. Although many
other blockchains such as Bitcoin [24] offer the capability to run smart con-
tracts, they are often very limited to a specific set of instructions. Conversely,
the instructions on EVM theoretically allow running any Turing-complete pro-
gram. However, there is a block gas limit that defines the maximum amount of
gas that can be consumed by all transactions combined in a single block. The
current block gas limit is around is 8-million gas as of May 2018 [2]. Therefore,
 Succinctly Verifiable Sealed-Bid Auction Smart Contract 5

smart contracts cannot include very expensive computations that exceed the
block gas limit.
In addition, despite the flexible programming capability in Ethereum smart
contracts, they still lack transactional privacy. In fact, the details of every trans-
action executed in the smart contract are visible to the entire network. Moreover,
these details are eventually stored in the Ethereum blockchain which also gives
the ability to review past transactions as well. Consequently, the lack of transac-
tional privacy is a major challenge towards the deployment of sensitive financial
applications. Usually, individuals and organizations prefer to preserve the pri-
vacy of their transactions. For example, an organization may not want to post
how much it spent on the purchase of some arbitrary assets.
Our contribution, we present a protocol for a sealed-bid auction smart
contract that utilizes a set of cryptographic primitives to provide the following
properties:
1. Bids’ Privacy. The submitted bids are not visible to competitors during the
bidding phase of the auction in the presence of malicious adversaries.
2. Posterior privacy. The losing bids are not revealed to the public assuming
a semi-honest auctioneer.
3. Bids’ Binding. Bidders cannot deny or change their bids once they are
committed.
4. Public Verifiability. Any individual can verify the correctness of the auction
winner proof.
5. Fairness. Rational parties are obligated to follow the proposed protocol to
avoid being financially penalized.
6. Non-Interactivity. The smart contract, on behalf of the bidders, verifies
the auction winner proof submitted by the auctioneer.
7. Scalability. The verification cost of the auction winner is nearly constant
regardless of the number of bidders.
We have also created an open-source prototype for a Vickrey auction smart
contract and made it available on Github 1 for researchers and community to
review it. The rest of this paper is organized as follows. Section 2 provides a
review of privacy-preserving protocols and sealed-bid auctions on the blockchain.
In Sect. 3, we present the cryptographic primitives and tools utilized in designing
the proposed Vickrey auction smart contract. Then, In Sect. 4, we provide the
design of the auction contract together with an analysis of the estimated gas cost
of relevant transactions. Finally, we present our conclusions and suggestions for
future work in Sect. 5.

2 Related Work
Our proposal depends on utilizing zk-SNARK and distributed ledger
(blockchain) technology to build an efficient (i.e., succinct proof with a rela-
tively small verification cost) sealed-bid auction on Ethereum. Therefore, we
1
https://github.com/hsg88/vickreyauction.
6 H. S. Galal and A. M. Youssef

provide a review of state-of-the-art research papers that utilize zk-SNARK in

building different cryptographic protocols on the blockchain, besides to papers
that provide solutions to building sealed-bid auctions on top of blockchains.
A variety of privacy-preserving protocols are built on top of blockchain
technology [5,10,11,15–17,19,20,22]. They combine cryptocurrency with crypto-
graphic primitives such as MPC protocols, commitment schemes, and ZK proofs
to achieve fairness in different adversary models. In a nutshell, initially, the proto-
col participants locks an arbitrary amount of cryptocurrency in an escrow smart
contract. Subsequently, they proceed to engage in the various steps of the proto-
col. Finally, once the protocol reaches its final state, the escrow smart contract
refunds the deposits back to the honest participants. Consequently, financially
rational participants are obligated to adhere to the protocol rules in order to
avoid the financial penalty.
One prominent example of the privacy-preserving protocol that has been
deployed on Bitcoin is Zero-Knowledge Contingent Payment [22]. It allows a
buyer and a seller to fairly trade an arbitrary digital good in exchange for bitcoins
payment. Fairness is achieved without the need for a trusted party. In essence,
by the end of the protocol, either the exchange completes with every participant
receiving what they are expecting, or none of the participants gains an advantage
over another one. Despite the limited flexibility of Bitcoin scripting language, the
authors managed to provide a solution by depending on hash-lock transactions
that allow someone to pay an arbitrary amount of bitcoins to anyone who can
provide a preimage x such that y = SHA-256(x), for a publicly known value
y. We describe a simple version of ZKCP for the sake of illustration purposes.
Suppose that a seller Bob wants to trade a digital item p in exchange for v
bitcoins. First, Bob encrypts the item p using a symmetric encryption algorithm
to obtain c = Encx (p) using a key x. Then, Bob computes the hash value of
the key y = SHA-256(x). Subsequently, he sends (c, y) along with a ZK proof
that claims c = ENCk (p) and y = SHA-256(x). After that, if Alice is interested
in that item, she creates a hash-lock transaction to pay v bitcoins to anyone
who reveals the preimage x such that y = SHA256(x). Finally, Bob receives the
payment v bitcoins by revealing x which also means that Alice can decrypt c to
get the digital good p.
Campanelli et al. [15] took a step further to propose Zero-Knowledge Contin-
gent Service Payments (ZKCSP) on top of Bitcoin. The main goal is to permit a
fair exchange of services and payments over the Bitcoin blockchain. The authors
argue that previous constructions of ZKCP [22] are not suitable for the exchange
of digital service and payments. They utilized zk-SNARK proof systems [7] to
build practical proofs for complex arguments. As an example, they built a proto-
type for Proofs of Retrievability (PoR) where a client Bob has stored some data
on a cloud server and he wants to verify whether the server still keeps and stores
his data correctly. In this case, the server offers a digital service rather than a
digital good where the server’s owner Alice wants to be certain that there is a
payment at the end of successful verification of PoR. Moreover, Bob does not
want to pay in advance. Therefore, ZKCSP tackles this situation. Also, ZKCSP
 Succinctly Verifiable Sealed-Bid Auction Smart Contract 7

can be viewed to be more general than ZKCP as it allows for the trade of goods
as well as services.
On the area of smart contract frameworks, Kosba et al. [17], presented Hawk,
a framework for writing smart contracts that preserves the privacy of financial
transactions on the blockchain. The main advantage is to allow programmers
without knowledge of cryptographic protocols to build a secure and privacy-
preserving smart contract. To this end, the framework includes a compiler that
utilizes various cryptographic primitives in generating the smart contracts. A
Hawk program source code is composed of public and private parts. The public
part is responsible for the logic that does not deal with the sensitive data or the
money flow. On the other hand, the private part is responsible for hiding the
information about data and input currency units. The compiler translates the
Hawk program into three pieces that define the cryptographic protocol between
users, manager, and the blockchain nodes. Up to our knowledge, the framework
has not been released yet and we could not find a deployed smart contract on
Ethereum blockchain built by Hawk.
On the subject of sealed-bid auctions, Blass and Kerschbaum [11] proposed
Strain, a protocol to build sealed-bid auctions, on top of blockchain technology,
that preserve bids privacy against malicious participants. Strain uses a two-party
comparison protocol to compare bids between pairs of bidders. Then, the com-
parison’s outcome is submitted to the blockchain which serves as a secure bulletin
board. Additionally, since bidders initially submit commitments to their bids,
Strain utilizes ZK proof to verify that the submitted comparison’s result corre-
sponds to the committed bids. Furthermore, Strain uses reversible commitment
scheme such that a group of bidders can jointly open the bid commitment. The
objective of this scheme is to achieve fairness against malicious participants who
prematurely abort or deviate from the protocol. As the authors reported in their
work, Strain has an obvious flaw that reveals the order of bids, similar to Ordered
Preserving Encryption (OPE). Furthermore, running protocols involving MPC
on blockchain is not efficient due to extensive computations and the number of
rounds involved. Meanwhile, our protocol does not suffer from Strains flaws, and
it utilizes zk-SNARK to generate a proof that can be efficiently verified with a
feasible cost on Ethereum.
Furthermore, Galal and Youssef [16] presented a protocol for running sealed-
bid auctions on Ethereum. The protocol ensures the public verifiability, privacy
of bids, and fairness. Initially, bidders submit Pedersen commitments of their
bids to a smart contract. Subsequently, they reveal their commitments individu-
ally to the auctioneer using RSA encryption. Finally, the auctioneer determines
the winning bid and claims the winner of the auction. There are two major issues
in this protocol. First, for each losing bid, the auctioneer has to engage into a
set of interactive commit-challenge-verify protocol to prove that the winning bid
is greater than the losing bid. In other words, the number of interactions is pro-
portional to the number of bidders. Second, current techniques for generating a
secure random number on blockchains are not proven to be secure due to min-
ers’ influence; therefore, the random numbers used in a commit-challenge-verify
8 H. S. Galal and A. M. Youssef

proof can be compromised. The approach proposed in our paper overcomes these
challenges by utilizing zk-SNARK which requires a single proof-verification for
the whole auction process. Moreover, it is a non-interactive protocol that does
not require random numbers to be generated on the blockchain.

3 Preliminaries
In this section, we briefly introduce the cryptographic primitives that are utilized
in the design of our proposed protocol for the sealed-bid auction smart contract.

3.1 Commitment Scheme

Recall that in sealed-bid auctions, the bidders initially submit their bids in sealed
envelops for a fixed period of time. Then, the auctioneer opens these envelopes
to determine the winner. In other words, we need a tool to hide the bids tem-
porarily, yet with the ability to reveal them later. This task can be easily fulfilled
by a cryptographic primitive known as commitments schemes. Typically, a com-
mitment scheme involves two parties: a sender (Alice) and a receiver (Bob).
Additionally, it provides two security properties, namely, hiding and binding.
Simply, let us denote for an abstract commitment scheme by the public algorithm
c = Com(x, r) which takes a value x, a random r, and produces a commitment
c. In the reveal phase, Alice simply reveals the values x and r , then Bob checks
whether these two values produces the same original commitment c. The hiding
property implies that it is infeasible for Bob to learn the value x given the com-
mitment c. Likewise, the binding property implies that it is infeasible for Alice
to reveal with different values x and r that produces the same commitment c.
such that when Alice commits to an arbitrary value x and sends the commit-
ment c to Bob. Although there are commitment schemes with strong security
properties (e.g., information-theoretic hiding) such as Pedersen commitment, we
instead use a relaxed one based on collision-resistant hash function due to its
flexible integration with zk-SNARK.
To be precise, we choose SHA-256 to be the public algorithm for our com-
mitment scheme. In order for Alice to commit to a bid x, she sends to Bob the
commitment c = SHA-256(s) where s = (x||r), r is a k-bit randomness, and ||
denotes the concatenation operation. Later on, to decommit c, she sends the
value s to him. Subsequently, Bob verifies that c = SHA-256(s ). Then, on suc-
cessful verification, he strips off the least significant k-bits from s to recover the
bid x.

3.2 zk-SNARK
ZK-SNARK is essentially a non-interactive zero-knowledge (NIZK) proof system.
There are several constructions of zk-SNARK especially in the field of verifiable
computations. In this paper, we follow the construction proposed by Sasson
et al. [9] to verify computations compatible with Von Neumann architecture.
 Succinctly Verifiable Sealed-Bid Auction Smart Contract 9

More precisely, to verify the correctness of the auctioneer’s computations in

determining the auction’s winner.
Typically, any NIZK proof system about NP-language L consists of the fol-
lowing three main algorithms:
1. Key generation: crs ← K(1λ , L) which takes a security parameter λ, a
description of the language L, and outputs the common reference string crs.
2. Proof generation: π ← P (crs, s, w) which takes a crs, a statement s, a
witness w such that (s, w) ∈ L, and outputs a proof π.
3. Proof verification: {0, 1} ← V (crs, π, s) which takes a proof π, the previ-
ously generated crs, a statement s, and outputs 0 or 1 to denote accept or
reject.
In general, any NIZK proof is simply a bulk of data that can be verified
at any time without prior interactions between the prover and the verifier. A
key requirement though is the proper generation of common reference string
(CRS). If there is any trapdoor in the generation of CRS, then the prover is
able to generate a fraudulent proof. Likewise, a malicious verifier can exploit the
trapdoor to extract information about the witness. Therefore, the generation of
CRS is of utmost importance to the security of NIZK proof. The zk-SNARK
construction [9] provides the following security properties:
1. Perfect Completeness. An honest prover with a valid witness can always
convince an honest verifier. More formally, given (s, w) ∈ L, crs ←
K(1λ , L), π ← P (crs, s, w), then V (crs, π) = 1.
2. Computational Soundness. A polynomial-time adversary can convince a
verifier that an invalid statement is true with a negligible probability. More
formally, given crs ← K(1λ , L), π ← A(crs, s), s ∈/ L, then P r[V (crs, π, s) =
1] ≈ 0.
3. Computational Zero-Knowledge. It is computationally infeasible for any
polynomial-time adversary to reveal any information about the witness from
the proof. More formally, there exists a simulator S = (K, P ) that outputs
a transcript that is computationally indistinguishable from the one produced
by (K, P ) in a proof π without knowing a witness.
4. Succinctness. A NIZK is said to be succinct if an honestly generated proof
has P oly(λ)- bits and the verification algorithm V (crs, π, s) runs asymptoti-
cally in O(|s| · P oly(λ)).
Recall that the key generation algorithm in zk-SNARK takes as an input a
representation of the language L. Therefore, we want to find a suitable repre-
sentation for the auction winner problem. Sasson et al. [9] proposed a general-
purpose circuit generator that takes a C-code and translates it into an arith-
metic circuit. Simply, arithmetic circuits are acyclic graphs with wires and
mathematical operation gates as edges and node, respectively [23]. More pre-
cisely, an arithmetic circuit is a function C : Fm × Fn →Fl which essentially
takes (m + n)-inputs and generates l-outputs. The arithmetic circuit C is said
to have a valid assignment tuple (a1 , ..., aN ) where N = m + n + l when
C(a1 , ..., ax+y ) = (ax+y+1 , ..., aN ).
10 H. S. Galal and A. M. Youssef

4 Auction Contract Design

In this section, we present the protocol for running a Vickrey auction as a smart
contract on top of Ethereum. Our protocol is composed of six phases, where
the first two phases are responsible for initializing the zk-SNARK proof system,
while, the remaining four phases deal with the auctioning process itself.

4.1 Arithmetic Circuit Generation

Recall that before we can use the first algorithm in zk-SNARK, namely key
generation, we need an arithmetic circuit that represents the function we want
to provide a proof about its correct execution. Practically, creating an arith-
metic circuit for complex arguments is a tedious and error-prone task, especially
when the arguments involve operations that are intrinsically depending on log-
ical operators such as the comparison operation and SHA-256 transformation.
For this reason, we utilize the general-purpose circuit generator [3,9] to translate
a program code into an arithmetic circuit.
Arguably, using a general-purpose arithmetic circuit generator often yields
an inefficient circuit with a large number of gates. However, the computation
problem of Vickrey auction, as shown in Algorithm 1, is not complex to the
degree we worry about the performance of the generated circuit. Moreover, it is
reported in [9] that the size of the generated arithmetic circuits scales additively
rather than multiplicatively with respect to the size of the translated code.

Algorithm 1. Find highest and second-highest bids and verify commitments

1: function Auction(C, U, V )
2: highest ← 0, secondHighest ← 0, status ← 0, i ← 0
3: success ← true
4: while i < N do  N is the constant number of bidders
5: if C[i] = SHA-256(U [i], V [i]) then  check if commitment is valid
6: success ← f alse
7: return [success, highest, secondHighest]
8: end if
9: if highest < bid then
10: secondHighest ← highest
11: highest ← bid
12: end if
13: i←i+1
14: end while
15: success ← true
16: return [success, highest, secondHighest]
17: end function

While the auctioneer might be tempted to omit commitments to let a col-

luding bidder win the auction, doing so will result in a failed verification by
 Succinctly Verifiable Sealed-Bid Auction Smart Contract 11

the smart contract. In other words, the algorithm does not check whether the
auctioneer supplies all commitments as part of the public inputs. On the other
hand, the verification which is carried out by the smart contract does supply all
commitments. As a consequence, there will be a difference between the public
parameters used by the auctioneer to generate the proof, and the public param-
eters used by the smart contract to verify the proof. Therefore, the verification
will fail, and the auctioneer will be penalized if he cannot supply a valid proof
that uses the same public parameters as the smart contract.

4.2 Generation of CRS

The outputs of the CRS generation algorithm are the proving and verification
keys which are used by the prover and verifier, respectively. It is a mandatory
requirement in any NIZK proof system including zk-SNARK to ensure the proper
generation of CRS in order to preserve the zero-knowledge and soundness prop-
erties. Commonly, the CRS is usually generated by a trusted party. However,
this is against the whole premise of the blockchain as a decentralized platform
that does not require a trusted party. Moreover, it is sufficient to generate the
CRS only one-time as long as the problem statement does not change. In other
words, we can initially generate the CRS for the Vickrey auction. Then, we can
utilize the resultant CRS in multiple Vickrey auctions.
To avoid the need for a trusted party, various MPC protocols have been
proposed to generate the CRS. Bowe et al. [13] presented an MPC protocol to
generate CRS for the Zcash cryptocurrency. For the sake of simplicity, let us
consider that the CRS is composed of a single element s · g where s ∈ F∗p and g
is the generator for a group G written in the additive notation. Consider that,
a prover Alice and a verifier Bob want to generate the CRS such that none of
them has knowledge of its discrete log. The protocol runs as follows:

1. Alice chooses a uniform number s1 ∈ F∗p and sends the element s1 · g to Bob.
2. Bob chooses a number s2 ∈ F∗p and sends the element s2 s1 · g to Alice.
3. Finally, Alice and Bob use the element s2 s1 · g as the CRS.

The problem with this simple protocol is that Bob can maliciously choose s2 in a
way that affects the final output of s. Therefore, the authors in [8,13] proposed a
pre-commitment step where each participant first picks a secret number si then
sends a commitment to it. Later on, they follow the same steps as above but
with providing a ZK proof that they used the same secret number corresponding
to their commitments. A major problem with this protocol is that the pre-
commitment step requires a pre-selection of participants. Moreover, there is an
overhead with generating the commitments and verifying the associated ZK
proofs.
We follow the MPC protocol for CRS generation in [14] for a number of
reasons. First, it does not require a pre-selection of parties to participate in the
MPC protocol. Therefore, instead of trusting a specific group of people with the
generation of the CRS, any individual can actively join to be assured that a
12 H. S. Galal and A. M. Youssef

valid CRS is generated even when the rest of participants are malicious. Second,
It is more scalable and efficient than the previous construction as it is only
a two-round protocol. The basic idea is to use random beacons to eliminate
the step of pre-commitment in [13]. Fortunately, Ethereum is the second most
popular blockchain, which implies that a large number (i.e., more than 51%) of
the miners in the network are reasonably assumed to act honestly. Therefore,
we can leverage the blockchain itself as a source of random beacons [12] without
worrying about the influence of malicious miners. Hence, the MPC protocol for
CRS generation proceeds as follows:

1. Alice chooses a uniform number s1 ∈ F∗p and sends the element s1 · g to Bob.
2. Similarly, Bob chooses a uniform number s2 ∈ F∗p and sends the element
s2 s1 · g to the smart contract.
3. A beacon s3 is read from the blockchain, and the element s3 s2 s1 · g is used
as CRS.

Assuming that no malicious miner can affect the beacon s3 in a way that
makes finding the discrete log of s3 s2 s1 .g an easy problem, then we can safely
say that the generated CRS has no trapdoor that compromises the security of
a zk-SNARK proof. We also note that it is an optional task for the bidders to
participate in the CRS generation. In other words, the integration of the random
beacon in the MPC protocol is sufficient to ensure that the auctioneer cannot
control the trapdoor of the generated CRS. Obviously, the achieved security is
much stronger when at least one honest bidder participates in the MPC protocol.

1. T1 , T2 , T3 define the periods using block numbers for the following phases:
commitments of bids, opening the commitments, and proof generation and
verification, respectively. Note that, T refers to the current block number.
2. N is the maximum number of bidders.
3. F defines the financial deposit of ethers to guarantee fairness against financial
rational malicious participants.
4. Apk is the auctioneer’s public key of an asymmetric encryption scheme.
5. V key is the verification key part of the generated CRS.

Create: {T1 , T2 , T3 , N, F, Apk , V key} : from auctioneer A

Set state := IN IT, bidders := {}
Set highestBid := 0, secondHighestBid := 0
Store N, F, Apk , V key
Store T1 , T2 , T3
Assert T < T1 < T2 < T3 < T4
Assert ledger[A] >= F
Set ledger[A] := ledger[A] − F
Set deposit := deposit + F

Fig. 1. Pseudocode for Vickrey auction smart contract constructor

 Succinctly Verifiable Sealed-Bid Auction Smart Contract 13

4.3 Smart Contract Deployment

The auctioneer deploys the smart contract that runs the Vickrey auction on top
of Ethereum. The deployment is basically a transaction that carries the com-
piled EVM bytecode as a payload and triggers the execution of the constructor.
The constructor is responsible for initializing the state of variables in the smart
contract. In Fig. 1, we show a pseudocode to illustrate the initialization of the
state variables based on the parameters received from the auctioneer.

4.4 Submission of Bids

In this phase, the bidders create transactions to pay F -ethers and submit com-
mitments of their bids as described in Sect. 3 to the function Bid which stores
the commitments on the smart contract as shown in Fig. 2.

Bid: {commitB } from a bidder B:

Assert T < T1
Assert ledger[B] > F
Set ledger[B] := ledger[B] − F
Set deposit := deposit + F
Set bidders[B].Commit := commitB

Fig. 2. Pseudocode for the submission of bid commitment

We also note that at the end of this phase, if the number of the submitted
commitments is less than the maximum number of bidders N , then the auction-
eer has to submit the remaining number of commitments with an underlying bid
value equals to zero. The reason behind this step is due to technical limitation
in the general-purpose arithmetic circuit generator [9]. More precisely, the trans-
lated code is not allowed to have loops with variable number of iterations, so we
have to fix the loop counter to the maximum number of bidders N . Basically, the
circuit generator flattens and unrolls the loop iterations, therefore, the number
of iterations has to be known in advance.

4.5 Opening the Commitments

In this phase, each bidder Bi encrypts the pair (xi , ri ) by the public key Apk ,
where xi is the bid value, and ri is a random number. Then, the ciphertext is
sent to the function Open on the smart contract as shown in Fig. 3.
Arguably, paying for a transaction that stores the ciphertext on the smart
contract seems to be an unnecessary task at the first glance. However, we chose
to store the ciphertext rather than sending them off-chain to the auctioneer so we
can avoid the following attack scenario. Suppose a malicious auctioneer pretends
that an arbitrary bidder Bob has not submitted a ciphertext of the correct
Other documents randomly have
different content
l. Mil. 'ÎUmfdii.n;, f. n, OlTmhanbfd^ub, m. cô, c, ■Jlrmbarnifdi, m.i.
c. | 2. marqw^ distinctive : IBraffatb. m. llntcrfdicitun^^jcidHn, n;
jeu de paume : îlrmfiùcf, n, eô, c, ©aUatmbanb, >i. i. -^cr,
33aUbanbfd)ut), 7». 1 3. Verr. ^Umtccfcr, m. ô. BRASSARDÉ, ÉE,
adj. [Bra-szardé). mit 'îlrmfdncncii T)crfel);n. BRASSAVOLE , f. {Br(i-
sza~woV). Bot. CJlrl) îltdMtc. f. BRASSE, f. {Brasz"). i. mesure:
Staifc, f. fllaftcr, f. n, Sabtn, m; Mar. être sur les — s, (^runb Ijabcn.
| 2. pain de —, 20 biè 30 pfûnbigcé 3?rpb; nager à la — , mit
gepreiiten îltmen fd:u>immen'. || 3. à — corps ou à bras-le-corps,
loc. adv. umfpannt; porter qn. à — corps, icm. (a) in fcincn 'JUmcn
ftfl umfc^lungcn tragcn*. 1. BR.ASSÉ, ÉE, pp. {Bra-szé). umgt rûtjtt,
gebraut. 2. BRASSÉ, ÉE, pp. Mar. 9cbra§t. BRASSÉE, (. {Bra-szé). \.
•ÎUmi'oU, m; (emporter) à — , armccUrecifc. | 2. mesure de terre :
lagcôarbcit f. fo uiel ein ÎDîann an tinem Xagc ùmpflûgcn fann.
BRASSEÏER. a. [Bra-szà-ié). voy. BRASSER, 2 ; Mar. braffcn, bic
iSraffcn antplcn. 1. BRASSER, a.{Bra-s.-é). i. remuer: um-tûbrcn,
burcticinanbcr-riïfîrcn. | 2. mêler des liquides: ucrmifd-cn; de la
bière: brauen, cin-maifdien; du vin: pcitfd)cn; du Cidre; madjen,
berciten; démêler les grains: b.ié îDial^ cin-maiidjcn, cin-taigcn;
remuer dans des sacs (l'or, l'argent), untftcinanttr tûtjrcn,um-
f*ûttcln.^3.7)ra{i(/wer,(ra«i(?r; braum.an-fpinncn'; —
unetrahison,c^n:2ier^ rÔtbcrci an-fpinnncn* ou an-^ctic!ni il se
brasse qch. par là, es tvitb ba ctro. (a) auflgebcrft. | 't. Péch . bas
©affet trubcn, mit 1er ' ^tÔbrfîange auf-tûbren. I 5- — les cuirs, bic
^âutc im Itcibfaîfc um-iùljun. I 6. Métal, um-tûlfren.
The text on this page is estimated to be only 14.70%
accurate

170 BRAV 2. BIVASSER, n. Mai: l-iaifcn, tit iPi-if' fcn .in-

tokii; — au plus prés, (djoif bnm œiirte biaffcn: d'-chaviier les voiles
fuite mât : ab-btafftn; — à contre, bai fcoItti; _ à l'autre bord, um-
biafftn; — a partir, à servir, ab-btaffm; — au vent, an-btaffcn.
BRAH^ERIE, f- {Bra-sie-ri'). ïiaUf iti, f. en; débit: SictliauS, n. tï, -«.
Suf fdjtnlt, /■. n. BRASSEfR,»!!. (Sra-slôV). Sitlbiauci, m. i\ garçon —
, ÏBiautntdit, «i. ce, t. Il _euse, f. Sicibtautiin, f. iitn. Sitibiaucisfiau, f.
en. BRASSÉVAGE, m. {Bra-szé-iu-f). Mur. Siafftn, lu i. nRASSE\'ER, n.
{Brassé-ié). ou BEASSEB 2, Mur. btaffen. BRASSIAGE, m. (Bra-s:ia-
j'). 1. Jl/ov. acîio» .- 'Jlufmn'ftn (n.) bti Kaifci. titfc mil Sabni. | i.
niesui-e : Saitnm.ip, n. I 3. la quantité de brasses d'eau : 3abl (f.) b«
jtmtffcntn ^nbtii; profondeur : îicfc. /. BRASSICAIRE, adj. (Bra-szi-
kàr'). Bot. et Zoiil. Sobl-^-a, tiJl)l.uti9. Il— s, m. pi. fioHi'*mttttilini)t,
m. pi. BRASSICÉES, f. pi. (.Bra-szi-szé). Sot. fifMatttn, f. pi.
BRASSICOIRT, «l. (Bra-szi-kur). Mun. l'fttb (h.) mit frummcn
'Sctbctfdjtn' tcln. Il adJ. M. tmiaimi.1, luiii*cnfdi.i. BRASSIÈRE , f. ou
BKASSIÈRES. f. pi. {Bru-szi-ar'). I. vêtement il'enfunt (ffiammê, «!.
Samiicl, n; — de nuit, Wadit. Wammê, m. Siadnltibdicn, n.
Oîaditjacft. f: fig. être en — s, ne pus être libre : bic S}'mtt jtbunbtn
habcn, nidit ftti banbcln lônncn'i /■am.omânjcltwctbcn*. n-vt tin
Hinb btljanitlt weibtn'; inettie, tenir (jn. en — s, jim. (a) jançitln,
brei'imunben, jtm. (a) irit fin Sinb tdjanbcln. j 2. Mil. pour porter :
îtavjticmcn, m. pi. HRASSIN, m. {Sra-szânff). 1. vase: ît.iuftiftl. '"• ê-
BiJupfannt, f. n. j 2. (juuutité lie bière : ïian, ni. (Stbtâubc, n. e, spl.
I 3. Suvonn. tint %'i'innc doU. BRASSOIR,v)l.(Bi-n-s:onr). 1. Techn.
!DîiAliU\irft. f. Sicifiûdc, f. Oiuiliatft, /■. ïliaitdibaifc, f. I 2. Morm.
Stâbd)tn(n.)5Um umtiiiircn. BRASSOUR, m. OU BEASSOURE, f. (Bra-
s:ur'). Sal. !Rôl)tt, f. ilcimi ffiafftf 9'insBRASURE, f. {Bra-sur'). 1.
alliage: Sôttt, f. I 2. opération : Sijtbcn, n. ■6("tlôtbtn, n. «; action :
t'ôtl)im.i. f; endroit soudé : ViJtbiltUc, f. ed)Wci{;ftcUe, f. BRATHYTE
, f. {Bra-tif). ou SABlNiTE, Miner. 3âbenbaum(tcin, m. è, c. RRAVA,
interj. {Bra-iru ). vctltcffli* ! ftllt jut ; biaoc ! BRAVACHE, «i. iBra-
trasrh'). fanfaron : tîicçtititbltt, »i. ')lufi*ncibtt, m. i, îlîaulbclb, ni. en;
Mtncmmift, m. en. BR-WAGHERIE, f. {Bra-^lHl-SChort").
(«lopvtaMttti, f: fiuni, m. eè, $pl. BRAV.^DE. f. (Bra-wad'). 1.
fanfaronnade : (Stoçpt.ihletti, /■. Mcncmmiftetci, f. en; farn.
(Stoçmàulijfeit. f. en. | 2. artion de braver: Iti'Çbieten. ii.Iti'tien, )i.e;
faire une — à qn, jtm. (d) ipobn bitten". BR AVABEU, «1. (STO-w«-
dé). çiatîlcn. I . BR.'V^ t.,udj.{Brn-u:').l.eourageuoc: iat\a. mutbiii;
intrépide : wailct, bebtt;t, ieijljaft; un homme —, lin mutbioiet
OTeimi; un — soldat, cin tafftttt 5clb.it; fam. — comme son épée,
watfet reic ftinc .ftliniif; il n'est — qu en paroles, feint lavfetleii
btdebt nut in 'Kctten; il est — jusqu'à dégainer, ti ift lavfct fc \anjt et
ni*i bet ^f(\en ^icbcn batf; promettre^ ruais ne fds tenir: iietne
oitltttfpttdîtn" aba nidilil alien".' | 2." honnête, bon, etc : bia», nMdtt.
icdîtidiaffcn, ebtlidi; un — homme, tiii î> finb icdnfdMffent Veutc, >n
. pi; vous êtes— d'être venu, 5ie ftiib ein biavet îl.inn "u eS ifi biitb
»i'n 'Sbnen, bafi 5ie bieibci jeloni. menTinb. | 3. fam. vêtu, paré
arersoin: bti,tu«,tcvnilïl, itetutJt. «jefdiinndt. (i.ittlid;; se faire —, fid)
teiaut-putsen; être — comme KREB une noce, — comme un jour de
Pâques, (ebi btiaue^tpufel fcin. || 4. m. homme courageux: tapfetei,
unetid)itidenit iDiann; tous nos —s (périrent), Me unfeic lajifetiicn,
adj. sub; héros : -^elb, m. en; mon—, mein aejlet, adj.. ^ub. liebei
gieunb, m. te, e; fam. alteê .&aue; l'aire le —, fid) muthij ftellen; se
conduire en —, (id) roadet ;eijtn;' mourir en —, mutbiçi itetben";
spadassin : ÎBitijeball!, m. es, -t , .fttaldct, al. i. Mcnommijl, m. en; il
a toujours des — s à sa suite, et bat immei eini^e 9iencm^ mtCtcn
in ftmtm ©tfolje; fam. (c'est un)— a trois poils, ■^aubeiten. »". 'itib,
»/i. en; faux—, îdieinbelb, m. i). 1. Siaor! febt gut ! bcttlid) ! || 2.
pluriel de bravo. BRAVISSIMO, interj. (Bra-wi-Szimo). biaoifftmc '.
febt gut ! btttlid; ! BR.WO, Ki.(Bittl, m. i. BR.VVÉ, ÉE . pp. [Bra-ié).
voy. BRAVER 2 ; Mac. gellieett. 1 . BU.IYER, m.{Brà-ié). 1 .
Cftî'i'.Siud'banb, n. e», =et; fabricant de —s, 'Sliidi. banbmadiei, m.
i. 'Sanbajifl. m. en. | 2. M il. du drapeau: t^ûitcl (>».) mit bem Tsab.
ntnbanb(d)ub. I 3. d'une c/ocfte ; S'.ôpftl. riemen, m. lebctnei
Mieinen e:net (Slcdt. | l. Techn. — du trébuchet d'une balance, a*fe
[f.\ tinet îdincUwaiie; Mac. —s, SeiW weti, ». .ftilbelftil, /i. ê, e;
i^nucoiiii. .îtet;, m. 5tct^, î'i. eê, e. 2. BR.IYER. a. Mar. tbccten,
teipid'en, mit îbeci bcfitcidjen'. BRAYÈRE./'.(Bl-
à-!a''").Bol.'îtal!et(./'BR.VYETTE, f. [Bra-idt'). .f;.oîcnfdilit. m. es, t;
pantalon à — , -frofen (f. pi.) mil cincm 'lUnbtilalie. BRAYOX , ni.
(Brd-iong). Chass. lellcteiftn, n. îtilteifen, n. i; Impr.im\n. m.
g.uH.iufd, m. Wtibet, m. i. BRE.VK. m. (Brdk'). î»te(il, )». meii.ibijci
3asifiva,jen. BRÉ.41NT, ni. {Bré-ang). ou BRI ant, Ornith. -îlinmet. /.
tSdbainmet, f. BHEBIAGE, m. [Brb-bi-a-j'). Jur. £*,if;oU, M. e*. t.
BKEBIETTE , f. {Brti-bi-dl'). îdM(. d)en, 't. ê. BREBIS, f. {Br»-bi).
7.ool. Sdiof, n. ,{^ t; rte — , S*af-«— «; lait de —, îdvtf' mildi, f;
troupeau de, — «djaf^tetbt, f. BRED — des Landes, <>tibtfitaf, n;
fig. écritura sainte : tamm in.) ®olte*; Relig. Watt» ïinb, n; —
galeuse, t,\ubiaee 3d>af; fig. homme vicieux : bôfei ilftenfd'; une —
galeuse gâte tout un troupeau, ein lâu. tiges îdia'f fiedt bie ganjt
{leeibe an; c'est bien la — du bon Dieu, et ifl eint gui» mûtbige
Seele; faire un repas de —, itc» dene oiad-ljcit, e(fen' oljne babti ;u
tiinlen; — qui bêle perd sa goulée, nKT bel Iif4« oitl pbiubett ftebi
mit bungtigem !]D)ag bctbipciitt. BREOIN, m. {BrO-dàng). Mar. ftô.
ïetnuif*el, f. n. BREItlMlIN, m. (Bm-lang-^iing). Heine Sîinfc,
5tai|talje, f. «laggatnal, ii. BRÉDIR , n. (Bré-dir). Sell. (mit Miemen)
;uiarainen-cefien; alêne à —, ^eftable, /'. n. BRÉDISS.'VGE, ««.
(Bré-di-sza-f). Sell. MiemennitH, f. -(. BRÉniSSl'RE , f. {Bré-di-sziir').
Med. fl'iunbllemine, f. RREBOl ILL.VGE, m.(Br6-dul-)a-f). t?CfH'IKt,
II. ». BREDUVILLE, f. (Bra-dul-Uf). JfU. ïtebenille, f. V.'utd>, m.
bcpv'cllc ïaitie im ÎMcatcalil>«Ie; marque 'A'iatle, /. n; SaMvfenniiV
w. 'Malfd'rfennig, m. e; avoirla — être en —, l'iatfd' ina*in .l'iinen';
grande —, gtofict 'ïiîatid', Xcfvelft'iel, n. f. t; petite -, lltinet 'Katid-,
cm, lad't 'Vattic; prendre deux trous eu —, Siïci i'tatid)lbd;n uebmcn';
marquer — •
The text on this page is estimated to be only 11.28%
accurate

BREL TOati'* an-mttttn; (marquer) à — , fcppdl on-m-tfcn,

an-Ujtii; (marquer) en grande —, oififai) ou t(n 9106™ ÎPÎatî* an-
ltjcn; gagner la petite ou grande — . ^cppclt ou oicrfacl) jcwinmn";
gagner la partie — ou la grande — , cin îoppclteé ^picl cic: trinncn*,
tic ^axùt tcppclt i\cTOinnen*; gagner le tour —, oUc 12 'ïàtt\ccn
(Mntctei. nanbtt) gettlinncu*; /!g, et farn. être (en) —, in Ux îintc
fit'fn'; se coucher — , rtinc Wtmîibtot su Stttt jclicn'; sortir — d'un
lieu, unccttiditctci ^aAc von cincm Cttc îrcji-ge^en'; sortir — d'un
bal, TOcç\-9Cbcn* utile gctanjt ;u bal'cn; Chass. revenir —, nidjtê
gtfdiciîtii ticiUn; désordre : Sctwif lunj, f; e?nbarras : Bttlcjcnfcdt, f.
î)tfiûtîunj, f. BREDOUILLÉ, ÉE, pp. {BrS-illlié). uiittutlid) lierjtflotttti.
BREDOl ILLEMEIVT , m. (BrS-dulia-mang). /Vim. (ïicftptter, n. é;
unDtrfiânt* lidîcS Sptc*tn, Stottcin, n. î^Kiftln, n; faire cent mille —
s, in eincm fsrt fiottein. BREDOUILLER, n. {BrU - dul-ié). 1. bégayer:
flpttctn, ilammcln, an-fioç(n'; unttutlidi ipicitn"; dire vite : hr-
fâinattein. fptu&fln. ! 2. o.hcr-iiammftn, ^cr-rtot* tnn ; dire vite :
htt-f*natttin, bttau*fçtubdn; un discours^ etc : ticr-fioticin.
BREDOUILLEUR, m. {Bra-auI-iSr). GtpttcrcT, )/î. 'irtainnilcr, ?n. ë. 1|
— euse, jf. Çtainmlrtin, f. ncn. BRÉE, f. IBréh). Teehn. (fiftnbtfdilag
(m.) um tcn ïticl tt8 SdimirtcbammtiS. 1. BREF, BRÈVE, aty.(Bi-
a/').C0M)-(; fut; t ; succinct : tuiî jcfaê' ; être —, [i* fuij faiftn, fut;
çiefaçt (cin; soyez —, faffcn ©ie itdj furj; impérieux : Eutj
abfettigcnb, aigc^Dgcn; rapide: tafcb; (avoir) le parler — , la parole
brève, cinc tuijc Jluèttucfl. ftcifc; être impérieux : in cincm
gcbictctifd)cn îonc tcScn, in cincm furscn It-n rctcii; répondre d'un
ton — à qn, jcm. (a) fur; abfntigtn; explication brève, futje I.ujttI"
lung; réponse brève, fut;c 'Jlntroctl; petit, court : tlcin ; Pépin le — ,
licpin bcv Slcinc ; Philippe le — , ISbiliçi) bct Jïlcinc; Gram, syllabe
brève, IUT,c 2l)lbc; voyelle brève, tutici l^oîal \ Mus. note brève,
lutic Jiotc. || nrtve, f. func îfibc, f. bic Sut;c , ndj. sub; fig. observer
les brèves et les longues, '.HUeè aué~jir= hln-, BoTiidjtig ^anbcln; il
en sait les brèves ei les longues, er ocTflcbt nd) batauf; fum. et ïennt
bcn ÎHummcI; en — , in ^ui^cm, in bel fiûtàc, mil tuTjcn ©cttcn;
tuti, ïur^ um, futi unb gut, mil eincm 2Boitc. 2. BREF, m. 1. Stcoc, n.
«, pàpftlidjcê ©d)tcibcn, /f.ê. ] 2. bréviaire: ÏPrcpict, n. è, c,
îPclfc*tmuibudi, n. é, -cr; calendrier : jlird)cnfalcKbcr, nî. e. | 3. Alar.
^a^. m. fcS, -JTc œccbticf, m. I, c, Cîilaubniji (/".) jui SiiSfa^it. I 4.
Tiss. 3ettcl, vi. s, îpatt, m. ti, c. BRÈGE, f. {Brdf). ou BRÉGIER, m.
{Bré-jié). OU BREGIIV, m. {BrS-jàng). Péch. iBcutcincç, 11. ci, c,
cngmai'djigcS îic^. BREGMA, m. IBràg-ma). Anat. !Bicg. ma, n. i, pi.
— jmcn, Scibctfii)àbcl, nî. €(ï)cilcl, m. î. BREGMATIQUE.acJ;. (B™<7-
m«-Ii*'). €d)citcl.t— «, Sd)âbcl-t— «, beè SdîeitcU; fontanelle — ,
Sdjâbclblatt, n. BRÉHAIGIVE. ndj . (Bré-hà-gn'). Un. frudnbat. || /".
unftud^tbatc 5rau. BRÉHER, a. fBre-hé). Afn ce'c/i. îîigtl in bcn ijuf
tin-fdjlaiicn'; —gros, ju ticf cinfdjlagcn'; — en musique,
unrcgclmâ^ig cin(c^lagcn". BRÉHIS, m. (Bré-i). Zool. CSinljotn.
è"9c. ( BRÉIXE, /■. (Bré-in'). Chim. Sicin, n. «. BRÈLAGE, m. (Bia-la-
f). HydrSefcfiigunj (f.) butd) £*nûilcincn. BRELAN, »!. {Brii-lang). 1.
Jeu. Btclan, n. Iicfd-actfrid, «. Siimpdi'pid, u. l?tlt) ilartcnfpid, n; —
favori, — mignon, itci 9'ci:ugétiirtcn, f. pi; avoir — carré ou —
quatrième, brd mit h-m Umfdilajc gldcfcc â^ittcn babcn; avoir — ,
tteitilci*t Saitcn ou cin Itciblatt Ijabcn. | 2. lieu où BRES ron joue :
Spicltiau^, ii. fè, -et; tripot : Spicllioljlc, f. n; a-voir, tenir — chez soi,
befîânMj bet bfii ^artcn fx^ixi'. BRELANDER, n. {Bro-lang-dé). fin
SpieUt fcin, fîctëi kaiun fpicUn, immci in ©pitlhaufcrn licgen*.
BRELAIVDrER, m. (Brd~lang-dié). (Stifpiclci, m. é. Il — ière. f.
StifpicUtin, f. ncn; fa^n. ©pieiraite, f. n. BRELAIVDrvIER, m. {Bro'-
îang-diniÉf)^'3tr.ïÇcnDcrf.uifer.ïn..ÇiânMct,m.fi,ràmtt, m. ïtantti.imcr,
m. é. || — ière, f. Jpânfrf lerin, f. ©lantEiàmctin, f. ncn. BRELEE, f.
[Bro-lé). Agr. ®intcï= futtcr (m.) fiir ^d)afc. BRÈLER, a. (Brà-Jé). mit
Sd)niitlcinen tcfeitioicn. BRELIQVE-BRELOQI^, loc. adv. (Brô-lik'-
bro-/oh^\ . -^alé ûbct ficpf, inë ©cla^ himm, hcr unî? bin, fomm
unb jeb. BRELLAGE, «ï. [Brâ-la-f). Pont. Scfefiiaiung (/".) î-ut*
'Sdjnùileimn. BRELLE, A (BràV). Cfwi, 3f«î-. ^lo^, /i. 'Jlinbflpç, n.
itcê, -^ifc, ®ebinfcc, n. ë,5i)^ îticticlfloîTc f. n. BRELLER, a. (Bro-
^e). Pont. lôtcln, rcitcln, fcfl-TOtdn; — un cordage, eimn Strang ûn-
tnubcin ou Qn-jieben'. 1. BRELOQUE, f. {Brô-lok']. Mil. voy.
BERLOQUE, îicmmeiriçinvil (n.) jum îluêthcikn; battre la — , jum
iî^n\ tri-'m» meln; tîg. divague)- : tipa^itcn; dire des niaiseries :
fafcin. 2. BRELOQL^, f. i. bibelots: iSctlodc, /'. {pi. — n et — è),
^Itinigftiten, f pi. ,Hiam. «). é, spl. Il 2- — s, f. pi. bijottx : iPcrlpdrn,
f. pi. Ubigcfeâncic, n. llt^rgcbân^fcl, H. î, spl. BRELLXHE, f. {Br6-
Uisch\ Com. Scïlud)e, /'. n, baumrooUcntë 3^1*31. BREAIE, f.
{Bràm']. Géogr.^umm. n. è; de —, btcmifdj, von îBrnncu, btcmtt.
indérJ. îîtcmct-*— «. 2. BREME, f. 1. poisson : Staffen, m; —de mer,
'Kccrbiaffcn, m. ê. | 2. insecte : '^rcmfc, f. n. BRrâlOIS . OISE, adj.
{Bra-moa). btemifd), î^tcmcr-e^ ; habitant : Sunict, m. ê. Il — oise,
f. Sremcrin, f. ncn. HRENADE, f. (Brë-nad"). ou brenÉe, filcicnttanf.
m. iSânfcfuttcr. «. è. BREXAGE, m. (Brà~na~f). Fèod.
■Ôunbcfùitctun^éftcucr, f. BRE.\ÈC1IE , ;■. [Brô-nàscK). ©irncn=
mofî, m. BREIVÉE, f. {Brv-né). SUicnttan!, m. (5^ânfcfuttcr, n.
BRENELX. EUSE, adj. (Br'à-no). btccfici, mit 3Jîcnfdicntotb bcfubclt.
BRE\XE,/".(Sj-flïi.').(«art)'3citcnaDfî',»i. BRENTE, f.(Brongt'}. 1 .
insecte: ^an^' fàfer, m. \ Ï.Ornith. fdjottifdie SîaumiVïnè. BREQCIN,
m. {Brfi-hàng). Terkn. vilebrpqtiin : Sctjrcr, m. ©inîiflbobTtt, m.
3pi^bcbrcT, m. è , i^cbretfc^ncibc, f. n i Charp. \lmfd)lagbobrci, in.
BRESAGXE, f. {Bro-sagn'). Ornilh. Si^leicuuU, f. n. BRESIL, m.
{Brésil). Géogr. I. Sta. niien, n. è. | 2. bois de—, îBrall'licnboli, n; —
de Fernambouc, 5etnûmbu!hoIji, n ; Prov. sec comme — , bû« ivic
Sttotj, aui':ctcrbcntlidi trocfcn. BRÉSILIEN, lENIVE, adj. [Bré-siliàng).
iSraniicn-^— «, btafUiaiiifdj, brafîlifdi. ]| m. habitant : IBrafilianet.
m. ê. || — ienne, /". StanliancTÎn, /". ncn; langue : baë ïïtafilianifdit,
adj. sm&. BRÉSILIXE, f. (Bré-si-HW). Chim. 33tafilin, n. ê. BRESILLE,
ÉE, pp. {Bré-sil-ié). 1. cassé : ^crbrodelt. | 2. Teint, mit aJiafiUcn»
l)clj gcfârbt; /fg. feod)H'tb. BRÉSILLER, a. [Bré-sil-ié). I . casser:
^CTbtocîcln. fut; unfc ïlcinbrcdjen*. | 2. Teint. mit îStafilicnbcl^
fàibcn. || 3. n. oon îrcden» bcn in Staub icrfaUen". BRÉSILLET, m.
{Bré-sil'ia).^io,'\\Vit' to, n. ë, fdjlcdjtfô ©rafuienljolj. BRET 171
BBESILLOT, m. (Bré-siï-io). unâdjtel Sraiilicnbcls. BRESOLLES, f. pi.
{Brô-soV). Cuis. ïï.igcut (u.) non Jîalbflcifd^. BRESSAN, ANE, adj.
[Brii-szang). auà bci ÏÏTCffc. [j m. langue : OTuntart (/.) ûuë ter 2?
tcifc; ?I«b^Aa*^(.■ ©croobncr (m.) aué bcr Î8tc)fc, auè bct Srcffc
gcbûttig. BRESSIN, m. [Brà-szàng). ou bréCIN; 1. Mar. ^iptau, n. |
2. corde ; ^o» fcni'cil, «. BRESSON, m. {Brà-szong). rott)brau» net
Dd)ë, 7n. en. BRESTE, f. (Bràs-V), Chass. Oîogel. fûnj (m.) mit
Çpdfpcifc. 1. BBETAGNE, f. (Brd-ta-gn^). l. Géogr. îStctagnc, f; oncle
à la mode de — , ^iitcté odt 9JîuttCTâ @cfdiTOiftcTfiub; iron.
wcitlâufiiict ÎDfTTOanbtrt, adj. sub. \ 2. Ar^gletm-rè: Sritannicn, n;
Grande — , C^noê» biitannicn, n: Nouvelle — , 9teubiitannicn, n. 2.
BRETAGNE. A Çeiniuanb {f.) auë btt iBretagnc; danse : 'étctagnc, f.
altcr îanj. BRETAILLER, n. {Bré-tpil-ir). (fi(ï)) jctn laufen, cin
^IcpMlcr oî4ÎHaufbi>lï fcin. BRÉTAILLEL'R , m. (Bré-teil-iôr).
îRaufbplt, m. ce, c, âlppftfd)t(r, ?n. p. BRETAl'DÉ, ÉE, pp. (Br6-to-
dé). unglcid) gcfdicren; cheval — , iPfciïi mit ge* (îu^tcn Cfcren.
BRETAUDER, a. (Brô-to-dé). tondre: unglcic^ fdjcien* ou ab-
fd)ncibcn' ; tondre trop court ; ^u îur^ fdicrcn* ; Man. un cheval :
bic Dt)Tcn ftii^jcn (d). BRETÈCHE, f. (Brii-tdsch'). bretasse,
bertesche, brktesque, bretène, BRETOiscHE. Art mtl.Btas. ÎJuig (/".)
mit 3inncn. BRETELLE, f. {Brô-tàV). i . Techn. de brancard, de
brouette : îragbaiib, n. cô, -et, îtagtiemtn, m. ê; de pantalon:
■^pfeiittâgei, m. è; Passem. BtcteUcn, /".p?; halage des bateaux :
.vjalètuppcl, f. n, SugCcil, n. è, e; Mil. — de fusil, JUnten' licmen, tn.
©cwebïticmen, m; — portecaisse, Itcmmclttagiicmcn, m. ; — de
sabre, "^âbclticmcn, m ; — de cuirasse, îlcblclKinb (rt ) an Âûtv\§;
passer par les —s, ©cuKbriicmcn laufen*, uncfcilid) madjcn. I 2. Pé-
h. ticcbunbégatii, n; Prov. en avoir jusqu'aux — s, par dessus les —s,
bië ûbct bic Dfeten im îdjlammc flccfcn; être ivre : gan; bctrunfcn
(fin. BRETELLERIE, f. {BrQ-td-lÔ-ri'). ^ofeuitâgermad)Êtci. f. en;
Com. J&ofcnttiigcT' ^anblunc(, f. en. BRETELLIÈRE, f. (BrÔ-tàl-iar^).
Pêch. 'rccbu^^ëli^arn, n. ■Ç)albfad9aiu, n. i. BRETÈQIE, r.
[Bru~tàk').Mil.&An, m. té. - c, îrcppr, f. n. BRETESCHER, a. {Brii-td-
sche),Blas. mit Sinnen ocifcl^cn*. BRETESSE, f. {BrÔ-tasz'). ou
breTÊCHE, f. Blas. ©utg [f.) mit SinnciiBRETESSE, ÉE, adj. {BrÔ-ta-
szé). Blas. mit abirc^felnb l)o^cn unb niebrigen 3innen (vetfcbcn).
1. BRETON (en), {BrG-tong). Mar. quct; mis en — , quct licgtnb. 2.
BRETON,ONNE,ad>.33tctao,nci-»-«, btctagnif*. Il w. langue : \>:\^
Sictagnifcbc, adj. sub; bas — , baè '1îicbct--3?icta^ni("dîC, adj. sub.
btctagnifcbe ÎDÏunbatt; habitant: Srctagnct, tn. è; anglais : Stittc, m.
n. || — onne, f. Srctaiinfiin, /*. l'tittin, f. ncn. BRETONNANT, ANTE,
adj. (Brô-tûnATTgr). Bretagne — ante, îbcil(m.)i3on bct iBtctaLine ne
brctn^nifd) Qcfpï0d)cn wirb; Breton ^^iBrctagncr îct tic btctagnift^c
Î
ÏDÎunbatt fptidji. BRETTE, f. {Bràt'). fam. ÏRaufbcgcn, m. icfelâgct,
m. é. BRETTE, ÉE, pp. {Brà~té). ou BRETTELÉ, ÉE, pp. (Brà-t3-lé).
dentelé : û|cj|abnt; muni de dents : 3fltjn-*— «; marteau — ,
3»i^ubammct, m. S. BRETTELER,rt.(-Brâ-?ô-?e). ou bretTHR, 1;
Arch. bctappcn, mit bcm Sabubam* mer be^aucn'. | 2. 3/an.
iS^ncn, jvï^nelru | 3.
The text on this page is estimated to be only 14.51%
accurate

*72 BREV Smlpt. mît ciiuiu iatfi.\tn Dniitummlt Knrtcimi ;

Gi-iii-. l'du.ifftttn. | '». chercher nuise : vànM uv Slttit fudjtll.
IIKETrEMJlE, f. (Bra-tli-lur').Ch-tOittutiuiiii, f. 3al)iifltid), m. g(j;il)mltt
Oit. Kit; Gr«'». Sdjtafiituluj. /■ BRETTEIl, a. (Hrà-ti'). ). se iwdre;
SiuKI (udicii, ûd> taufcn. | 2. voy. bbetTEi.EK, jaliiitii, btra\!pcil.
IIRETTEIII, m. iBru-lur). ou BRETTEliX, .m. (Brii-tii). MauiboR, m- ti.
c, tfitMommift, m. tn, Sdjlâjtt, w. ê. BRETTlJtE, /•. (Brà-tiM-'). Sr-uipt
Biicîcni'liid), m; dents : Saljn. «>. 8, = c, 3adcn, m. è. 1. nRElilJL. m.
(Bi-ovl). Mi'r. (Jtlt.ul, n. ce, c. !. BUEIHL, m. petit bois : 'Srûl)I, m.
jCïlMuencé (^cbiiîdj. BREtlILLÉ, ÉE,))p. [Bràul-ié). Mar.
ju^iniuicni\eiin\cn, bcidilaitcii. BHEUILLER, a. (Br'ùul-ié). Mar. nuf-
ijcitn. BREIJILLES, f. pi. [Brâvr). Mar. cordages : IStitau, n. tê, t;
Pêch. Sinje' wcibt (n. })/.) bct Sctil(d)c. BREUVAGE, VI. (Bro-tpn-j"').
©ttrint, n n, f, — des dieux, Oôttattaiit, m. c«. ^f, iron. ©tbtâu, «,
t«, spi; Vétér. ai;, ncitiant. m; il/eVi. Itiinr, m. e«, -c; Jl/nr. ©tin mit
SMa(f«. BRÈVE, A (JS)-(iw'). 1. Gi-nni. tiltit 6t)Uic, f. 11. I 2.Af«s.
jiveioittttl 5iotc, iut;c îï^tt, /■. 11. I 3. Monn. Diûmohlicftiiinj. /. I i.
Ornltli. tuti(d)»in5ii\Cï 3iûbt. BREVE (alla), (Bré-wé). Mus. allabreve,
im Slutijaititcltail. BREVET , m. {Brû-wé). l. Jnr. anc. ojfcnct
©iwbciibtiti, Sc(ltUuii(\6l"i'î. m- ni, c. I 2. titres, diplômes : ^Jattiit,
n. "Bïioct, Ji. Diplblll, n: — d'une pension, fatciit (n.) iU tiiicm
ISdiabcnacfialtc, ©iiattiiijtbaltobiief, mi — de duc, .Çctii-gi!. Mplcm,
Ji; — de général. (iSciittol*|>iitciit, n; — de capacité, îîiipliMii (ii.) tti
Stfâllijung ; duc à—, iiidjt crblidict *ctjfi); justaucorps à — , blautè
mit liH'lb .Jt. cnbi\*, n. %). | 2. ii» iiuviit. m- .' paltmitcn; se faire —,
ciulJattnt mbmcn . BRIC 2. BREVETER, n. Teint. taujCllfal; (n.) mit
(djTOtfcllauttt Ibriicibt mififetn. BREVEUX, m. (BrS-tcd). Péch. ^Um^
mttbaltii, m. Âtabbtbaftii, m. i. BRÉVIAIRE, m. {Bré-wi-àr'). t.
53rcriatiuin, n. "Stcrict, îi. 9. t, t^tbttbudi. il. t«, "et. I 2. }irière :
Scbtt, n: dire son—, (tin Bitbitt btttll ; il sait jilus que son — , tt taiiii
mttit •'). futib,uid)i.v BRIBE, f. [Brilr). 1. de pain: gtoêtê 6tuc! Stol',
'Btodtn, m.i; fnm. Olunfcn, m. Mauftn, »i. I 2. restes d\.n repas :
lltbet. ttilc, m. pi. lUbttbltib(tl, n.pl. ûbiiftaU(li'(i. m ci, -t ; Bill. (diit(t«
3iitiiilvt'tUt". 'ï"'■ faire une bille de —, cincn 5)aU bllid) 5)titclt
madicn, biitdi tincn Olbditumj vi'ii btticilc ttt(tcilV I 11. Techn.— du
trou de foi-erie, Dbct|;(tiiint, /'. n , Mm. ■.ndiitlitil, «.«,t;
.Var.Utbtt,3twid)t, »i. té, t. | 7. Mil. — balistique, '3Uuvfma(d)iiu, f. n\
Artilt. — de canonnier, — n canon, 3«SIIulf llmimcitn ijtbtu". || de —
, adv. Mitd) iHûdixoU, lildpwlKMVciit; fig. BHID oui UiniDtitt ou
5d>IttdjrotJ[C, but6 îRùtltoit* (unj ; par—, nidjl jttatt j'u, tutdi
ab(ptun3. BRICOLÉ, EE, pp. {Bri-ko-lé). btitf. liit; (affaire) — èe a la
hâte, fdjmU ab. çitmad't. BRICOLER, n. fSri-ko-lé). 1. Jeu. biitolirtn ;
fig. aller par détours, ete : aUttlti llinM'rctift maditn, îtiitiirotçit ou
■Huèflùd^tf (u*tn, ftummt ©ttit ivbtn'. I 2. Chass. al>-(*ii!ti(tn,
umbtt-itttiftn. j 3. Mon. (in tnjtn 'Btjtnl octfidilij jtbtn', m 3illjad
i(thtn'; ;!g. part, dune perionne: mit tin Stltunttntt jtbtn'. ||4. a.
manger gotilu/inent : jittii» tiftn'; — une affaire, tint Zai)t t,i{d!"ab-
'ftitijtn. || 5. se—, r. un^ttiditft ttjttbtn"; comment cela se bricole-t-il,
wit roitb taê jtmadît. BRICOLIER, m. {Bri-ko-lié). Man. Mtbtiipfttf, n.
te. t. BBICOLLE, f. [Bri-koC). Pfch. voy. BRICOLE. ItRICOTE.WX. »!!.
pi. [Bri-ko-to). Tiss. œn-ttlottcn, f. pi. BRII>\BLE, adj.[Bri-da-br).
(cheval) —, baé (idi jûjtln làçi. BRID.\GE, m. (Brt-do-j'). (âmmtlidx
îta^titnitn. n. pi. BRIDE, f.(Bri-d'). 1. 3aum,«l.f«. - (; — a branches,
etançitni,ium, m: rênes : 3ûjtl, m. «; mettre la — (à un cheval), îtn
3.uim an-ltjtn(D), ,iu(-iâumtn (a); oter la — (du cheval), btn itivm
,ib-!tjtn ou .tb-lltl'mtii' (D). ab-iiumtn (a1; prop. et fig. tenir en — .
(d'at( im Sûjtl ou im 3,ium b,ilttir(A); tenir à qn. la — courte, itm.
(n|bcn.3i>vltut;balttn"; rendre, lâcher la — (à un cheval), rendre la
main : bit 3ûjtl (dîitpcn laCtn" (d); lâcher la — (aux passions), fttitn
(i,iuf lafftn"; laisser, mettre la — sur le cou (à un cheval), bcn Ri'ijtl
auf btm -Çnilft biinijtn lafîtn* , bit 3ÛÇIC1 (djitftn laiftn-; /i .tiibtti!
btfinntn'; fig. aller'— en main (dans une affaire), bf y butùiin
tttf.tl'tjil"; aller — abattue dans une affaire, unbtfpnncn jU ffittlt
jtbtn". | 2. —s à veaux, luuiiftbt lïtûnbt, m. p(. .ibçitfdimadtt (rn!
(*ulbijuiijtii, f. pi ; il a plus besoin de— que d'éperon, manmuç ibn
tbti jUîûdKtlttn, al« anfvotntn; Ai». mener parla-, am3aumt (ûljitn;
tenir tjn. en— , |tm. (A) im 3aumt balltn"; Pmr. achevai donné on ne
regarde pas la —, tintm jtfditntttn (?aul l'ubt raan iiidit mi !D!»ul. | 3.
d'un chapeau, d'un bonnet : ®anb, n. t«, -et; d'un béguin:
iuubtniitmtn, ni. i, d'une chemise : ^tmlùi^ii, ni. Sd'lofi, >i; de sous-
pieds : -îltupvt. /",- de boutonnière : ^UnH, m. iï,M6v*tn, n.
auttn.ttb, A.- dentelles: iHiti(Cl,M. Slumtn. n.itb f: Chir. Stt.iim. 111.
tê, -, (?ittf baltn, «1. Gltipflod. "i; ijt(pannttt itbntn(ittif; main de la
—, 3vi.tflbaiib, /•. bit linfe .&aiib bté ÎRciuiJ ; ce chevtil boit la —
bitftin Vftibt ,\tht b.ié Oïhinbiiiid ju retit iné £D!,tul. | 4. Mar.
ftUimmttbJltii. m; — de bateau. licibinbuiltléMtd', il. | 5. Charp.
fll.immtvb.tltn, m. iRinj, mi.- Soi-c tfiftmin,), «i; mettre une — à une
poutre, tintn SÀlitn mit tintm tiitintn 'Siiijt «t. ftbtn"; Charr. .«Ummtt,
/■.SUtmmtibiiftn. m; d'une cloche, d'un mouton .' Dtbtt. ^
OHodcniJbtc, f.SftnM, m; Machine à vap. — du parallèlosrainme,
\it\t(icin>3C. f; — d'excentrique, ïfîttnttitbùçitl. »n ; tii
The text on this page is estimated to be only 12.12%
accurate

BRIF i. BRIDÉ, ÊE, pp. (Bri-dé). I. Jt. jàuml , cheval sellé et

—, jefatttltcS unt jCiiumttS Ilfct^. I 2. canons —s, fait* çic lidjtctc
unS iuûimmtujtlôttcu îopfcljtlâuff, n. pi. I 3. fîg. oison —, tummc
(^mè, finfiltijtt OTcnfdj. | 4. Zool. yjàunit, tiali2. BRIDÉ, m. Poiss.
eoliaicnnf*. 771, Cé, C. BRIDEJIEXT, m. {Bri-dS-mang). 3âumcn, n.
ê. BRIDER, (7. (Bi-i-de). 1. jâumcn, u'ijtln, 6cn Si""" an-Ujcn,
auf-;âumtn. | 2. seri-ec ; rttiftn, \a fcjl iitbun>cii fcin, ju fcfi ûn-
lit}tn"; le béguin bride trop cet enfant, 'cit ^autt ifJ ^tm RinM ;u fcft
anjc buntm. I 3. fig. et fam. retenir, contenir les volontés de qn: in
Sdranfcn Iialttn', icifcln; — le nez à qn. avec un fouet, jtm. (a) mit
ciiict Iciliaic qutt ûtct M* (9cfi*i haum"; lier : binbcn'; — qn. par un
contrat, par un acte, iem. {aJ ïutdj bit btm dcntiattt anjtbin^tm
Slauftln HnScn', jtm. (i) iu cttr. (d) wtbinien'; fig. — la bécasse, jtm.
(a' Vnwni ijidjt fûljitn ou, jtm. (a) iibttliJlptln ou, an-îiibttn \ fig. —
son cheval par la queue, cinc éaii;f octStbit jn- f.injtn" j Jeu. — la
potence, — le faquin, (bcim Minjelitmicn) îtn !Rinj tttfcbltn; Cu,is.
idumdi. juûm. mcn-binbcn*; Fauconn.— les serres d'un o> seau, an
jctem Suce tté Salltn tint SUut ftji-binbcn". | 4. Mar. des cordages:
!icujtn; — l'ancre, ttn îlnitt bctlcibtn ; Péch. — un tilet, bcn ^ad ein-
îitben' ; les cloches : beittn, (intn ciûtncn îwbt an btm Slôppcl bti
©iDtfe btfcjiijcn; — une pierre, tincn îtiiif um tintn cttin iéUjtn". | S.
Mil. une forteresse : blcditcn. || 6. se — r. Man. btn Sopf jut ttajen'.
BRIDEUSE, f. (Bri-dSs'j. Spi^mma4?€iin, /". 3piçcnîlôpplcrin. f. ncn.
BRIDIER, m. (Bri-dié). OU ouvrier ^. o^ummaict, m. é. BRIDOIR,
«1. (Bi-i-doni-). mentonnière : .ftinnbanfc, n. té. - ei. BRIDOISO^■,
m. IBri-doa-song). @imprl, m. tummci ÎDieni'di. BRIDOLE, f. (Bri-
doT), Mar. Snc. btlbotj, rt. BRIDOX, m. [Bri-dong). 1. ilan. Itrafc, f. n
; —d'abreuvoir, fflaîTetmnft, f; — ordinaire. îlibcilôltinfe, f. — de
manège, Sdiultienû, f. \ 2. des religieuses : Sinntu*, m. ti. - ex.
BRIDURE, f. {Bri-diir'). Mar. — des câbles, Situjuna [f.) oit
Sufammcnbin. fctn (n.) tti îaue. 1. BRIE, f. \Bri'). des boulangers :
îeijflôpftl, m. i, Itijptitf^c, f. n. 2. BRIE, f. (Bi-i').ouBRAVE, Siljlamm.
tttt, f. 3 BRIE, m. fromage: CUn] Sàfc, m. ■ BRIÉ, ÉE, pp. (Bri-é).
É
Pat. jtfliîlajtn, Stïlopft. BRIÉE, f. {Bri-é'). Pât. gtfi^lajtnti Xfij. BRIEF,
BRIÈV'E, adj. IBri-df). concis: hïini>\c^; sommaire : fummatifd);
faire bonne et briéve justice de qch, ciw. (a) luij unb L^ut
cnîfdieibcn*; briève sentence, fummvat\f*er Î0ei'*cib. r.7f* ^cfaUtcè
Utibcil ; être ajourné à trois — s jours, aufcic» foTbeit TOCiten*
innttbalb bici Xajen ju «î(!^ci' nm. Il en — , adv. balb. BRIER, a.
{Bri-é]. (Itn Xtij) fdjlajtn*. BRIÈI'E.'WEXT , adv. i Bri-à-Komang). voy
beief, îut;, îût^tid); concis: biinbiçt; sommaire : fummatifd), mit
tocnigen'îBpitcni (raconter qch.) le plus — possible, (o înij aie
môjlid). BRIÈVETÉ, f. {Bri-d-wo-té). Siitjf, f. BRIF.WD 014 BEIFAUT,
m. {Bri-fo). l. pop. Stcçfai, m. HiUijt ttjcjcntè Sinï. I 2. Chass.
3agbbunt, m. BRIF AUDE, ÉE, pp. {Bri-fo-ié). jf tidmptlt. BRIFAfDER,
n. (Bri-fo-dé). 1. Manuf. tcn (ïftcn itràmpcl afbcn", îtàmpcln. | i. voy,
BRiFEB, gitiij cfïtn'. BRIG BRIFE, f. {Brif). I. du ver-^soie :
©eftdfeioilcit (f.) bct «cifccnftûrmct. 1 2. pop. BRIFE, ÉE, pp. {Bri-
fé). dévoré: cerfdjlun^cn, gcîtcîftn. BHIFER, a. (Bri-fé). pop, manger
avidement : ftc)Ten', ù,ici\^ eiTcn*. Udfchlin» gcn*; abîmer:
Dcr6etbcn'," ocrfnitlcrn , ret» ifjun', JU (Stunfcc ii*tcn. BRIFETR, m.
[Bri-fôr). 1. rnavi^ geur : îiicifraë, m. ^Tjficffcr, m. | 2. homme sans
soins : ^lnia\ixxc'\^tx. m. è. ]|— euse,/". Stcffftin, /"-
^Icitctjciiciifctin,/'. BRIFIER, m. (Br i- fié). Plomb, enfaîtement :
SUicinfaffun^. f. BRIG, m. {Brig). ou brick, Mar. ©ticiû;. ;*. Stid, f.tn.
BRIGXDE, A (Bri-gad'). 1. Mil. Sriçiate, /". n ; — d'infanterie,
Onfanlcticbiis ^atc , f; demi , .^albki j,aî)C , f; escouade.-
îlbtbcilunçi, f. en, Dîotte, f. n; général de — , '^rio^att^enfial, m. i.
c. | 2. Mar. Sti^abe, AI 3.' d'ouvriers : %\>> tbeilunOi. f; — de
police de sûreté, 3id^ct= t'eîtépcïi^cibrij.atc, f. ric^ftbcitêbti5a^c, f.
BRIGADIER, m. {Brî-ga-dté). 1. Mil. — (des armées du roi), 'ètigatia,
m. I 1. caporal : ^cr ©cfTCilc, adj. suh, ■Bti^abifi, Ht. ïiîachtmeifttT.
m. ê; — de gendarmerie, îSti^afcier (m.) bci btt Canbuu tcTti. 1 3.
Mar. 23ptmann, m. eê, -ci [et — leutc), Soûtèma(a)t, m. | 4. Poiss.
Stidj» linj, m. ÎBcciémann, m. BRIG.UVCE, /". (5rt-pan-Si'). Géogr.
BRIG.4M>, m. [Bri-gang). 1. Wâubfr, m. è, îttaFtntâubcr, m. ê,
©anbit, *n. en; de — (s), ÎRâubtr -*— « ; troupe, bande de —s,
ÎRàubcibdnbe, f; fig. ÎRaubeiçiennï'cl, rt. ê, spl; compagnon de — s,
OîaubÔCfell, m.en; chef de— s, SRaubdljaupimann, m. é. I 2. qui
commet des conci4^sions : ©clbctçifffd, m. è; assassin :
îDîeudj(lmor= tti,«i.é; marchand frauduleux : 5çiÇ= bute, ni. iti fam.
(attends) petit — ,ÏUintr lûujcnicfctj. Il 3. —s, tn. pi. H. de France:
•iPaniCtïmcbtf, ??). pL BR1GA:N»AGE, m. (Br/-Êïa)i-rfa-J'). l.ïHaub,
m. ïtiaçtntaub, m. e^.sp/. SRâubc* rd, /". en. 1 2. fig. vol : î)i(b(iaM,
m. ©e tiù^erei, ;'. Xiebctei, /". Spi^bubetti, f; détourne77ient :
Unleifdjleif , m; concussion: dcncufûpn, f: il s'y fait de grands — s,
(ftprctTunj,en(/".j)?.)»rftb(nbert ccmc^tct. BRIG.AA1)EAU , m . [Bri-
ga n^o). fam. îpiÇbufae, ?n.n, unieî)Ii(^ei Sad)TOaIttr.
BRIG.AA'DER, n. (Brî-gan-dé). fam. rauben, fie^lcn', 3tiatientdubeiei
ticiben'. BRIG-A-\Dt\E , f. (Bri-gan-din'). Mil. ('îlit) 'i*aniet&emb, n,
eâ, en. BRIGAATEV, m. {Bri-gang-tdng].ou l.BRIG.VXTIA-E, f. (Bri-
gang-tîn^). 1. Srioiantine, f. n, îleinc '^i\%%. | 2. lit: Seltbett, a. tê,
en. | 3. hrigaiidine : (îlii) *Jîan^cthmt, m. eê, en, 2. BRIGAXTEVE,
/". ou BRIGANTIN, Mar. 1. itat'ire.Sti^tantine, f. \ 2. voile:
iBtiggfegel, n. è. BRIGALT ou brigot, m. (B)i-yo). Coïîï. iBtennboIj, n.
të, sj?/. BRIGITTE, /*. [Bri-jit'). n. pr. ^x\' gitte, ;'. iBngitta. f.
BRIGITTÏX, m. {Bri~ji~tùng). ©rigi» tinet, m. è. \\ — ine, f.
Siigittine, f. n.' BRIG\E, f. {Bri~gn'). Zool. Barfdi, m. c^, t.
BRIGXOLE, A {Bri-nioV). Bot. ©ru» noUf, /■. n. BRIGNOLIER, m.
{Bri-nio-lie). Bot. iBiunolicnftrauc^, m. tê, ^e. BRIGOT ou BRiGAUT,
m. [Bri^go]. iBtcnnbcU, n. té, spl. BRIGUE, f. {Brig'). i. pour obtenir
un emploi , *31mtéTOerbetei (f.)um{A); intrigues : iRânîf, m. pi;
poursuite vive : eiftige Setfolciung nad) (d), tifri^icë ©efttebfn nad)
(d) ; manœuur^ : Umtiicbc, m, pi; inhale : Gabalc. /". n. | 2. faction
: %n. banj, m. i, spl; — (redoutable), Dîcttt. f. BRIL 173 ^Battei, f.
en; faire des —s. 3î«xmc tr€i> bcn", jidi bciuctben' um (a); à force
de — , par — , burdi ÎOerbciei, mit Umttiebcn. BRIGUÉ, ÉE, pp. (Bri-
gé). gefu^t. angeimbl. BRIGUER, a. (Bri-gé). aspirer après qch .
fitcben, trad)ten nadi (d); tâcher d'Ob' tenir . nd) (a) btroeïbcn* um
[a), laufen* nacfe (d), bnveibcn* um (a); solliciter avec ardeur:
l'iidicii (A'.fi* eifrij beirctbcn* um(A); par des ynoyensi détournés: jU
eifdjleidien i'udîen; — la gloire, jum Mubm ju c\cUin*\cn fudicn; —
une place, einc 3tcUe turd) Sci* fjilfc feinct ^rtunbe ju eimctben
fudicn, ci* buhlcn ; inirig^ter pour obtenir qch: l'uéen nad) (a),
laufen' xuxij (d). BRIGUEUR, m. (Bri-gor). Çanbibat, wi.en.ScTCetbcr,
m.i, [um ou fur (a)]; — de louanges, \Jctbt;af*er, m. ^ebreerber,
7)i. è. |l — euse,/". Gatibifcatin, /". iSeivciberin,/". ncn.
BRILLA50IENT , adv. {Bril-iamang). voy. brillant, gUiiijenb, auf cinc
ç^lànjente ffieifc; parfaitement : ucUtcm» men, pctitcfflidi. 1. BBILL-
AXT. AIVTE, adj. {Briliang). o,\à\\\a\i [de,rcn(D)]; clair: Uli.gui
donne de la ^t*?>(i'ère: leud)tenb. flrablenb, funlclnb, flimmetub;
scintillant : \d)\m' mctnb , bli^enb; magnifique : piâdjtij, pradjtDpU ;
distingué : auêgejeii^nct ; — (comme le soleil), llrablcut;' — (comme
la lune), fc^immeriib; un coloris — , glân= ^cnbc ou bUnbenbe
îvatbc; couleur — ante^ ©Unjfatbc, f. n-, yeux. — ants, glângcnbc,
bli^cntc. iuntelnbe 'ilugcn, n. pi; agréable au son: ïlanciteid?,
glànjcnb, prâdnig, ptadîtii ppU, effcctopUf /"orf; (voix) — ante, ftatît;
attrayant: anlcdenb. bcrrlidj, oorttcfflic^ ff^én, glAn^cnb; un esprit
— , glân^cnber ©ciiî. bcrpprjtediîcubct funfdnbcï îi^ih. gcnialct
^ppî; une imagination — ante, tcic^e unb blûbcnbc (ïinbilbunaëftaft
; (végétation) — ante, blûtjcnb; santé — ante, ùppiçic @cfunb' bcii;
— de santé et de jeunesse, blûbcnb ou fltctienb uor (Befuubbeit unb
3ugenb; — de gloire, lubmglânjenb, llrablcnb von iRul^m; — antes
espérances, gtÔ§tc. bôd>flc Jpoff» nungcn, f. pi; être — -, voy.
briller. 2. BRILLANT, m. {.éclat: ©lair,, m. eè, spl. Sc^immei, m. eê,
spl; faux—, 3dMmmct, m. falfdict ©lanî; donner, obtenir du — ,
(Blan^ ocrleibcn'; de Vesprit : SffiiÇ:, m. ce, spl; — du coloris,
glànjcnbc 5aibengebun§ \ charmes : SRei^ m. cS, c; avoir plus de —
que de solide, meht [diimmctntcn ffiib aie .uûnMidjen ^.ktitanb
tabcn ou bcrtècn"; faux — , esprit : 'Ufler< wi^, m. fd}immctnbei
©i^ ; fam. fiat.en» gtlb, n. eé, spl. \ 2. diamant : 'BtiUant, m. en \
faux—, unâd)tct SiiUant, ^tia&, m. ce, spl. BRILLAIVTÉ,ÉE, pp. {Bril-
iang-té). btiUantirt; fig. ptunîcnb, fdiimmctnb. BRILL.AA'TER , a.
[Bril-iang-té). un /:i(!"'.i7nanf ; facetlircn, btiUanlitcn, auf aUcn
Sciten fd)itiffn* ; fig. son style : feincn £ttîl mit (tiinftlidîcm @lanj)
auâ[djmûden; fig. cctgelbcn mit (d). BRILL-\NTI^'E. f. (Bril-iang-
tin'). I. étoffe: '^riliantinc,/". | ■2.Parfum.'i8ait' pomabc, f.
BRIELEu^lEXT, m. {Bril-iiî-mang} ©Kïnien. 'i. 3d)immeTn, n. é,
©ianj, m. c^. 1, BRILLER , n. (Bril-ic). glan^cn-, étinceler ; funfdn,
bllnïcn; luire : Ieud>ten; projeter des rayons : iltablen, bliben; pari,
du soleil : leuditen; pari, des étoiles : funlcln, fd)immcTn, flimmcrn,
blifeen; comme un soleil, une étoile : çilanjen; (la joie) brille dans
ses regards, fttablct in fcinen 'îlu^^cn; — de santé et de jeunesse,
Don ©cîunbbcil unb jugent flto^cn; jeter itn vif éclat : ^cU glân^eni
— de tout son éclat, in DoUem C^lanje fitaf)lcn; — d'un vif éclat,
cinen lcbl)aficn @lan^ aué-fttafjlcn; — d'un éclat emprunté, d'un
faux éclat, çitei^en , einen ttiigcrifcfccn ©lanj l)abcn; rendre
évident; offcnbarcn; — dans la conversation, fcbt gciiircid) fcin;
attirer Vattention: \\éi ljcrDcr~tt)un*i A^- se montrer:
bcu>PT'itc*en', Cdiimmcin; faire parade: prunten mit (d)i faire — ,
prop. glânjcn madicn; fig. gK^in^en laffen"; fîg. faire — la vérité
aux yeux de qn, bit ©aljrijeit kucij« ten laffcn* mox (d), cffcnbaun
(A)i faire —
The text on this page is estimated to be only 14.40%
accurate

174 BRIN BKIQ (des avantages) aux yeux da qn, in il)ttm

btflcn Vlîditt itijcii; /aire ressortir : tjcrDct-ttctcn laffcn*. 2. BRILLER,
n Chnss. «Ut jlrtiftn, n. ticttii; hi nu.it : l'«i Olbtnt Sôjcl falistn", beim
^iuftlfdicin iajni. BRILLUTER ml BRILLOITER, il.(Bril-io-lé). 1. fnm.
tin retniil i(lâlHtlt. || 2. se —, r. fig. &\m\ um fidi ivnfcn". BRLWADE,
/■. {Bri-^nnir). |. plaisnnterir : bummtt immflii mit {d}\ des
cloches: Uiutcil, flinjtlll, ,111 ^ct rttiiniit ittitn; fîg. flimpitn.
BRIMBELLE, f. (Bràng-bàr). Bot. ibnmlicUc, f. ôtiKIbtttt, f.
BRIMBORIOiV, m. {Bràng-ho-riong). 8ipicUverI, n. Svicicici,
/". îânb, n- îàntclfi, f; petits meubles : TOpipfadjcn, f. pi. Slti.
niilltitni, f. pi; fam. Vumpmi, f. »timbci= tionê, m. pi. BRIMÉ,
ÉE, adj. (Bri-mé). jtflcdt; raisini —s, jtflccilt ®cintt,iub(n, f.
pi. BRniER, a. (Bri-me). Mil. Sclbatcii» tvih trciben*. BRIK,
m. [Bràng). Bot. 1. d'het-be, etc : -fialm, m. i, c OM tn,
.Çiâlmdjcii. ». «. I 2. scion : &iioi, vi. ©Dto|, m. ci, t, SRcià,
II. ce, tt; de bnis : î^iofidim, n; — de marjolaine,
i!J!at)Man(pio§, m; — de bouleaii, 'Birffnrcicdifn, u. | 3. /?
(/. un — de |ilnnip, Scîtitbtii, n. «■, — de cheveux, lUincé
fjAtdjcii ; — de bois, ériot £))lit> tttdini, «; broussailles :
Sttiiudibolj, n. tê, ^tt. înimm, m. et n. ce, -et; — de laine,
fîBollbaat, «. (i. f, pe'il bout : Sni' *tii, >i. S; — de paille,
StïobbJim, m; pointe : Spi^c, /■. n; (bas) à 2 ou 3 —s, jreti"
l'bn btcibtStliii». | 4. /l'p. et fam. un peu : BiSdjcn, n.
Stûmdicn, n. i, Sput, f. (n, avoir un petit — d'amour, cin
î^iêd)cn Bftiicbt fciii, Ipour. in (a)); pas uu — ,.tciiic ©put; il
n'y a pas un — de pain à la maison. c« ift nidit baf mcibcilc
îlûddjcn !Bto^ cotbanben. | â. fig. c'est un beau —
d'homme, ce ift cin jiof et, f*ôii3tira*i'cnct SDÎanil -, c'est
un beau — de fille, cS i(t cin (dibiutcreadifcntS ai!âbd)cn. |
6. arbre de—, einiliimmiijet Baum, ni. ce, - c; beau — de bois,
fd)iJÙcvStamin,îii.cS, = t; —s de fagot, Mcisbolj, II. biiiinc
Mtifct, n. pi; bois de —, a,tuinfiamm. çtctobct Stanim.
Staiiimbolv n; beau — d'arbre, fdliincé ^rtamiiilioU; teau —
de chêne, fd)ônci ei*ciii^amm; maîtres —s, ^auptfiâbc, mi.
;)/. | T. chanvre de premier oxi deuxième — , ôanf ren ctftci
ou (wcitci Qualitât; Co»n.t!cinnMnb(/'.) ,tuê bel (Sbi-
impajnc; Artif. «attc [f.) su bcn ftiiiififcuciu-, Cord. S.'ihc, f.
w; — d'éventail, Sâ*ctilâbc, m. pi; — d'estoc, an bti. bcn
(Snbcn bcfdilajcnet Stocf, m. ce, -c;
Gi/)».®ptingfiocî,îH;il///.9littcrfdiwcit,ïi.eê, tt. Il 8. Ornith.
—blanc, (')ltt) Golibti, m. Il 9. loc. adv. — à — , ^il"tn'ci|c,
fabeh. rociif, Stiitf fût Stiid, cin Jijâlradjcn nad) bcm onbctn.
BRIMASSE , f (Bri-nasz'). Com. ®(ïj (n.) jrocitci Dualit.it.
URLN D'E,STOC, m. (Brang-das-tok). au beibcn (ïnbcii
bcjd)la,jciict Stod, m. c«,^c; Giimii. êptiiiajiod, ))i'; Mil.
SHittcifi^iircit, «." ce, tt. DRINDE, f. {Brâng-'l'). fam. et peu
usité : 3iittunf. m. c8, spl. ©cfunbbtit, f. en; fig. être dans les
— s, im ©cint«umcl fcin, Veîpi^t fcin; boire des — s,
(«cfnnbbcit ttiulcn'; porter une — , tint i^efunbbcit auS-
btiniieir. BRIMIES, f.pUBrang-d'}. o« brinDlsl, Oci'iir.
'Btinbiji, n. BRIMIILLS, f. {Brung-dil-{ie). Bot. Stiiddien. »i.
iHei»d)Cii, n. i, fleines Scié. BRIKta'E , f. {Brâng'). leleubei)
,«lep. pet, 1)1. b, fdjIeditiicbauK* 'l'fttb, n. tf, t; fam. mâttc,
f. n. || udc. en —s. m vîtûdcii. BRINOLEB^LE, f. [Bràng-g'-
baD. roi/. iiniMBALE, 1iumpen(*»tnjel, m. «: Mar. iScdftod,
«i. eê, = e. BRIO, m. {Brio). Mus. iBtio, n. Scuet, n. Vel-
baflisfcit, f DRINV ILLIÈRE, f.tBràng-V!i-H-àr'). ni'
BRINV11.LIERS, f: Boe.'Wutmfpiçiclia, /■. BRIOCHE, f. [Bri-
oSi-h'). Cuis. ïtii'djt, f. îditivv't, f- Stnllt, f. n, Butleifudien, w.
è; fig. îdjniliet, m. ttiobct îtttbum, bummet Stieidi; fam. Vfà,
m. ii\ commettre, faire une -, einen l'od fdjieÇen'.
BRIOCHIN, m. (Sri - o- schiing}. Horti'-. 'ïluipnirid). m. cô, c.
BRIOLEIR, m. {Bri-o-IHr'i. 1. iaudelier : qiadefcltttibtt, m.
j«. j i. pâtissier : ïtclltnb.îdet, 711. i. BRIO>J ou BRTON, m.
IBri^ng). 1. il/.n-.îlnfah, m. es, -c, cbetftct tbeil bcj
Sotbft|le»cnê. I 2. Bot. Sunjfctnmooê, n. Minbtninooe, u.
gidjenmoo*, n. ci, t. BRIOIVE, f. {Bri-on'). ou BRTONE
couLEUVRÉi:, Bot. 3auentûbt, f. n ; — blanche, ®id)ttiibc. f.
BRIONIVE, f. (Bi'j-o/i'). Com. iîetmtanb {/'.) aue bet
9îotm>inbic. BRIOSO. adv, [Bri-o-so). Mus. conbrio; brioso;
Icbbafl, fcuetij. BRIOTTE, f [Bri-of). Bot. («tt) «ne mmu, /'.
BRIOU, m. {Bri-u') fleingejlojene £teinc, m. pi.
BRIQUAILLOIVS. m. pi. (Bri-keilio-ig\. Techii. Heine
Sicseljicine, m. pi. jcibtod)cne 3ieoiel, «1. pi. BRIQUE, f.
(Brik'). 1. Sitgtl. «i.SWautt. jiciicl. in. 6, Siegcljlein, m.
OTauetfiein, m. Sa'dilcin, ru. té, c; — blanche ou rèfract,aire,
'ïoticUanjicjicl, «1. fcueifefiet îtein, Gbamotlcftein, m:'—
creuse, .>>i!bl-,ie9tl, m: — dure, .^attbt.inb, m; — à
nettoyer, liuÇilcin, «1; — hollandaise, ftlinlet, m: —
réfractaire, 'Sianbiiejelftein,»!,- —crue, Vchmilein,
«i.Vcbmiicael, »i. — cuite, oiebtann^ tet Siejcliicin,
SSadiiein, m; — volante ou légère', leiditct Sicjclflein; — de
liaison, Sinbllcin, m; — pour la cuisson, S'C^tl. ftein {m.)
mmîBtcnnen; maison de— , ôauê (11.) Dini 3icjelftcincn;
rnuge de —, oicjcl. totb. n; ton de —, 3ie;telfaibt, f: tas de —
s, -5ah (m.) oit ^M\Un (ni.) 3ie9cl; four à —s, 3iejclofcn, m;
huile de —, 3iejelôl, n; terre a —, Sitjtletbe, f: poussière de —
pilée, 3ie.\elmci)l. n; — de parement, ïllcnbiicitcl, m; — de
rebut, ©eid)btant, m; bâtir de — s, mit 'Badftciiien bauen; —
posée de champ, auf Me Ijcbe flante (icricU' tet 3ieeicl;
assise de — s posées de champ, 'SoUldiidit, f I 2. fig.
tablette: lafel, f. n, atidjcl, m. b; — d'étain. lafd {f.) 3i"n; —
de 'savon, lafcl (f.) Seife ; morceau : 3iiid, II. té, e. 1 .
BRIQUET, OT . (Bri-ka). i. ©toM, «i. ^cuetftaljl, m. té; pierre
à —, Slint. flcin, m. i, e; battre le —, Rtuet fd'laijen'. I 2.
objets : Seucticuçi, », é, spl: — à friction, ©ttcidîfcueiitiiç;, n;
— à mèche, Muntenicutijcuoi, n; — phosphorique, l'bo».
photfcuctstU9, 'n; — à platine, OUlatinafeuet. icuj, n; —
pneumatique, — à piston. Èempttfncn«fcuctjtuii. /i. | 3. Mil.
sabre court : Scitcnçtcivcbt, n. b, f, Xeçtcn (»h.) bet
Snîanictic, fùtjet ïâbcl ; iroii. 'liaUafd), m. té. e I .4. Serr.
'liufbanb, »i. ce, -et. 2. BRIQUET, ni. chien : fltinc Stade,
^adiêbunb, m. é, e. BRIQl ETAGE, M. (Bri-kS-tii-j'). 1Mac.
'JVidnciiimauetunA, f. 3iC3Cln)etf, «.ce, 3ie(iel,itmauct, >l.
8. | 2. enduit : jcmalte 'Sadiieuiaibcit, Siejebiiifttidi. «i. i, c;
É É
— imiU. iiad,'iieabmtet 3ie>teltotbbau. BRIQIETÉ, ÉE. pp.
(Bri-kS-té). 1. fait 'le tn-iiiucs M\i 3icncl(itin. | 2. ''""genire :
5ic,jclmeMfaibi,j. | 3. peint en 'briques : jici\ebiïti.t bcmalt
ou ançiciiiidjcn; tons —s, buicbfd'l.i.viie ,",iiben. f.pl; Mcd.
urine —ce, si(,teliatl'i,je[ '>ain. 1. BRIQl ETER, .1. (/fri-
A.W.'). jicimrJrc iic.ylaitijoii ludrSadfmnati benubtcn ou .iii-
itrcid?cit'. 2. BIIIQIETER (SE), r. m einailbct fioycn* ou
leibcn*. BRIS 1. BRIQl ETERIE, f. ( Bri-k»-tS-rC). I. Terhii.
3ieAelbiennttei, f. 3"9'<i.3iteilet, m. é; marchand :
3iinbbôlvttnb\nblct, m. é. BRIQIXTTE, f. (Bri-hal').
3ûnbmaiTt, f, „; _ de houille, acîormtt Steinttble -, — de tan,
de motte, Soblu*tn, m. i, tcb. Ivil'e, m. ê. BRIS, m. (Bri). I.
Jur. (îtbKiiung. f. '!lufntditn,/i.gibtedicn,n.«..'ij)(; —
descellé, î\tjeleibtt*tn, h. SicjeVbtudi, m; — de prison,
'!luebic*en (.t.) ouêbem CïtfintiniiTe; — de ban, 'Bannbtud',
m. | 2. — démarché, (jmalti'amt) aieibinbeiuna; be»
OBaatcncftlattl*. I 3. débris : Itùmmet, m. pi; Mar. débris
d'un narire : (âiiifêitûm' met m. pi. ffliad, 11. ti, t; droit de —,
ïitanbted)!, n. li. | t. B/'is. — -d'huis, itebicdienc îitnfitt- unb
Ibûtbânbet, n. pi; assurance contre le — des glaces.
îliltlutcn; ^f.) ^t^en bic Î5tnjltt(d|»ibtn. BRIS.^BLE, adj.
(Bri-sabr). \nbtcd'Iid'. BRISAC, m. (Bri-sak). Géogr. »nifadi,
M. 1. BRIS.VSiT, m. {Bri-sang',. 1. Mar. écueil : Klippcn. f pi.
'Stanbunj, f. en. | 2. corps sur lequel la mer vient se briser ■
-Srtbau, m. eê, c, blinbc Slippe; rejaillissement :
ïïïlcetbtanbung, f. 2. BRIS.\>rT, -*ATE, l<7-6i;(j'ti).
oMBRCSQfEMBiLLE, Jeu. ©tûécam* bille, f. 'ïiùêaucmbiUe, f.
BRIS-DlllIS, m. {Bri-dûi). Bios. jtbtnd'enc ôienftet' unb
Ibùibânbet, n. pi. 1. BRISE, f. (Bri-s'). Mar. iBiife, f. Subie, f.
selinbet iSinb; petite —, maêi^et 'ISinb; folle —, 'Binbfic^,
m. tè, -t ; les,;.re —, Icidiic .«ûble ; — de terre, Canb> TOinb.
m: — de large, de nier ou marine. 2ecnîinb, »i; — carabinée
ou forcée, 2iutmnjinb. >n. 2. BRISE, f. 1. Charp.
Sdileufcnfdusjn>itl. m. ê. ||2. — s, f.pl; Menuis. ^cU' n-
littct, m. î, .î)cbelipan, m. eà. ^. BRISÉ, ÉE, pp. (Brisé). 1.
cassé : v-tbti'*cn; détruit : ^etttûmmctt; rompu ;
,ib.\tbiod:cn ; cre, m. pi; Blas. chevron —, bùtil'btcd-cnet
©patten; Rel. (volume) relié à dos —, mit Icfem Sùden; fig.
être —, nitbctçicfd'lajien, eifitcrfi. ent' Itaftet fcin; par la
maladie : entliàfttt fein, être — à qch, jereôbni fein an {.\).
BRISE-COIJ, m. (Bris'-ku). I. 6al*. bttdic, f. 11; passage :
çief,ibtlidî«t Ctt; *'.et, »ii. >v II 2. homme : ÎBajcbals. m. ti.
-t. BRISÉES, f. pi. {Bri -se). Chass. '^tûd'C, m. pi : branches
coupées dans un taillis : (tcm îBilbe) jffnidie Snjeij'.' m. pi.
bobt 3p«t, 3abtie. f; fig. euui, f. Suiiitapicn, f. jil.sur les —,
d'apris rcTemple : twà) bera Seifpiele (de, |g.)1j fin. suivre
les — de qn, in jtm. (o) 5u|f fiàv'fen tttitn" ; aller, courir sur
les — da qn, icin. (D) in« ©eb.ije jebeii* ou lt-mnnn"i
revenir, reprendre ses — , cilie auf jtçic* bene îad-t TOietei
vet-nebmen' ou an-fanjtu*. IIRISE-GL.\r.E , m. { Bris'-
çlass^. iSijbod, m. tv>, = t. (îiêbtee^tt, m. i.
The text on this page is estimated to be only 15.73%
accurate

BRIS BRISE-IMAGE , m. [Brisi-ma-f). iCilbcrfiurmcr, m.

BRISE - LA>IES , m. (Bris' - lam"). May. >^,^fc^^amln, ni.
*SicUenbrcd^ct, m BRISE-Ll \ETTE, f. {Bris'-lu-naf). Bot. '-Huiïcniroil,
m. ce. BRISEMEXT, «i. (BrisH-mang). 1. choc : iSianîunj, f. m,
fficUciifdjlaj, m. ce, "e. I 2. bi'is: Stuci), m. es, -c; — des vagues,
Sojtnttudi, m. tS,-c; — des flots, ÎScUcntrudî, «i: — des glaces, 3"'
ttùmmcrn {n.) In SiêfdjcUcn. | 3. fîg. donleur vive et profonde :
.^cr^cnlcit, n. tê. en ; — de cœur, ■^cncnètummcr. m. 3"=
[llilf*illl,\. /•. I 4 Med. abatlement : 5!ic. ^^t>^efd'la3cn6cit, f.
'îlbjci'ciîlajtnbcit, {. gnt= ttâftimj.Y. sp/. BRISE-MOTTES, m. (Bris'-
mot'). I. Ornith. i!Scijfcl)ld!Cti, n. ê, £*oUcithûpfci, m. i,
JBcipfdjroatii, m. ce, ^c. | î. Agr. %iti\oi\\i, f. n. BRISE-jniR, m.
{Bris'-mûr'}. Mil. 2?iauctbiedicT, hi: canon r ©cfdiùb. n. tî. t. BRISE-
OS, m. (Bris'-o). 1. Bot. Sein. bit*jra.>. ». I i. Ornith. gifiaMcr, m. è.
BRISE-PIERRE, m. tBris'-piàr'}. Chir. 3tcinl'tcdiet, >/i.
Î81aîcnfteinbtfctjei,»i.è. BRISER, a. {Bri-sé). 1. mettre en pièces:
^crbtfd?cn*, {ci\i>Ua,cn' \ avec v ioïence : ^ctirûmmttn.
;ctbTcd:cn* ; mettre en miettes : ^cim.ilmcn ; — en deux, cnt' jwci
fdilajcn' ou m.\d)cn; — contre qch, jct. f^cUtn' [contre, jcjcu (a));
éclater : jtt. fdjmcttcrn; anéantir^ ruiner : âcttrûm» mcrn ; détacher
: ab-bicdjcn*, ab-fdjlav^cn*; une branche, une fleur : tnidcn, cin~
înicEcn; en heurtant : ^etftoçcn'i enfoncer en frappant : ein-
fdilacifn*, cin-jÎL^pcn'; OMl!re>.-auf-brcdicn*, crbrcdicn'.auf-
fdilagcn*, cin-ftoiîcn*, auf-flpÇen'; un cachet : ctbtCî t^cn*; déchirer
: jCTtciçCîl* ; fig. ses fers : ff renjcn ; — ses chaînes, feint Scitcn ;«.
budïcn'. I 2. fig. les liens de Vamitié : auf-lô^cn, jftrcipcn*; son
avenir : ^ciftôtcn; paralyser : [ibmcn , le cceur : jcneipcn'; la colère,
la volonté : bicdicn*; le Joug : ab-fcbûttdn. btc*tn". | 3. accabler :
f(^)"la■ gcn*. nictct-fdila^cn', niebct-brûcfen'; fatiguer, etmûbcn;
epuise>-; crîdjôpfen, Icntcn= labm madicn; torturer : idtetn ; — qn.
de coups, tuid) u^^ buté-baucn", but* unb butcÇ-stûacln; — le
tympan, t.i* Ii(>mmtlftU fptcn.jcn. \i. plier : iuiammcn-lcjtn. | 5.
Grant. une période : bïcd^cn*, cin-ftcUen, jcttciçcn*; fîg.
interrompre : btc±cn*\ brisons là-dessus, ^cnug baccn I btcdjen tpir
bamit ab! j H.Phr/s. un rayon : cincn Sicïjts fita^l btcdjcn'; la lame:
ftâmpdn; le chanvre: btcdjcn*; Grav. un Irait: ab-brcdicn", ab-fc5tn.
| 7. Blas. — un écu, cin îifcilb jum Seijtidicn gcbcn'. | 8. fam.
habituer : jcn>ôl)ncnan(i); — qn. au travail, jcm. (a) on tic 'îlibcit
j[crcôbncn-, — des souliers, bic Sdjuljc auè-ttctcn'. ||
9.>^.ictbtt(l)cn■, btcditn"; ne pas continuer : ab-bicc^cn' ; — avec
qn, mir jcm. (D) ticd'cn". | 10. B?as. — d'un lambel , cincm SSappcn
cintn lutnictttagcn jiim aStiîcidjcn jtbcn". | 11. Chass. — bas,
àbjcbtudicnc Swcijc auf bic îpui Itjcn ; — haut, orociçic cin-fnicfcn
unb b,ïnjcn Uiffcn'. I 12. Mar. aller à la côte : ''dicilctn an (d). Il 13.
se — , r. btcdjcn", jctbtcd'tn', jctfni. aern; anéantir, détruire ■
;ctttiimmcin ; fracasser : icti'd-cUcn'; éclater : jctfptin: ijcn',
ictpla^cn ; pari, des vagues : bran= ïcn. 1 It. échotter ■ fdjcitctn,
jctrcfimcttcin: {les vagues) vont se — contre un êcueil, btcci)en ni)
an cinct Slipjjc. | 15. s? plier : ftd) ;uiammcn~l;jcn laffcn*.
;ufanimcnlci(bat fcin. I 16. fig. btcdicn'-, (à cette pensée) mon cœur
se brise, btid)t mcin icty, Prov. tant va la cruche à l'eau qu'à la fin
elle se brise, fp lang jclit ïct Stuj an bcn 'Sii) bië cnblidi cr bticbt; l'arc
trop tendu se brise, rotnn man bcn Bojcn iibctfpannt, fo iiic^t et.
BRISE-R AISOX, m. (Bris'-ra-song). fam. topfIc|"ct 2din\t^cr. BRISE-
SCELLE, m. {Bris'-sza-lé}. ©îegcleibrcdict, rn.î. BRISE-TOVT, m.
(Bris'-tu). unje. (e^iiftet ÎWcnfct), SJÎcnîe^fm.jbctîlUes jctbticiit.
BRISEIK, m. (Bri-sSi-"). 1. qui casse : 3ctbrcd;er, m. ê ; ouvrier : —
de chanvre, .-&anfbre^cr, «i,- — de castine. BROC .Salfjitinilopfcr, m.
i. | 2. machine : Bot. tra^c, f. — d'une brisense, !BcrtbciIun^éwaljc,
f. I 3. — s d'images, ïïilbeifiiinncr, m. pi: —de sel, Sal^ictricjct, m. i.
|| — euse, f. Mach. S*tubbclma|'*int, f. .Sanfbrcd-mafcbinc. f. n.
BRISE -\-E!VT, ni. { Bris'-wang). Agric. ÎBinbi'dnrm, m. i, c,
ÎScttctba*, n. ci, "ex, Sd'uJiiMnb, f. "t. BRISG-Al', m. ( Bris' -go).
Géogr. ïïtciéitau, n. BRISIS. m. (Bri-si). Arch. »tud)rein. (cl, m. i,
Tadibtutt, m. flad)Cr ®itbcl. BRISKA. m. (Bris-ka). Btitfii)fa, f.
BRISOIR, m. {Bri-sonr']. Techn. 'Btcdic, /'. »rcd)ban[, f. Sncfc, f; —
de chanvre, 'ianfbttdic, f; — de lin, ^Uxéi-btcdic, f. — de paille,
Sttobbicdjc, f. BRISOV, adj.m. iBri-.stt}. ou grisou, IVu —
.jd'Ia,icnbeé ©cttcr, ©tubcngaè, n. fcunger r^wabcn. BRISQCE, f.
(Brisk').jeu : Stièfcffitl. n. i. z\ atcntt : îtumpf, m.eî.-t. BRISSE, m.
(Brisz'). H. nat. cifôrmi= ger 3cci^el, !£ceci, n. ^tt.u\, n. c^, ci.
BRISSOlDE, m. (Bri-s:o-ïd'). octftci. ncitct SccijcI. Il adj. btivfusattij,
bem TOeciei âbnlid*. BRISVRE, f. {Bri-sûr'). 1. Techn. ©iud>, 7n. c?,
" c ; cassitre : Ânicf, m. ti. c; fêlure : 3piung, m. eë, ~ i ; fente :
Spaitc, f. n; déchirure : Wif, »i. (Te«, iîe. I 2. endroit de la —,
Btud'ficUc. f, n; jointure, articulation : Bitgunj, f. en; Stuge. f.n\ à
charnière : ©tu*, m. iînie, n. 'ce, c. | 3. Anat. articulation : (^clcnî,
n. té. c. I 4. Mil. — de la courtine, ÏBtjfûic, f. Siud) (m.) am
OTittcliraU, Serlànaeiunçi (f.) bct îtieidilinic. | 5. Blas. »ciici*tn, ». é.
Siifiite, f. n. I 6. 3Iar. — d'un mât, Rn\i. m. îbtil (»i.) eincS
Sïïafibaumtê ; à —s, cinjcicnît, jufammcnicçiboi, jclnict.
BRITAXMQVE, adj. {Bri-ta-nik'). biitannii'd), biitiid) ; les fles —s, bic
btiti. (*cn înuln, f. pi; Sa Majesté — le roi, ïcinc ilîajcflàt bct fiônij oon
0toÇbiitan> nicn , Sa Majesté — la 'reine, 3bic ÎRaic fiât bic Aôiiigin
Don (iitbÇbiitannicn ; métal — . Sntania.KîctaU. n. BRIZE . f. {Bris').
Bot. Sittetjiaè, n. ti. BRIZOMAAiCBE, f. {Bri-so-mangszV).
'Briiomancic, «. îtaumbcutcici, f. BRIZOM.IXCIES, m. (Bri-so-
mangsziàng}. îtaumbcutci, m. è. || — ienne, f. îiaumbiutcrin, f. ntn.
BROC, m. {Brol I. ivise.-Sdjitifiannc, f. n, Siu^i, m. tê.^Cj — à vin,
'Bciiitiuçi, m. 1 2. son contenu: Stug, m; — de viii, Siuj (ni.) «Itin,
SiUAtioU (m.) ÏBtin. | 3. broche : Statfpiep, m. ce, c. || 4. de bric rt
«le —, loc. adv. ci'n libciaU bci, auê allcn (ïtfcii unb gnbcn, auf aUcilii
EJcjc, tinttlci recbct. || 5. de — en boache, loc. adv. manger de la
viande de — en bouche, Dcm iBialipicçc TOcg-ciTcn*. BROC.AIELE, f.
[ Bro-keil-(ie). 1. fond : iBiudicifen, n. i, tobct Sctitct. | 2. pavé :
"ïflailciliefclllcinc, m. pi. BROCAJiT.AGE, m. (Bro-kang-ta-j').
Matitâlcnljanbcl, m. «; faire le —, mit Mai tiiâtcn ttôbcln, tm
Maiitdtcnhanbtl ittiben". BROCA.VTE, /■. (Bro-kang-f). fflaa.
tenftangc, f. BROCANTÉ, ÈE, pp. (Bro-kang-té). jjcbanbclt,
çicidladictt. BROCÀXTER, n. {Bro-kang-té). l.mh îeltcnbeucn ou
ÏRatitdttn hanbdn, fcftadittn, IiiJbcIn. Il 2. a. acheter : etfd)ad)ctn.
BROCANTEm, m. {Bro-kang-tiSr'l £*a*cict, m. Katitâtcnbânblct, m.
À\imifadicnfcinblcr, m. Iiôbict, m. è. || —euse, f. SRam.iiinbànblctin,
f. Itijblctin, f. mn. 1. BROCARD, ni. (Bro-kar'). mo raie: îiidiclicbe, f.
Stidjciei, A ilei^entci SBiJ; diseur de —, £tid;lci, m. i. 2. BROCARD ou
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade

Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.

Let us accompany you on the journey of exploring knowledge and

personal growth!

textbookfull.com